/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:26:35,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:26:35,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:26:35,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:26:35,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:26:35,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:26:35,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:26:35,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:26:35,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:26:35,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:26:35,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:26:35,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:26:35,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:26:35,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:26:35,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:26:35,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:26:35,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:26:35,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:26:35,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:26:35,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:26:35,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:26:35,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:26:35,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:26:35,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:26:35,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:26:35,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:26:35,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:26:35,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:26:35,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:26:35,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:26:35,090 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:26:35,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:26:35,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:26:35,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:26:35,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:26:35,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:26:35,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:26:35,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:26:35,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:26:35,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:26:35,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:26:35,098 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:26:35,131 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:26:35,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:26:35,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:26:35,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:26:35,136 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:26:35,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:26:35,136 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:26:35,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:26:35,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:26:35,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:26:35,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:26:35,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:26:35,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:26:35,140 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:26:35,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:26:35,140 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:26:35,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:26:35,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:26:35,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:26:35,141 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:26:35,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:26:35,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:26:35,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:26:35,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:26:35,142 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:26:35,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:26:35,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:26:35,143 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:26:35,143 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:26:35,143 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:26:35,413 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:26:35,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:26:35,432 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:26:35,433 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:26:35,434 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:26:35,434 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.opt.i [2019-12-26 23:26:35,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b4176994/7d465fbc480e4634b10c5351e5b459b2/FLAGa4135125f [2019-12-26 23:26:36,108 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:26:36,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_rmo.opt.i [2019-12-26 23:26:36,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b4176994/7d465fbc480e4634b10c5351e5b459b2/FLAGa4135125f [2019-12-26 23:26:36,419 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b4176994/7d465fbc480e4634b10c5351e5b459b2 [2019-12-26 23:26:36,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:26:36,430 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:26:36,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:26:36,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:26:36,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:26:36,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:26:36" (1/1) ... [2019-12-26 23:26:36,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd8673c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:26:36, skipping insertion in model container [2019-12-26 23:26:36,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:26:36" (1/1) ... [2019-12-26 23:26:36,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:26:36,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:26:37,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:26:37,059 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:26:37,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:26:37,202 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:26:37,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:26:37 WrapperNode [2019-12-26 23:26:37,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:26:37,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:26:37,204 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:26:37,204 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:26:37,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:26:37" (1/1) ... [2019-12-26 23:26:37,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:26:37" (1/1) ... [2019-12-26 23:26:37,272 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:26:37,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:26:37,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:26:37,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:26:37,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:26:37" (1/1) ... [2019-12-26 23:26:37,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:26:37" (1/1) ... [2019-12-26 23:26:37,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:26:37" (1/1) ... [2019-12-26 23:26:37,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:26:37" (1/1) ... [2019-12-26 23:26:37,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:26:37" (1/1) ... [2019-12-26 23:26:37,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:26:37" (1/1) ... [2019-12-26 23:26:37,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:26:37" (1/1) ... [2019-12-26 23:26:37,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:26:37,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:26:37,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:26:37,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:26:37,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:26:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:26:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:26:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:26:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:26:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:26:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:26:37,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:26:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:26:37,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:26:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:26:37,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:26:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:26:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:26:37,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:26:37,411 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:26:38,433 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:26:38,433 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:26:38,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:26:38 BoogieIcfgContainer [2019-12-26 23:26:38,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:26:38,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:26:38,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:26:38,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:26:38,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:26:36" (1/3) ... [2019-12-26 23:26:38,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674ab465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:26:38, skipping insertion in model container [2019-12-26 23:26:38,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:26:37" (2/3) ... [2019-12-26 23:26:38,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674ab465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:26:38, skipping insertion in model container [2019-12-26 23:26:38,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:26:38" (3/3) ... [2019-12-26 23:26:38,445 INFO L109 eAbstractionObserver]: Analyzing ICFG safe001_rmo.opt.i [2019-12-26 23:26:38,455 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:26:38,455 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:26:38,462 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:26:38,463 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:26:38,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,501 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,501 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,510 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,510 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,510 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,511 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,511 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,519 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,519 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,554 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,554 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,557 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,558 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,558 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,562 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,563 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:26:38,578 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:26:38,599 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:26:38,599 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:26:38,600 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:26:38,600 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:26:38,600 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:26:38,600 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:26:38,600 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:26:38,600 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:26:38,618 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-26 23:26:38,620 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-26 23:26:38,720 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-26 23:26:38,721 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:26:38,737 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:26:38,763 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-26 23:26:38,817 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-26 23:26:38,817 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:26:38,825 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:26:38,845 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-26 23:26:38,846 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:26:43,534 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-26 23:26:43,898 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-26 23:26:44,010 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-26 23:26:44,033 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78277 [2019-12-26 23:26:44,033 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-26 23:26:44,037 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 106 transitions [2019-12-26 23:27:00,748 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 107408 states. [2019-12-26 23:27:00,750 INFO L276 IsEmpty]: Start isEmpty. Operand 107408 states. [2019-12-26 23:27:00,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:27:00,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:27:00,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:27:00,758 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:27:00,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:27:00,764 INFO L82 PathProgramCache]: Analyzing trace with hash 809703812, now seen corresponding path program 1 times [2019-12-26 23:27:00,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:27:00,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540001752] [2019-12-26 23:27:00,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:27:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:27:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:27:00,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540001752] [2019-12-26 23:27:00,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:27:00,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:27:00,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130883627] [2019-12-26 23:27:00,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:27:00,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:27:01,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:27:01,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:27:01,008 INFO L87 Difference]: Start difference. First operand 107408 states. Second operand 3 states. [2019-12-26 23:27:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:27:02,410 INFO L93 Difference]: Finished difference Result 107108 states and 460900 transitions. [2019-12-26 23:27:02,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:27:02,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:27:02,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:27:03,109 INFO L225 Difference]: With dead ends: 107108 [2019-12-26 23:27:03,109 INFO L226 Difference]: Without dead ends: 104924 [2019-12-26 23:27:03,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:27:10,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104924 states. [2019-12-26 23:27:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104924 to 104924. [2019-12-26 23:27:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104924 states. [2019-12-26 23:27:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104924 states to 104924 states and 451982 transitions. [2019-12-26 23:27:14,202 INFO L78 Accepts]: Start accepts. Automaton has 104924 states and 451982 transitions. Word has length 5 [2019-12-26 23:27:14,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:27:14,202 INFO L462 AbstractCegarLoop]: Abstraction has 104924 states and 451982 transitions. [2019-12-26 23:27:14,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:27:14,202 INFO L276 IsEmpty]: Start isEmpty. Operand 104924 states and 451982 transitions. [2019-12-26 23:27:14,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:27:14,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:27:14,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:27:14,206 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:27:14,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:27:14,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2105056515, now seen corresponding path program 1 times [2019-12-26 23:27:14,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:27:14,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432667944] [2019-12-26 23:27:14,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:27:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:27:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:27:14,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432667944] [2019-12-26 23:27:14,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:27:14,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:27:14,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737004205] [2019-12-26 23:27:14,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:27:14,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:27:14,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:27:14,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:27:14,304 INFO L87 Difference]: Start difference. First operand 104924 states and 451982 transitions. Second operand 4 states. [2019-12-26 23:27:20,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:27:20,210 INFO L93 Difference]: Finished difference Result 168606 states and 697152 transitions. [2019-12-26 23:27:20,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:27:20,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:27:20,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:27:20,779 INFO L225 Difference]: With dead ends: 168606 [2019-12-26 23:27:20,779 INFO L226 Difference]: Without dead ends: 168557 [2019-12-26 23:27:20,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:27:25,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168557 states. [2019-12-26 23:27:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168557 to 152629. [2019-12-26 23:27:28,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152629 states. [2019-12-26 23:27:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152629 states to 152629 states and 638547 transitions. [2019-12-26 23:27:29,593 INFO L78 Accepts]: Start accepts. Automaton has 152629 states and 638547 transitions. Word has length 11 [2019-12-26 23:27:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:27:29,593 INFO L462 AbstractCegarLoop]: Abstraction has 152629 states and 638547 transitions. [2019-12-26 23:27:29,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:27:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 152629 states and 638547 transitions. [2019-12-26 23:27:29,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:27:29,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:27:29,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:27:29,605 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:27:29,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:27:29,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2027270657, now seen corresponding path program 1 times [2019-12-26 23:27:29,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:27:29,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632239407] [2019-12-26 23:27:29,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:27:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:27:29,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:27:29,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632239407] [2019-12-26 23:27:29,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:27:29,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:27:29,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306830436] [2019-12-26 23:27:29,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:27:29,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:27:29,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:27:29,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:27:29,693 INFO L87 Difference]: Start difference. First operand 152629 states and 638547 transitions. Second operand 4 states. [2019-12-26 23:27:36,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:27:36,916 INFO L93 Difference]: Finished difference Result 217678 states and 889823 transitions. [2019-12-26 23:27:36,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:27:36,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:27:36,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:27:37,585 INFO L225 Difference]: With dead ends: 217678 [2019-12-26 23:27:37,585 INFO L226 Difference]: Without dead ends: 217615 [2019-12-26 23:27:37,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:27:43,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217615 states. [2019-12-26 23:27:46,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217615 to 183279. [2019-12-26 23:27:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183279 states. [2019-12-26 23:27:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183279 states to 183279 states and 761454 transitions. [2019-12-26 23:27:47,516 INFO L78 Accepts]: Start accepts. Automaton has 183279 states and 761454 transitions. Word has length 13 [2019-12-26 23:27:47,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:27:47,517 INFO L462 AbstractCegarLoop]: Abstraction has 183279 states and 761454 transitions. [2019-12-26 23:27:47,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:27:47,517 INFO L276 IsEmpty]: Start isEmpty. Operand 183279 states and 761454 transitions. [2019-12-26 23:27:47,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:27:47,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:27:47,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:27:47,521 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:27:47,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:27:47,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1789207667, now seen corresponding path program 1 times [2019-12-26 23:27:47,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:27:47,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620456454] [2019-12-26 23:27:47,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:27:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:27:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:27:47,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620456454] [2019-12-26 23:27:47,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:27:47,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:27:47,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282574523] [2019-12-26 23:27:47,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:27:47,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:27:47,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:27:47,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:27:47,577 INFO L87 Difference]: Start difference. First operand 183279 states and 761454 transitions. Second operand 3 states. [2019-12-26 23:27:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:27:47,713 INFO L93 Difference]: Finished difference Result 36985 states and 120640 transitions. [2019-12-26 23:27:47,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:27:47,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 23:27:47,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:27:47,800 INFO L225 Difference]: With dead ends: 36985 [2019-12-26 23:27:47,800 INFO L226 Difference]: Without dead ends: 36985 [2019-12-26 23:27:47,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:27:47,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36985 states. [2019-12-26 23:27:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36985 to 36985. [2019-12-26 23:27:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36985 states. [2019-12-26 23:27:53,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36985 states to 36985 states and 120640 transitions. [2019-12-26 23:27:53,795 INFO L78 Accepts]: Start accepts. Automaton has 36985 states and 120640 transitions. Word has length 13 [2019-12-26 23:27:53,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:27:53,795 INFO L462 AbstractCegarLoop]: Abstraction has 36985 states and 120640 transitions. [2019-12-26 23:27:53,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:27:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 36985 states and 120640 transitions. [2019-12-26 23:27:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:27:53,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:27:53,799 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:27:53,799 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:27:53,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:27:53,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1405830784, now seen corresponding path program 1 times [2019-12-26 23:27:53,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:27:53,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852166387] [2019-12-26 23:27:53,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:27:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:27:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:27:53,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852166387] [2019-12-26 23:27:53,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:27:53,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:27:53,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674243808] [2019-12-26 23:27:53,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:27:53,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:27:53,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:27:53,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:27:53,922 INFO L87 Difference]: Start difference. First operand 36985 states and 120640 transitions. Second operand 5 states. [2019-12-26 23:27:54,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:27:54,709 INFO L93 Difference]: Finished difference Result 50257 states and 160609 transitions. [2019-12-26 23:27:54,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:27:54,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 23:27:54,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:27:54,792 INFO L225 Difference]: With dead ends: 50257 [2019-12-26 23:27:54,793 INFO L226 Difference]: Without dead ends: 50244 [2019-12-26 23:27:54,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:27:55,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50244 states. [2019-12-26 23:27:55,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50244 to 37328. [2019-12-26 23:27:55,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37328 states. [2019-12-26 23:27:55,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37328 states to 37328 states and 121606 transitions. [2019-12-26 23:27:55,992 INFO L78 Accepts]: Start accepts. Automaton has 37328 states and 121606 transitions. Word has length 19 [2019-12-26 23:27:55,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:27:55,993 INFO L462 AbstractCegarLoop]: Abstraction has 37328 states and 121606 transitions. [2019-12-26 23:27:55,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:27:55,993 INFO L276 IsEmpty]: Start isEmpty. Operand 37328 states and 121606 transitions. [2019-12-26 23:27:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:27:56,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:27:56,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:27:56,004 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:27:56,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:27:56,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1721998258, now seen corresponding path program 1 times [2019-12-26 23:27:56,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:27:56,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707202867] [2019-12-26 23:27:56,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:27:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:27:56,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:27:56,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707202867] [2019-12-26 23:27:56,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:27:56,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:27:56,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878247754] [2019-12-26 23:27:56,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:27:56,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:27:56,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:27:56,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:27:56,100 INFO L87 Difference]: Start difference. First operand 37328 states and 121606 transitions. Second operand 4 states. [2019-12-26 23:27:56,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:27:56,138 INFO L93 Difference]: Finished difference Result 7104 states and 19431 transitions. [2019-12-26 23:27:56,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:27:56,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:27:56,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:27:56,151 INFO L225 Difference]: With dead ends: 7104 [2019-12-26 23:27:56,151 INFO L226 Difference]: Without dead ends: 7104 [2019-12-26 23:27:56,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:27:56,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-26 23:27:56,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 6992. [2019-12-26 23:27:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2019-12-26 23:27:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 19111 transitions. [2019-12-26 23:27:56,249 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 19111 transitions. Word has length 25 [2019-12-26 23:27:56,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:27:56,249 INFO L462 AbstractCegarLoop]: Abstraction has 6992 states and 19111 transitions. [2019-12-26 23:27:56,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:27:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 19111 transitions. [2019-12-26 23:27:56,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 23:27:56,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:27:56,260 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:27:56,260 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:27:56,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:27:56,261 INFO L82 PathProgramCache]: Analyzing trace with hash 2138974623, now seen corresponding path program 1 times [2019-12-26 23:27:56,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:27:56,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191771254] [2019-12-26 23:27:56,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:27:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:27:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:27:56,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191771254] [2019-12-26 23:27:56,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:27:56,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:27:56,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615921407] [2019-12-26 23:27:56,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:27:56,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:27:56,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:27:56,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:27:56,371 INFO L87 Difference]: Start difference. First operand 6992 states and 19111 transitions. Second operand 5 states. [2019-12-26 23:27:56,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:27:56,414 INFO L93 Difference]: Finished difference Result 5024 states and 14421 transitions. [2019-12-26 23:27:56,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:27:56,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 23:27:56,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:27:56,425 INFO L225 Difference]: With dead ends: 5024 [2019-12-26 23:27:56,425 INFO L226 Difference]: Without dead ends: 5024 [2019-12-26 23:27:56,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:27:56,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2019-12-26 23:27:56,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 4660. [2019-12-26 23:27:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-26 23:27:56,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 13437 transitions. [2019-12-26 23:27:56,553 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 13437 transitions. Word has length 37 [2019-12-26 23:27:56,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:27:56,554 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 13437 transitions. [2019-12-26 23:27:56,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:27:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 13437 transitions. [2019-12-26 23:27:56,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:27:56,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:27:56,568 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:27:56,568 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:27:56,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:27:56,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1030638940, now seen corresponding path program 1 times [2019-12-26 23:27:56,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:27:56,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208084560] [2019-12-26 23:27:56,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:27:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:27:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:27:56,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208084560] [2019-12-26 23:27:56,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:27:56,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:27:56,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332740349] [2019-12-26 23:27:56,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:27:56,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:27:56,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:27:56,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:27:56,691 INFO L87 Difference]: Start difference. First operand 4660 states and 13437 transitions. Second operand 3 states. [2019-12-26 23:27:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:27:56,766 INFO L93 Difference]: Finished difference Result 4669 states and 13450 transitions. [2019-12-26 23:27:56,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:27:56,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:27:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:27:56,781 INFO L225 Difference]: With dead ends: 4669 [2019-12-26 23:27:56,781 INFO L226 Difference]: Without dead ends: 4669 [2019-12-26 23:27:56,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:27:56,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-26 23:27:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-26 23:27:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-26 23:27:56,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13446 transitions. [2019-12-26 23:27:56,890 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13446 transitions. Word has length 65 [2019-12-26 23:27:56,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:27:56,892 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13446 transitions. [2019-12-26 23:27:56,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:27:56,892 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13446 transitions. [2019-12-26 23:27:56,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:27:56,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:27:56,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:27:56,902 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:27:56,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:27:56,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1902070617, now seen corresponding path program 1 times [2019-12-26 23:27:56,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:27:56,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054306649] [2019-12-26 23:27:56,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:27:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:27:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:27:56,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054306649] [2019-12-26 23:27:56,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:27:56,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:27:56,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662136332] [2019-12-26 23:27:56,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:27:56,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:27:56,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:27:56,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:27:56,998 INFO L87 Difference]: Start difference. First operand 4665 states and 13446 transitions. Second operand 3 states. [2019-12-26 23:27:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:27:57,051 INFO L93 Difference]: Finished difference Result 4669 states and 13441 transitions. [2019-12-26 23:27:57,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:27:57,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:27:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:27:57,062 INFO L225 Difference]: With dead ends: 4669 [2019-12-26 23:27:57,062 INFO L226 Difference]: Without dead ends: 4669 [2019-12-26 23:27:57,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:27:57,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-26 23:27:57,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-26 23:27:57,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-26 23:27:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13437 transitions. [2019-12-26 23:27:57,153 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13437 transitions. Word has length 65 [2019-12-26 23:27:57,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:27:57,153 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13437 transitions. [2019-12-26 23:27:57,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:27:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13437 transitions. [2019-12-26 23:27:57,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:27:57,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:27:57,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:27:57,161 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:27:57,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:27:57,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358751, now seen corresponding path program 1 times [2019-12-26 23:27:57,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:27:57,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881738440] [2019-12-26 23:27:57,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:27:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:27:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:27:57,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881738440] [2019-12-26 23:27:57,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:27:57,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:27:57,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928555625] [2019-12-26 23:27:57,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:27:57,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:27:57,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:27:57,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:27:57,316 INFO L87 Difference]: Start difference. First operand 4665 states and 13437 transitions. Second operand 6 states. [2019-12-26 23:27:57,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:27:57,861 INFO L93 Difference]: Finished difference Result 8765 states and 25085 transitions. [2019-12-26 23:27:57,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:27:57,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 23:27:57,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:27:57,876 INFO L225 Difference]: With dead ends: 8765 [2019-12-26 23:27:57,877 INFO L226 Difference]: Without dead ends: 8765 [2019-12-26 23:27:57,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:27:57,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8765 states. [2019-12-26 23:27:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8765 to 5421. [2019-12-26 23:27:58,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-12-26 23:27:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 15667 transitions. [2019-12-26 23:27:58,027 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 15667 transitions. Word has length 65 [2019-12-26 23:27:58,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:27:58,027 INFO L462 AbstractCegarLoop]: Abstraction has 5421 states and 15667 transitions. [2019-12-26 23:27:58,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:27:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 15667 transitions. [2019-12-26 23:27:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:27:58,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:27:58,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:27:58,038 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:27:58,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:27:58,038 INFO L82 PathProgramCache]: Analyzing trace with hash -191494421, now seen corresponding path program 2 times [2019-12-26 23:27:58,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:27:58,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934532953] [2019-12-26 23:27:58,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:27:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:27:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:27:58,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934532953] [2019-12-26 23:27:58,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:27:58,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:27:58,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957383697] [2019-12-26 23:27:58,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:27:58,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:27:58,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:27:58,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:27:58,132 INFO L87 Difference]: Start difference. First operand 5421 states and 15667 transitions. Second operand 5 states. [2019-12-26 23:27:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:27:58,464 INFO L93 Difference]: Finished difference Result 7981 states and 22730 transitions. [2019-12-26 23:27:58,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:27:58,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 23:27:58,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:27:58,475 INFO L225 Difference]: With dead ends: 7981 [2019-12-26 23:27:58,476 INFO L226 Difference]: Without dead ends: 7981 [2019-12-26 23:27:58,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:27:58,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7981 states. [2019-12-26 23:27:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7981 to 5923. [2019-12-26 23:27:58,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5923 states. [2019-12-26 23:27:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5923 states to 5923 states and 17159 transitions. [2019-12-26 23:27:58,572 INFO L78 Accepts]: Start accepts. Automaton has 5923 states and 17159 transitions. Word has length 65 [2019-12-26 23:27:58,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:27:58,572 INFO L462 AbstractCegarLoop]: Abstraction has 5923 states and 17159 transitions. [2019-12-26 23:27:58,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:27:58,572 INFO L276 IsEmpty]: Start isEmpty. Operand 5923 states and 17159 transitions. [2019-12-26 23:27:58,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:27:58,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:27:58,581 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:27:58,581 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:27:58,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:27:58,581 INFO L82 PathProgramCache]: Analyzing trace with hash 147719209, now seen corresponding path program 3 times [2019-12-26 23:27:58,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:27:58,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458982320] [2019-12-26 23:27:58,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:27:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:27:58,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:27:58,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458982320] [2019-12-26 23:27:58,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:27:58,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:27:58,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329650966] [2019-12-26 23:27:58,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:27:58,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:27:58,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:27:58,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:27:58,651 INFO L87 Difference]: Start difference. First operand 5923 states and 17159 transitions. Second operand 3 states. [2019-12-26 23:27:58,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:27:58,677 INFO L93 Difference]: Finished difference Result 5119 states and 14578 transitions. [2019-12-26 23:27:58,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:27:58,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:27:58,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:27:58,685 INFO L225 Difference]: With dead ends: 5119 [2019-12-26 23:27:58,685 INFO L226 Difference]: Without dead ends: 5119 [2019-12-26 23:27:58,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:27:58,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5119 states. [2019-12-26 23:27:58,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5119 to 4839. [2019-12-26 23:27:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4839 states. [2019-12-26 23:27:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 13806 transitions. [2019-12-26 23:27:58,778 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 13806 transitions. Word has length 65 [2019-12-26 23:27:58,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:27:58,778 INFO L462 AbstractCegarLoop]: Abstraction has 4839 states and 13806 transitions. [2019-12-26 23:27:58,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:27:58,778 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 13806 transitions. [2019-12-26 23:27:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:27:58,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:27:58,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:27:58,787 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:27:58,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:27:58,788 INFO L82 PathProgramCache]: Analyzing trace with hash 2002555555, now seen corresponding path program 1 times [2019-12-26 23:27:58,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:27:58,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952604321] [2019-12-26 23:27:58,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:27:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:27:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:27:58,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952604321] [2019-12-26 23:27:58,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:27:58,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:27:58,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567471378] [2019-12-26 23:27:58,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:27:58,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:27:58,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:27:58,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:27:58,940 INFO L87 Difference]: Start difference. First operand 4839 states and 13806 transitions. Second operand 6 states. [2019-12-26 23:27:59,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:27:59,374 INFO L93 Difference]: Finished difference Result 7011 states and 19683 transitions. [2019-12-26 23:27:59,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:27:59,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-26 23:27:59,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:27:59,385 INFO L225 Difference]: With dead ends: 7011 [2019-12-26 23:27:59,386 INFO L226 Difference]: Without dead ends: 7011 [2019-12-26 23:27:59,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:27:59,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7011 states. [2019-12-26 23:27:59,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7011 to 5532. [2019-12-26 23:27:59,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5532 states. [2019-12-26 23:27:59,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5532 states to 5532 states and 15751 transitions. [2019-12-26 23:27:59,778 INFO L78 Accepts]: Start accepts. Automaton has 5532 states and 15751 transitions. Word has length 66 [2019-12-26 23:27:59,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:27:59,778 INFO L462 AbstractCegarLoop]: Abstraction has 5532 states and 15751 transitions. [2019-12-26 23:27:59,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:27:59,779 INFO L276 IsEmpty]: Start isEmpty. Operand 5532 states and 15751 transitions. [2019-12-26 23:27:59,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:27:59,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:27:59,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:27:59,790 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:27:59,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:27:59,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2081518173, now seen corresponding path program 2 times [2019-12-26 23:27:59,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:27:59,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142089700] [2019-12-26 23:27:59,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:27:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:27:59,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:27:59,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142089700] [2019-12-26 23:27:59,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:27:59,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:27:59,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762043626] [2019-12-26 23:27:59,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:27:59,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:27:59,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:27:59,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:27:59,899 INFO L87 Difference]: Start difference. First operand 5532 states and 15751 transitions. Second operand 6 states. [2019-12-26 23:28:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:28:00,340 INFO L93 Difference]: Finished difference Result 7597 states and 21220 transitions. [2019-12-26 23:28:00,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:28:00,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-26 23:28:00,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:28:00,351 INFO L225 Difference]: With dead ends: 7597 [2019-12-26 23:28:00,351 INFO L226 Difference]: Without dead ends: 7597 [2019-12-26 23:28:00,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:28:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7597 states. [2019-12-26 23:28:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7597 to 5931. [2019-12-26 23:28:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5931 states. [2019-12-26 23:28:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5931 states to 5931 states and 16730 transitions. [2019-12-26 23:28:00,470 INFO L78 Accepts]: Start accepts. Automaton has 5931 states and 16730 transitions. Word has length 66 [2019-12-26 23:28:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:28:00,470 INFO L462 AbstractCegarLoop]: Abstraction has 5931 states and 16730 transitions. [2019-12-26 23:28:00,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:28:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 5931 states and 16730 transitions. [2019-12-26 23:28:00,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:28:00,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:28:00,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:28:00,479 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:28:00,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:28:00,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1769494633, now seen corresponding path program 3 times [2019-12-26 23:28:00,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:28:00,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133210991] [2019-12-26 23:28:00,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:28:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:28:00,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:28:00,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133210991] [2019-12-26 23:28:00,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:28:00,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:28:00,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431002035] [2019-12-26 23:28:00,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:28:00,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:28:00,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:28:00,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:28:00,596 INFO L87 Difference]: Start difference. First operand 5931 states and 16730 transitions. Second operand 8 states. [2019-12-26 23:28:01,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:28:01,332 INFO L93 Difference]: Finished difference Result 8661 states and 24091 transitions. [2019-12-26 23:28:01,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 23:28:01,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-26 23:28:01,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:28:01,343 INFO L225 Difference]: With dead ends: 8661 [2019-12-26 23:28:01,344 INFO L226 Difference]: Without dead ends: 8661 [2019-12-26 23:28:01,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:28:01,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8661 states. [2019-12-26 23:28:01,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8661 to 5847. [2019-12-26 23:28:01,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5847 states. [2019-12-26 23:28:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5847 states to 5847 states and 16504 transitions. [2019-12-26 23:28:01,443 INFO L78 Accepts]: Start accepts. Automaton has 5847 states and 16504 transitions. Word has length 66 [2019-12-26 23:28:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:28:01,443 INFO L462 AbstractCegarLoop]: Abstraction has 5847 states and 16504 transitions. [2019-12-26 23:28:01,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:28:01,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5847 states and 16504 transitions. [2019-12-26 23:28:01,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:28:01,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:28:01,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:28:01,452 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:28:01,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:28:01,452 INFO L82 PathProgramCache]: Analyzing trace with hash -248419697, now seen corresponding path program 4 times [2019-12-26 23:28:01,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:28:01,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468804234] [2019-12-26 23:28:01,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:28:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:28:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:28:01,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468804234] [2019-12-26 23:28:01,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:28:01,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:28:01,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188106511] [2019-12-26 23:28:01,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:28:01,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:28:01,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:28:01,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:28:01,556 INFO L87 Difference]: Start difference. First operand 5847 states and 16504 transitions. Second operand 6 states. [2019-12-26 23:28:01,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:28:01,772 INFO L93 Difference]: Finished difference Result 7638 states and 21269 transitions. [2019-12-26 23:28:01,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:28:01,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-26 23:28:01,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:28:01,781 INFO L225 Difference]: With dead ends: 7638 [2019-12-26 23:28:01,781 INFO L226 Difference]: Without dead ends: 7638 [2019-12-26 23:28:01,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:28:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7638 states. [2019-12-26 23:28:01,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7638 to 6001. [2019-12-26 23:28:01,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6001 states. [2019-12-26 23:28:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6001 states to 6001 states and 16930 transitions. [2019-12-26 23:28:01,871 INFO L78 Accepts]: Start accepts. Automaton has 6001 states and 16930 transitions. Word has length 66 [2019-12-26 23:28:01,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:28:01,871 INFO L462 AbstractCegarLoop]: Abstraction has 6001 states and 16930 transitions. [2019-12-26 23:28:01,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:28:01,871 INFO L276 IsEmpty]: Start isEmpty. Operand 6001 states and 16930 transitions. [2019-12-26 23:28:01,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:28:01,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:28:01,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:28:01,880 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:28:01,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:28:01,880 INFO L82 PathProgramCache]: Analyzing trace with hash -140875571, now seen corresponding path program 5 times [2019-12-26 23:28:01,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:28:01,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090645752] [2019-12-26 23:28:01,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:28:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:28:02,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:28:02,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090645752] [2019-12-26 23:28:02,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:28:02,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:28:02,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165107946] [2019-12-26 23:28:02,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:28:02,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:28:02,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:28:02,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:28:02,007 INFO L87 Difference]: Start difference. First operand 6001 states and 16930 transitions. Second operand 7 states. [2019-12-26 23:28:02,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:28:02,143 INFO L93 Difference]: Finished difference Result 13025 states and 37038 transitions. [2019-12-26 23:28:02,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:28:02,143 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-26 23:28:02,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:28:02,154 INFO L225 Difference]: With dead ends: 13025 [2019-12-26 23:28:02,154 INFO L226 Difference]: Without dead ends: 7395 [2019-12-26 23:28:02,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:28:02,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7395 states. [2019-12-26 23:28:02,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7395 to 5548. [2019-12-26 23:28:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5548 states. [2019-12-26 23:28:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5548 states to 5548 states and 15661 transitions. [2019-12-26 23:28:02,247 INFO L78 Accepts]: Start accepts. Automaton has 5548 states and 15661 transitions. Word has length 66 [2019-12-26 23:28:02,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:28:02,247 INFO L462 AbstractCegarLoop]: Abstraction has 5548 states and 15661 transitions. [2019-12-26 23:28:02,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:28:02,247 INFO L276 IsEmpty]: Start isEmpty. Operand 5548 states and 15661 transitions. [2019-12-26 23:28:02,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:28:02,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:28:02,253 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:28:02,253 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:28:02,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:28:02,254 INFO L82 PathProgramCache]: Analyzing trace with hash 505491825, now seen corresponding path program 6 times [2019-12-26 23:28:02,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:28:02,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269166122] [2019-12-26 23:28:02,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:28:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:28:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:28:02,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269166122] [2019-12-26 23:28:02,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:28:02,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:28:02,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036509413] [2019-12-26 23:28:02,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:28:02,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:28:02,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:28:02,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:28:02,358 INFO L87 Difference]: Start difference. First operand 5548 states and 15661 transitions. Second operand 6 states. [2019-12-26 23:28:02,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:28:02,761 INFO L93 Difference]: Finished difference Result 7991 states and 22227 transitions. [2019-12-26 23:28:02,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:28:02,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-26 23:28:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:28:02,777 INFO L225 Difference]: With dead ends: 7991 [2019-12-26 23:28:02,777 INFO L226 Difference]: Without dead ends: 7991 [2019-12-26 23:28:02,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:28:02,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7991 states. [2019-12-26 23:28:02,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7991 to 5219. [2019-12-26 23:28:02,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5219 states. [2019-12-26 23:28:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5219 states to 5219 states and 14749 transitions. [2019-12-26 23:28:02,870 INFO L78 Accepts]: Start accepts. Automaton has 5219 states and 14749 transitions. Word has length 66 [2019-12-26 23:28:02,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:28:02,870 INFO L462 AbstractCegarLoop]: Abstraction has 5219 states and 14749 transitions. [2019-12-26 23:28:02,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:28:02,870 INFO L276 IsEmpty]: Start isEmpty. Operand 5219 states and 14749 transitions. [2019-12-26 23:28:02,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:28:02,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:28:02,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:28:02,876 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:28:02,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:28:02,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1536213591, now seen corresponding path program 7 times [2019-12-26 23:28:02,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:28:02,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138518003] [2019-12-26 23:28:02,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:28:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:28:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:28:02,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138518003] [2019-12-26 23:28:02,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:28:02,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:28:02,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512537782] [2019-12-26 23:28:02,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:28:02,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:28:02,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:28:02,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:28:02,935 INFO L87 Difference]: Start difference. First operand 5219 states and 14749 transitions. Second operand 3 states. [2019-12-26 23:28:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:28:02,964 INFO L93 Difference]: Finished difference Result 4879 states and 13586 transitions. [2019-12-26 23:28:02,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:28:02,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 23:28:02,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:28:02,971 INFO L225 Difference]: With dead ends: 4879 [2019-12-26 23:28:02,971 INFO L226 Difference]: Without dead ends: 4879 [2019-12-26 23:28:02,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:28:02,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2019-12-26 23:28:03,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 4879. [2019-12-26 23:28:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4879 states. [2019-12-26 23:28:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4879 states to 4879 states and 13586 transitions. [2019-12-26 23:28:03,039 INFO L78 Accepts]: Start accepts. Automaton has 4879 states and 13586 transitions. Word has length 66 [2019-12-26 23:28:03,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:28:03,040 INFO L462 AbstractCegarLoop]: Abstraction has 4879 states and 13586 transitions. [2019-12-26 23:28:03,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:28:03,040 INFO L276 IsEmpty]: Start isEmpty. Operand 4879 states and 13586 transitions. [2019-12-26 23:28:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:28:03,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:28:03,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:28:03,219 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:28:03,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:28:03,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1258241115, now seen corresponding path program 1 times [2019-12-26 23:28:03,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:28:03,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710094226] [2019-12-26 23:28:03,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:28:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:28:03,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:28:03,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710094226] [2019-12-26 23:28:03,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:28:03,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:28:03,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18581253] [2019-12-26 23:28:03,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:28:03,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:28:03,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:28:03,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:28:03,410 INFO L87 Difference]: Start difference. First operand 4879 states and 13586 transitions. Second operand 8 states. [2019-12-26 23:28:04,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:28:04,294 INFO L93 Difference]: Finished difference Result 10268 states and 28239 transitions. [2019-12-26 23:28:04,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 23:28:04,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-26 23:28:04,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:28:04,308 INFO L225 Difference]: With dead ends: 10268 [2019-12-26 23:28:04,308 INFO L226 Difference]: Without dead ends: 10268 [2019-12-26 23:28:04,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:28:04,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10268 states. [2019-12-26 23:28:04,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10268 to 5054. [2019-12-26 23:28:04,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5054 states. [2019-12-26 23:28:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5054 states to 5054 states and 14177 transitions. [2019-12-26 23:28:04,408 INFO L78 Accepts]: Start accepts. Automaton has 5054 states and 14177 transitions. Word has length 67 [2019-12-26 23:28:04,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:28:04,408 INFO L462 AbstractCegarLoop]: Abstraction has 5054 states and 14177 transitions. [2019-12-26 23:28:04,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:28:04,408 INFO L276 IsEmpty]: Start isEmpty. Operand 5054 states and 14177 transitions. [2019-12-26 23:28:04,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:28:04,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:28:04,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:28:04,414 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:28:04,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:28:04,414 INFO L82 PathProgramCache]: Analyzing trace with hash -549033009, now seen corresponding path program 2 times [2019-12-26 23:28:04,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:28:04,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772074347] [2019-12-26 23:28:04,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:28:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:28:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:28:04,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772074347] [2019-12-26 23:28:04,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:28:04,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:28:04,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474284137] [2019-12-26 23:28:04,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:28:04,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:28:04,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:28:04,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:28:04,486 INFO L87 Difference]: Start difference. First operand 5054 states and 14177 transitions. Second operand 3 states. [2019-12-26 23:28:04,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:28:04,533 INFO L93 Difference]: Finished difference Result 5054 states and 14176 transitions. [2019-12-26 23:28:04,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:28:04,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-26 23:28:04,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:28:04,540 INFO L225 Difference]: With dead ends: 5054 [2019-12-26 23:28:04,540 INFO L226 Difference]: Without dead ends: 5054 [2019-12-26 23:28:04,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:28:04,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5054 states. [2019-12-26 23:28:04,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5054 to 3076. [2019-12-26 23:28:04,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3076 states. [2019-12-26 23:28:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 8628 transitions. [2019-12-26 23:28:04,622 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 8628 transitions. Word has length 67 [2019-12-26 23:28:04,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:28:04,622 INFO L462 AbstractCegarLoop]: Abstraction has 3076 states and 8628 transitions. [2019-12-26 23:28:04,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:28:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 8628 transitions. [2019-12-26 23:28:04,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:28:04,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:28:04,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:28:04,627 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:28:04,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:28:04,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2101059672, now seen corresponding path program 1 times [2019-12-26 23:28:04,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:28:04,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344292926] [2019-12-26 23:28:04,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:28:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:28:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:28:04,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344292926] [2019-12-26 23:28:04,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:28:04,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:28:04,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931949565] [2019-12-26 23:28:04,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:28:04,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:28:04,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:28:04,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:28:04,916 INFO L87 Difference]: Start difference. First operand 3076 states and 8628 transitions. Second operand 10 states. [2019-12-26 23:28:05,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:28:05,184 INFO L93 Difference]: Finished difference Result 5739 states and 16195 transitions. [2019-12-26 23:28:05,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:28:05,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2019-12-26 23:28:05,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:28:05,189 INFO L225 Difference]: With dead ends: 5739 [2019-12-26 23:28:05,190 INFO L226 Difference]: Without dead ends: 3061 [2019-12-26 23:28:05,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:28:05,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3061 states. [2019-12-26 23:28:05,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3061 to 2308. [2019-12-26 23:28:05,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2308 states. [2019-12-26 23:28:05,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 6446 transitions. [2019-12-26 23:28:05,249 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 6446 transitions. Word has length 68 [2019-12-26 23:28:05,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:28:05,249 INFO L462 AbstractCegarLoop]: Abstraction has 2308 states and 6446 transitions. [2019-12-26 23:28:05,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:28:05,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 6446 transitions. [2019-12-26 23:28:05,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:28:05,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:28:05,253 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:28:05,253 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:28:05,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:28:05,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1328147214, now seen corresponding path program 2 times [2019-12-26 23:28:05,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:28:05,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307657187] [2019-12-26 23:28:05,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:28:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:28:05,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:28:05,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307657187] [2019-12-26 23:28:05,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:28:05,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:28:05,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202138630] [2019-12-26 23:28:05,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:28:05,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:28:05,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:28:05,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:28:05,487 INFO L87 Difference]: Start difference. First operand 2308 states and 6446 transitions. Second operand 12 states. [2019-12-26 23:28:06,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:28:06,227 INFO L93 Difference]: Finished difference Result 5739 states and 15931 transitions. [2019-12-26 23:28:06,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 23:28:06,227 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-26 23:28:06,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:28:06,232 INFO L225 Difference]: With dead ends: 5739 [2019-12-26 23:28:06,232 INFO L226 Difference]: Without dead ends: 2596 [2019-12-26 23:28:06,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:28:06,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2019-12-26 23:28:06,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 2152. [2019-12-26 23:28:06,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2019-12-26 23:28:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 6002 transitions. [2019-12-26 23:28:06,267 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 6002 transitions. Word has length 68 [2019-12-26 23:28:06,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:28:06,267 INFO L462 AbstractCegarLoop]: Abstraction has 2152 states and 6002 transitions. [2019-12-26 23:28:06,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:28:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 6002 transitions. [2019-12-26 23:28:06,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:28:06,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:28:06,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:28:06,269 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:28:06,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:28:06,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1259160564, now seen corresponding path program 3 times [2019-12-26 23:28:06,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:28:06,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670022019] [2019-12-26 23:28:06,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:28:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:28:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:28:06,380 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:28:06,381 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:28:06,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~x~0_194) (= 0 v_~x$r_buff0_thd2~0_213) (= 0 v_~weak$$choice0~0_14) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$w_buff0~0_268) (= (select .cse0 |v_ULTIMATE.start_main_~#t1816~0.base_20|) 0) (= 0 v_~x$r_buff1_thd2~0_212) (= v_~x$r_buff1_thd0~0_297 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 |v_ULTIMATE.start_main_~#t1816~0.offset_17|) (= v_~x$r_buff1_thd1~0_187 0) (= v_~x$r_buff0_thd0~0_372 0) (= v_~y~0_143 0) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_155 0) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p0_EAX~0_24) (= 0 v_~x$r_buff1_thd3~0_195) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1816~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1816~0.base_20|) |v_ULTIMATE.start_main_~#t1816~0.offset_17| 0)) |v_#memory_int_21|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1816~0.base_20| 4) |v_#length_25|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1816~0.base_20|) (= 0 v_~x$r_buff0_thd3~0_123) (= |v_#NULL.offset_4| 0) (= 0 v_~x$w_buff1_used~0_504) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~__unbuffered_p2_EAX~0_22) (= v_~x$flush_delayed~0_34 0) (= v_~main$tmp_guard0~0_24 0) (= v_~weak$$choice2~0_110 0) (= 0 v_~x$w_buff0_used~0_807) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1816~0.base_20| 1)) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_268, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_34, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_45|, ULTIMATE.start_main_~#t1818~0.offset=|v_ULTIMATE.start_main_~#t1818~0.offset_16|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_123, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_50|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_372, ULTIMATE.start_main_~#t1816~0.offset=|v_ULTIMATE.start_main_~#t1816~0.offset_17|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_37|, ULTIMATE.start_main_~#t1817~0.base=|v_ULTIMATE.start_main_~#t1817~0.base_21|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_212, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_48|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t1816~0.base=|v_ULTIMATE.start_main_~#t1816~0.base_20|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ULTIMATE.start_main_~#t1817~0.offset=|v_ULTIMATE.start_main_~#t1817~0.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~x~0=v_~x~0_194, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_195, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_125|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_~#t1818~0.base=|v_ULTIMATE.start_main_~#t1818~0.base_20|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~y~0=v_~y~0_143, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_48|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_213, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_807, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1818~0.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1816~0.offset, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1817~0.base, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ULTIMATE.start_main_~#t1816~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1817~0.offset, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1818~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:28:06,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L805-1-->L807: Formula: (and (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1817~0.base_11| 1)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1817~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t1817~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1817~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1817~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1817~0.base_11|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1817~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1817~0.base_11|) |v_ULTIMATE.start_main_~#t1817~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t1817~0.offset=|v_ULTIMATE.start_main_~#t1817~0.offset_10|, ULTIMATE.start_main_~#t1817~0.base=|v_ULTIMATE.start_main_~#t1817~0.base_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1817~0.offset, ULTIMATE.start_main_~#t1817~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 23:28:06,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1818~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1818~0.base_9| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1818~0.base_9|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1818~0.base_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1818~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1818~0.base_9|) |v_ULTIMATE.start_main_~#t1818~0.offset_8| 2))) (= |v_ULTIMATE.start_main_~#t1818~0.offset_8| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1818~0.base_9| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1818~0.offset=|v_ULTIMATE.start_main_~#t1818~0.offset_8|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1818~0.base=|v_ULTIMATE.start_main_~#t1818~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t1818~0.offset, #length, ULTIMATE.start_main_~#t1818~0.base] because there is no mapped edge [2019-12-26 23:28:06,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_11| v_P1Thread1of1ForFork1_~arg.offset_11) (= 1 v_~x$w_buff0_used~0_98) (= 2 v_~x$w_buff0~0_31) (= v_P1Thread1of1ForFork1_~arg.base_11 |v_P1Thread1of1ForFork1_#in~arg.base_11|) (= v_~x$w_buff1_used~0_55 v_~x$w_buff0_used~0_99) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 0 (mod v_~x$w_buff1_used~0_55 256)) (= v_~x$w_buff0~0_32 v_~x$w_buff1~0_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13, ~x$w_buff0~0=v_~x$w_buff0~0_31, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_11, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_11, ~x$w_buff1~0=v_~x$w_buff1~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-26 23:28:06,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In312859397 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In312859397 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out312859397| ~x~0_In312859397)) (and (= ~x$w_buff1~0_In312859397 |P2Thread1of1ForFork2_#t~ite15_Out312859397|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In312859397, ~x$w_buff1_used~0=~x$w_buff1_used~0_In312859397, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In312859397, ~x~0=~x~0_In312859397} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out312859397|, ~x$w_buff1~0=~x$w_buff1~0_In312859397, ~x$w_buff1_used~0=~x$w_buff1_used~0_In312859397, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In312859397, ~x~0=~x~0_In312859397} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 23:28:06,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= v_~x~0_20 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-26 23:28:06,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In1849640544 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1849640544 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1849640544 |P2Thread1of1ForFork2_#t~ite17_Out1849640544|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out1849640544|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1849640544, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1849640544} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1849640544, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1849640544|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1849640544} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:28:06,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-1151563882 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1151563882 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-1151563882 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1151563882 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out-1151563882| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1151563882 |P2Thread1of1ForFork2_#t~ite18_Out-1151563882|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1151563882, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1151563882, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1151563882, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1151563882} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1151563882, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1151563882, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1151563882, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1151563882|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1151563882} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-26 23:28:06,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out240580023| |P0Thread1of1ForFork0_#t~ite3_Out240580023|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In240580023 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In240580023 256)))) (or (and (not .cse0) (not .cse1) .cse2 (= ~x$w_buff1~0_In240580023 |P0Thread1of1ForFork0_#t~ite3_Out240580023|)) (and (= ~x~0_In240580023 |P0Thread1of1ForFork0_#t~ite3_Out240580023|) .cse2 (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In240580023, ~x$w_buff1_used~0=~x$w_buff1_used~0_In240580023, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In240580023, ~x~0=~x~0_In240580023} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out240580023|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out240580023|, ~x$w_buff1~0=~x$w_buff1~0_In240580023, ~x$w_buff1_used~0=~x$w_buff1_used~0_In240580023, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In240580023, ~x~0=~x~0_In240580023} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-26 23:28:06,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1932199142 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1932199142 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1932199142| ~x$w_buff0_used~0_In-1932199142)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1932199142| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1932199142, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1932199142} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1932199142|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1932199142, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1932199142} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:28:06,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd1~0_In1813390950 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1813390950 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1813390950 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1813390950 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1813390950|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1813390950 |P0Thread1of1ForFork0_#t~ite6_Out1813390950|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1813390950, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1813390950, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1813390950, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1813390950} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1813390950|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1813390950, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1813390950, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1813390950, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1813390950} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:28:06,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-706771845 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-706771845 256)))) (or (and (= ~x$r_buff0_thd3~0_In-706771845 |P2Thread1of1ForFork2_#t~ite19_Out-706771845|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-706771845|) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-706771845, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-706771845} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-706771845, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-706771845|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-706771845} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-26 23:28:06,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In603439160 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In603439160 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In603439160 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In603439160 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out603439160| 0)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out603439160| ~x$r_buff1_thd3~0_In603439160) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In603439160, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In603439160, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In603439160, ~x$w_buff0_used~0=~x$w_buff0_used~0_In603439160} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out603439160|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In603439160, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In603439160, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In603439160, ~x$w_buff0_used~0=~x$w_buff0_used~0_In603439160} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-26 23:28:06,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P2Thread1of1ForFork2_#t~ite20_54| v_~x$r_buff1_thd3~0_147)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_53|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 23:28:06,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In700597543 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In700597543 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out700597543|) (not .cse1)) (and (= ~x$r_buff0_thd1~0_In700597543 |P0Thread1of1ForFork0_#t~ite7_Out700597543|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In700597543, ~x$w_buff0_used~0=~x$w_buff0_used~0_In700597543} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In700597543, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out700597543|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In700597543} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 23:28:06,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1950073266 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1950073266 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-1950073266 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1950073266 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1950073266| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out-1950073266| ~x$r_buff1_thd1~0_In-1950073266) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1950073266, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1950073266, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1950073266, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1950073266} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1950073266, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1950073266|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1950073266, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1950073266, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1950073266} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:28:06,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L737-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_61 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_61} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-26 23:28:06,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-457904035 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-457904035 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-457904035 |P1Thread1of1ForFork1_#t~ite11_Out-457904035|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-457904035|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-457904035, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-457904035} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-457904035|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-457904035, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-457904035} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:28:06,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-1562016169 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1562016169 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1562016169 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1562016169 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1562016169|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1562016169 |P1Thread1of1ForFork1_#t~ite12_Out-1562016169|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1562016169, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1562016169, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1562016169, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1562016169} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1562016169, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1562016169, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1562016169|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1562016169, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1562016169} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:28:06,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1615595850 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1615595850 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In1615595850 ~x$r_buff0_thd2~0_Out1615595850) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out1615595850) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1615595850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1615595850} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1615595850|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1615595850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1615595850} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:28:06,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In-229354705 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-229354705 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-229354705 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-229354705 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-229354705|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-229354705| ~x$r_buff1_thd2~0_In-229354705) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-229354705, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-229354705, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-229354705, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229354705} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-229354705, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-229354705, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-229354705, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-229354705|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229354705} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:28:06,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_162 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_162, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:28:06,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:28:06,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-445823421 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite25_Out-445823421| |ULTIMATE.start_main_#t~ite24_Out-445823421|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-445823421 256)))) (or (and (= ~x~0_In-445823421 |ULTIMATE.start_main_#t~ite24_Out-445823421|) (or .cse0 .cse1) .cse2) (and (= ~x$w_buff1~0_In-445823421 |ULTIMATE.start_main_#t~ite24_Out-445823421|) (not .cse0) .cse2 (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-445823421, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-445823421, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-445823421, ~x~0=~x~0_In-445823421} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-445823421, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-445823421|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-445823421|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-445823421, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-445823421, ~x~0=~x~0_In-445823421} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-26 23:28:06,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-2002839715 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2002839715 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out-2002839715| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-2002839715 |ULTIMATE.start_main_#t~ite26_Out-2002839715|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2002839715, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2002839715} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2002839715, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-2002839715|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2002839715} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-26 23:28:06,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In260297116 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In260297116 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In260297116 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In260297116 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite27_Out260297116| ~x$w_buff1_used~0_In260297116)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite27_Out260297116|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In260297116, ~x$w_buff1_used~0=~x$w_buff1_used~0_In260297116, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In260297116, ~x$w_buff0_used~0=~x$w_buff0_used~0_In260297116} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In260297116, ~x$w_buff1_used~0=~x$w_buff1_used~0_In260297116, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out260297116|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In260297116, ~x$w_buff0_used~0=~x$w_buff0_used~0_In260297116} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-26 23:28:06,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1318139708 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1318139708 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite28_Out1318139708|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In1318139708 |ULTIMATE.start_main_#t~ite28_Out1318139708|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1318139708, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1318139708} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1318139708, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1318139708|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1318139708} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-26 23:28:06,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1515219195 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1515219195 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1515219195 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1515219195 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In1515219195 |ULTIMATE.start_main_#t~ite29_Out1515219195|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite29_Out1515219195|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1515219195, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1515219195, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1515219195, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1515219195} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1515219195, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1515219195|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1515219195, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1515219195, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1515219195} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 23:28:06,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_112 v_~x$r_buff0_thd0~0_111) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 23:28:06,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L834-->L837-1: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_23 256) 0)) (= v_~x$mem_tmp~0_13 v_~x~0_153) (= v_~x$flush_delayed~0_22 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~x~0=v_~x~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:28:06,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:28:06,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:28:06 BasicIcfg [2019-12-26 23:28:06,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:28:06,511 INFO L168 Benchmark]: Toolchain (without parser) took 90081.44 ms. Allocated memory was 144.7 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 100.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-26 23:28:06,511 INFO L168 Benchmark]: CDTParser took 1.40 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 23:28:06,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.51 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 155.5 MB in the end (delta: -55.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:28:06,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.76 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:28:06,513 INFO L168 Benchmark]: Boogie Preprocessor took 39.73 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:28:06,513 INFO L168 Benchmark]: RCFGBuilder took 1122.45 ms. Allocated memory is still 202.4 MB. Free memory was 150.2 MB in the beginning and 100.2 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:28:06,514 INFO L168 Benchmark]: TraceAbstraction took 88073.20 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.2 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-26 23:28:06,516 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.40 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 772.51 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 155.5 MB in the end (delta: -55.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.76 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.73 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1122.45 ms. Allocated memory is still 202.4 MB. Free memory was 150.2 MB in the beginning and 100.2 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88073.20 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.2 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 174 ProgramPointsBefore, 94 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 6159 VarBasedMoverChecksPositive, 253 VarBasedMoverChecksNegative, 78 SemBasedMoverChecksPositive, 250 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 78277 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1816, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L807] FCALL, FORK 0 pthread_create(&t1817, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] FCALL, FORK 0 pthread_create(&t1818, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L727] 1 __unbuffered_p0_EAX = y [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 87.7s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 23.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3382 SDtfs, 3042 SDslu, 7391 SDs, 0 SdLazy, 4786 SolverSat, 192 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 59 SyntacticMatches, 22 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183279occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 38.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 89950 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1248 NumberOfCodeBlocks, 1248 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1157 ConstructedInterpolants, 0 QuantifiedInterpolants, 223903 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...