/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix003_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:42:42,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:42:42,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:42:42,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:42:42,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:42:42,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:42:42,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:42:42,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:42:42,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:42:42,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:42:42,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:42:42,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:42:42,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:42:42,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:42:42,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:42:42,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:42:42,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:42:42,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:42:42,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:42:42,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:42:42,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:42:42,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:42:42,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:42:42,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:42:42,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:42:42,246 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:42:42,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:42:42,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:42:42,247 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:42:42,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:42:42,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:42:42,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:42:42,253 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:42:42,254 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:42:42,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:42:42,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:42:42,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:42:42,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:42:42,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:42:42,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:42:42,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:42:42,264 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 19:42:42,284 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:42:42,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:42:42,286 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:42:42,286 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:42:42,286 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:42:42,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:42:42,287 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:42:42,287 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:42:42,287 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:42:42,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:42:42,288 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:42:42,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:42:42,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:42:42,289 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:42:42,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:42:42,289 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:42:42,290 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:42:42,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:42:42,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:42:42,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:42:42,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:42:42,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:42:42,291 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:42:42,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:42:42,291 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:42:42,291 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:42:42,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:42:42,292 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:42:42,292 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:42:42,292 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:42:42,293 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:42:42,293 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:42:42,637 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:42:42,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:42:42,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:42:42,656 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:42:42,656 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:42:42,657 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_tso.oepc.i [2019-12-27 19:42:42,728 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/645f8b11c/aa5fccb2661542d09708d79fb8ca4df6/FLAG0da106a2c [2019-12-27 19:42:43,308 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:42:43,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_tso.oepc.i [2019-12-27 19:42:43,323 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/645f8b11c/aa5fccb2661542d09708d79fb8ca4df6/FLAG0da106a2c [2019-12-27 19:42:43,600 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/645f8b11c/aa5fccb2661542d09708d79fb8ca4df6 [2019-12-27 19:42:43,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:42:43,611 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:42:43,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:42:43,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:42:43,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:42:43,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:42:43" (1/1) ... [2019-12-27 19:42:43,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef2d690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:42:43, skipping insertion in model container [2019-12-27 19:42:43,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:42:43" (1/1) ... [2019-12-27 19:42:43,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:42:43,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:42:44,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:42:44,304 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:42:44,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:42:44,469 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:42:44,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:42:44 WrapperNode [2019-12-27 19:42:44,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:42:44,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:42:44,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:42:44,470 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:42:44,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:42:44" (1/1) ... [2019-12-27 19:42:44,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:42:44" (1/1) ... [2019-12-27 19:42:44,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:42:44,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:42:44,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:42:44,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:42:44,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:42:44" (1/1) ... [2019-12-27 19:42:44,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:42:44" (1/1) ... [2019-12-27 19:42:44,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:42:44" (1/1) ... [2019-12-27 19:42:44,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:42:44" (1/1) ... [2019-12-27 19:42:44,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:42:44" (1/1) ... [2019-12-27 19:42:44,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:42:44" (1/1) ... [2019-12-27 19:42:44,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:42:44" (1/1) ... [2019-12-27 19:42:44,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:42:44,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:42:44,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:42:44,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:42:44,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:42:44" (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-27 19:42:44,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:42:44,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 19:42:44,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:42:44,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:42:44,638 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 19:42:44,639 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 19:42:44,639 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 19:42:44,639 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 19:42:44,639 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 19:42:44,639 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 19:42:44,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 19:42:44,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:42:44,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:42:44,642 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 19:42:45,374 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:42:45,375 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 19:42:45,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:42:45 BoogieIcfgContainer [2019-12-27 19:42:45,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:42:45,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:42:45,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:42:45,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:42:45,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:42:43" (1/3) ... [2019-12-27 19:42:45,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b71a2bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:42:45, skipping insertion in model container [2019-12-27 19:42:45,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:42:44" (2/3) ... [2019-12-27 19:42:45,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b71a2bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:42:45, skipping insertion in model container [2019-12-27 19:42:45,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:42:45" (3/3) ... [2019-12-27 19:42:45,384 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_tso.oepc.i [2019-12-27 19:42:45,395 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:42:45,395 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:42:45,403 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 19:42:45,404 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:42:45,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,447 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,447 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,447 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,448 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,448 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,477 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,478 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,492 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,493 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,534 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,536 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,546 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,546 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,546 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,553 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,553 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:42:45,570 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 19:42:45,593 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:42:45,594 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:42:45,594 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:42:45,594 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:42:45,594 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:42:45,594 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:42:45,594 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:42:45,594 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:42:45,614 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 19:42:45,615 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 19:42:45,743 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 19:42:45,743 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:42:45,762 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 19:42:45,787 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 19:42:45,857 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 19:42:45,858 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:42:45,865 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 19:42:45,886 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 19:42:45,887 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:42:49,273 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 19:42:49,431 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 19:42:49,456 INFO L206 etLargeBlockEncoding]: Checked pairs total: 85139 [2019-12-27 19:42:49,456 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 19:42:49,460 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 106 transitions [2019-12-27 19:43:07,154 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115082 states. [2019-12-27 19:43:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 115082 states. [2019-12-27 19:43:07,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:43:07,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:07,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:43:07,163 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:07,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:07,169 INFO L82 PathProgramCache]: Analyzing trace with hash 917918, now seen corresponding path program 1 times [2019-12-27 19:43:07,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:07,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98591197] [2019-12-27 19:43:07,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:07,394 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-27 19:43:07,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98591197] [2019-12-27 19:43:07,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:07,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:43:07,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [401339109] [2019-12-27 19:43:07,397 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:07,402 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:07,413 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:43:07,413 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:07,417 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:43:07,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:43:07,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:07,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:43:07,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:43:07,435 INFO L87 Difference]: Start difference. First operand 115082 states. Second operand 3 states. [2019-12-27 19:43:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:08,577 INFO L93 Difference]: Finished difference Result 114348 states and 491658 transitions. [2019-12-27 19:43:08,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:43:08,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:43:08,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:12,228 INFO L225 Difference]: With dead ends: 114348 [2019-12-27 19:43:12,228 INFO L226 Difference]: Without dead ends: 107250 [2019-12-27 19:43:12,230 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-27 19:43:16,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107250 states. [2019-12-27 19:43:19,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107250 to 107250. [2019-12-27 19:43:19,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107250 states. [2019-12-27 19:43:23,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107250 states to 107250 states and 460523 transitions. [2019-12-27 19:43:23,945 INFO L78 Accepts]: Start accepts. Automaton has 107250 states and 460523 transitions. Word has length 3 [2019-12-27 19:43:23,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:23,945 INFO L462 AbstractCegarLoop]: Abstraction has 107250 states and 460523 transitions. [2019-12-27 19:43:23,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:43:23,945 INFO L276 IsEmpty]: Start isEmpty. Operand 107250 states and 460523 transitions. [2019-12-27 19:43:23,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 19:43:23,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:23,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:43:23,950 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:23,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:23,951 INFO L82 PathProgramCache]: Analyzing trace with hash -906390211, now seen corresponding path program 1 times [2019-12-27 19:43:23,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:23,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149671537] [2019-12-27 19:43:23,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:24,096 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-27 19:43:24,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149671537] [2019-12-27 19:43:24,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:24,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:43:24,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [369881788] [2019-12-27 19:43:24,097 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:24,099 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:24,102 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 19:43:24,102 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:24,103 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:43:24,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:43:24,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:24,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:43:24,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:43:24,105 INFO L87 Difference]: Start difference. First operand 107250 states and 460523 transitions. Second operand 4 states. [2019-12-27 19:43:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:25,421 INFO L93 Difference]: Finished difference Result 171260 states and 704759 transitions. [2019-12-27 19:43:25,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:43:25,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 19:43:25,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:31,011 INFO L225 Difference]: With dead ends: 171260 [2019-12-27 19:43:31,012 INFO L226 Difference]: Without dead ends: 171211 [2019-12-27 19:43:31,012 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-27 19:43:36,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171211 states. [2019-12-27 19:43:40,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171211 to 155734. [2019-12-27 19:43:40,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155734 states. [2019-12-27 19:43:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155734 states to 155734 states and 649769 transitions. [2019-12-27 19:43:40,500 INFO L78 Accepts]: Start accepts. Automaton has 155734 states and 649769 transitions. Word has length 11 [2019-12-27 19:43:40,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:40,501 INFO L462 AbstractCegarLoop]: Abstraction has 155734 states and 649769 transitions. [2019-12-27 19:43:40,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:43:40,501 INFO L276 IsEmpty]: Start isEmpty. Operand 155734 states and 649769 transitions. [2019-12-27 19:43:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:43:40,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:40,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:43:40,509 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:40,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:40,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1306732541, now seen corresponding path program 1 times [2019-12-27 19:43:40,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:40,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504662625] [2019-12-27 19:43:40,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:40,578 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-27 19:43:40,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504662625] [2019-12-27 19:43:40,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:40,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:43:40,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1303743687] [2019-12-27 19:43:40,580 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:40,581 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:40,583 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:43:40,583 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:40,583 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:43:40,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:43:40,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:40,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:43:40,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:43:40,584 INFO L87 Difference]: Start difference. First operand 155734 states and 649769 transitions. Second operand 3 states. [2019-12-27 19:43:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:40,731 INFO L93 Difference]: Finished difference Result 34176 states and 112026 transitions. [2019-12-27 19:43:40,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:43:40,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 19:43:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:40,794 INFO L225 Difference]: With dead ends: 34176 [2019-12-27 19:43:40,794 INFO L226 Difference]: Without dead ends: 34176 [2019-12-27 19:43:40,794 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-27 19:43:41,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34176 states. [2019-12-27 19:43:46,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34176 to 34176. [2019-12-27 19:43:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34176 states. [2019-12-27 19:43:46,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34176 states to 34176 states and 112026 transitions. [2019-12-27 19:43:46,554 INFO L78 Accepts]: Start accepts. Automaton has 34176 states and 112026 transitions. Word has length 13 [2019-12-27 19:43:46,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:46,554 INFO L462 AbstractCegarLoop]: Abstraction has 34176 states and 112026 transitions. [2019-12-27 19:43:46,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:43:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 34176 states and 112026 transitions. [2019-12-27 19:43:46,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:43:46,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:46,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:43:46,558 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:46,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:46,558 INFO L82 PathProgramCache]: Analyzing trace with hash 54051154, now seen corresponding path program 1 times [2019-12-27 19:43:46,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:46,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244920670] [2019-12-27 19:43:46,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:46,687 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-27 19:43:46,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244920670] [2019-12-27 19:43:46,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:46,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:43:46,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [855598138] [2019-12-27 19:43:46,689 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:46,691 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:46,694 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 19:43:46,694 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:46,694 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:43:46,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:43:46,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:46,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:43:46,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:43:46,696 INFO L87 Difference]: Start difference. First operand 34176 states and 112026 transitions. Second operand 4 states. [2019-12-27 19:43:47,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:47,103 INFO L93 Difference]: Finished difference Result 42178 states and 136956 transitions. [2019-12-27 19:43:47,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:43:47,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 19:43:47,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:47,175 INFO L225 Difference]: With dead ends: 42178 [2019-12-27 19:43:47,175 INFO L226 Difference]: Without dead ends: 42178 [2019-12-27 19:43:47,175 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-27 19:43:47,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42178 states. [2019-12-27 19:43:47,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42178 to 38132. [2019-12-27 19:43:47,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38132 states. [2019-12-27 19:43:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38132 states to 38132 states and 124449 transitions. [2019-12-27 19:43:47,975 INFO L78 Accepts]: Start accepts. Automaton has 38132 states and 124449 transitions. Word has length 16 [2019-12-27 19:43:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:47,977 INFO L462 AbstractCegarLoop]: Abstraction has 38132 states and 124449 transitions. [2019-12-27 19:43:47,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:43:47,977 INFO L276 IsEmpty]: Start isEmpty. Operand 38132 states and 124449 transitions. [2019-12-27 19:43:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:43:47,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:47,982 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:43:47,982 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:47,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash 53948296, now seen corresponding path program 1 times [2019-12-27 19:43:47,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:47,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768621585] [2019-12-27 19:43:47,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:48,040 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-27 19:43:48,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768621585] [2019-12-27 19:43:48,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:48,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:43:48,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [719761269] [2019-12-27 19:43:48,041 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:48,043 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:48,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 19:43:48,046 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:48,046 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:43:48,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:43:48,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:48,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:43:48,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:43:48,047 INFO L87 Difference]: Start difference. First operand 38132 states and 124449 transitions. Second operand 3 states. [2019-12-27 19:43:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:48,273 INFO L93 Difference]: Finished difference Result 55464 states and 180253 transitions. [2019-12-27 19:43:48,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:43:48,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 19:43:48,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:48,772 INFO L225 Difference]: With dead ends: 55464 [2019-12-27 19:43:48,772 INFO L226 Difference]: Without dead ends: 55464 [2019-12-27 19:43:48,773 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-27 19:43:49,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55464 states. [2019-12-27 19:43:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55464 to 42552. [2019-12-27 19:43:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42552 states. [2019-12-27 19:43:49,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42552 states to 42552 states and 139903 transitions. [2019-12-27 19:43:49,583 INFO L78 Accepts]: Start accepts. Automaton has 42552 states and 139903 transitions. Word has length 16 [2019-12-27 19:43:49,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:49,584 INFO L462 AbstractCegarLoop]: Abstraction has 42552 states and 139903 transitions. [2019-12-27 19:43:49,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:43:49,584 INFO L276 IsEmpty]: Start isEmpty. Operand 42552 states and 139903 transitions. [2019-12-27 19:43:49,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:43:49,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:49,587 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:43:49,587 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:49,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:49,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1761611220, now seen corresponding path program 1 times [2019-12-27 19:43:49,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:49,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182817682] [2019-12-27 19:43:49,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:49,686 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-27 19:43:49,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182817682] [2019-12-27 19:43:49,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:49,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:43:49,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [943150440] [2019-12-27 19:43:49,687 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:49,689 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:49,691 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 19:43:49,691 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:49,692 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:43:49,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:43:49,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:49,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:43:49,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:43:49,693 INFO L87 Difference]: Start difference. First operand 42552 states and 139903 transitions. Second operand 4 states. [2019-12-27 19:43:50,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:50,090 INFO L93 Difference]: Finished difference Result 50497 states and 164640 transitions. [2019-12-27 19:43:50,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:43:50,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 19:43:50,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:50,214 INFO L225 Difference]: With dead ends: 50497 [2019-12-27 19:43:50,215 INFO L226 Difference]: Without dead ends: 50497 [2019-12-27 19:43:50,215 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-27 19:43:50,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50497 states. [2019-12-27 19:43:51,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50497 to 44016. [2019-12-27 19:43:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44016 states. [2019-12-27 19:43:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44016 states to 44016 states and 144770 transitions. [2019-12-27 19:43:51,480 INFO L78 Accepts]: Start accepts. Automaton has 44016 states and 144770 transitions. Word has length 16 [2019-12-27 19:43:51,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:51,481 INFO L462 AbstractCegarLoop]: Abstraction has 44016 states and 144770 transitions. [2019-12-27 19:43:51,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:43:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 44016 states and 144770 transitions. [2019-12-27 19:43:51,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:43:51,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:51,490 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] [2019-12-27 19:43:51,491 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:51,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:51,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1491539652, now seen corresponding path program 1 times [2019-12-27 19:43:51,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:51,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37573489] [2019-12-27 19:43:51,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:51,575 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-27 19:43:51,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37573489] [2019-12-27 19:43:51,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:51,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:43:51,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [77693240] [2019-12-27 19:43:51,577 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:51,580 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:51,587 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 19:43:51,588 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:51,636 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:43:51,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:43:51,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:51,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:43:51,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:43:51,637 INFO L87 Difference]: Start difference. First operand 44016 states and 144770 transitions. Second operand 6 states. [2019-12-27 19:43:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:52,375 INFO L93 Difference]: Finished difference Result 60577 states and 194051 transitions. [2019-12-27 19:43:52,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:43:52,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 19:43:52,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:52,474 INFO L225 Difference]: With dead ends: 60577 [2019-12-27 19:43:52,474 INFO L226 Difference]: Without dead ends: 60570 [2019-12-27 19:43:52,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:43:52,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60570 states. [2019-12-27 19:43:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60570 to 45150. [2019-12-27 19:43:53,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45150 states. [2019-12-27 19:43:53,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45150 states to 45150 states and 148226 transitions. [2019-12-27 19:43:53,994 INFO L78 Accepts]: Start accepts. Automaton has 45150 states and 148226 transitions. Word has length 22 [2019-12-27 19:43:53,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:53,995 INFO L462 AbstractCegarLoop]: Abstraction has 45150 states and 148226 transitions. [2019-12-27 19:43:53,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:43:53,995 INFO L276 IsEmpty]: Start isEmpty. Operand 45150 states and 148226 transitions. [2019-12-27 19:43:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:43:54,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:54,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] [2019-12-27 19:43:54,004 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:54,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:54,004 INFO L82 PathProgramCache]: Analyzing trace with hash 987765270, now seen corresponding path program 1 times [2019-12-27 19:43:54,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:54,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66732952] [2019-12-27 19:43:54,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:54,078 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-27 19:43:54,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66732952] [2019-12-27 19:43:54,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:54,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:43:54,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2489150] [2019-12-27 19:43:54,079 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:54,083 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:54,088 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 19:43:54,088 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:54,103 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:43:54,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:43:54,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:54,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:43:54,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:43:54,105 INFO L87 Difference]: Start difference. First operand 45150 states and 148226 transitions. Second operand 6 states. [2019-12-27 19:43:54,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:54,988 INFO L93 Difference]: Finished difference Result 63824 states and 203774 transitions. [2019-12-27 19:43:54,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:43:54,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 19:43:54,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:55,127 INFO L225 Difference]: With dead ends: 63824 [2019-12-27 19:43:55,127 INFO L226 Difference]: Without dead ends: 63817 [2019-12-27 19:43:55,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:43:55,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63817 states. [2019-12-27 19:43:55,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63817 to 43599. [2019-12-27 19:43:55,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43599 states. [2019-12-27 19:43:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43599 states to 43599 states and 143212 transitions. [2019-12-27 19:43:56,057 INFO L78 Accepts]: Start accepts. Automaton has 43599 states and 143212 transitions. Word has length 22 [2019-12-27 19:43:56,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:56,057 INFO L462 AbstractCegarLoop]: Abstraction has 43599 states and 143212 transitions. [2019-12-27 19:43:56,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:43:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 43599 states and 143212 transitions. [2019-12-27 19:43:56,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:43:56,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:56,069 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-27 19:43:56,069 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:56,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:56,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1953235153, now seen corresponding path program 1 times [2019-12-27 19:43:56,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:56,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147111933] [2019-12-27 19:43:56,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:56,112 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-27 19:43:56,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147111933] [2019-12-27 19:43:56,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:56,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:43:56,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [395236317] [2019-12-27 19:43:56,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:56,117 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:56,126 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:43:56,126 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:56,140 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:43:56,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:43:56,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:56,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:43:56,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:43:56,142 INFO L87 Difference]: Start difference. First operand 43599 states and 143212 transitions. Second operand 5 states. [2019-12-27 19:43:56,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:56,243 INFO L93 Difference]: Finished difference Result 17791 states and 55309 transitions. [2019-12-27 19:43:56,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:43:56,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 19:43:56,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:56,274 INFO L225 Difference]: With dead ends: 17791 [2019-12-27 19:43:56,274 INFO L226 Difference]: Without dead ends: 17791 [2019-12-27 19:43:56,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-27 19:43:56,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17791 states. [2019-12-27 19:43:56,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17791 to 17428. [2019-12-27 19:43:56,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17428 states. [2019-12-27 19:43:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17428 states to 17428 states and 54273 transitions. [2019-12-27 19:43:56,896 INFO L78 Accepts]: Start accepts. Automaton has 17428 states and 54273 transitions. Word has length 25 [2019-12-27 19:43:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:56,897 INFO L462 AbstractCegarLoop]: Abstraction has 17428 states and 54273 transitions. [2019-12-27 19:43:56,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:43:56,897 INFO L276 IsEmpty]: Start isEmpty. Operand 17428 states and 54273 transitions. [2019-12-27 19:43:56,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:43:56,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:56,911 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] [2019-12-27 19:43:56,911 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:56,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:56,912 INFO L82 PathProgramCache]: Analyzing trace with hash 451000002, now seen corresponding path program 1 times [2019-12-27 19:43:56,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:56,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825321261] [2019-12-27 19:43:56,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:56,954 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-27 19:43:56,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825321261] [2019-12-27 19:43:56,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:56,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:43:56,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [46331554] [2019-12-27 19:43:56,958 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:56,964 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:56,970 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 19:43:56,970 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:56,970 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:43:56,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:43:56,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:56,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:43:56,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:43:56,971 INFO L87 Difference]: Start difference. First operand 17428 states and 54273 transitions. Second operand 3 states. [2019-12-27 19:43:57,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:57,116 INFO L93 Difference]: Finished difference Result 22857 states and 67585 transitions. [2019-12-27 19:43:57,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:43:57,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 19:43:57,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:57,152 INFO L225 Difference]: With dead ends: 22857 [2019-12-27 19:43:57,152 INFO L226 Difference]: Without dead ends: 22857 [2019-12-27 19:43:57,153 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-27 19:43:57,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22857 states. [2019-12-27 19:43:57,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22857 to 17428. [2019-12-27 19:43:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17428 states. [2019-12-27 19:43:57,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17428 states to 17428 states and 51895 transitions. [2019-12-27 19:43:57,465 INFO L78 Accepts]: Start accepts. Automaton has 17428 states and 51895 transitions. Word has length 27 [2019-12-27 19:43:57,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:57,465 INFO L462 AbstractCegarLoop]: Abstraction has 17428 states and 51895 transitions. [2019-12-27 19:43:57,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:43:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 17428 states and 51895 transitions. [2019-12-27 19:43:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:43:57,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:57,478 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] [2019-12-27 19:43:57,478 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:57,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:57,478 INFO L82 PathProgramCache]: Analyzing trace with hash -319576223, now seen corresponding path program 1 times [2019-12-27 19:43:57,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:57,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275965584] [2019-12-27 19:43:57,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:57,575 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-27 19:43:57,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275965584] [2019-12-27 19:43:57,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:57,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:43:57,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1727272904] [2019-12-27 19:43:57,576 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:57,580 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:57,585 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 19:43:57,585 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:57,586 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:43:57,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:43:57,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:57,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:43:57,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:43:57,587 INFO L87 Difference]: Start difference. First operand 17428 states and 51895 transitions. Second operand 5 states. [2019-12-27 19:43:58,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:58,009 INFO L93 Difference]: Finished difference Result 21434 states and 63020 transitions. [2019-12-27 19:43:58,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:43:58,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 19:43:58,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:58,038 INFO L225 Difference]: With dead ends: 21434 [2019-12-27 19:43:58,038 INFO L226 Difference]: Without dead ends: 21434 [2019-12-27 19:43:58,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:43:58,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21434 states. [2019-12-27 19:43:58,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21434 to 20103. [2019-12-27 19:43:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20103 states. [2019-12-27 19:43:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20103 states to 20103 states and 59665 transitions. [2019-12-27 19:43:58,363 INFO L78 Accepts]: Start accepts. Automaton has 20103 states and 59665 transitions. Word has length 27 [2019-12-27 19:43:58,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:58,364 INFO L462 AbstractCegarLoop]: Abstraction has 20103 states and 59665 transitions. [2019-12-27 19:43:58,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:43:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 20103 states and 59665 transitions. [2019-12-27 19:43:58,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 19:43:58,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:58,380 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] [2019-12-27 19:43:58,380 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:58,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:58,380 INFO L82 PathProgramCache]: Analyzing trace with hash -19850815, now seen corresponding path program 1 times [2019-12-27 19:43:58,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:58,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913127399] [2019-12-27 19:43:58,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:58,459 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-27 19:43:58,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913127399] [2019-12-27 19:43:58,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:58,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:43:58,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [463065379] [2019-12-27 19:43:58,460 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:58,465 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:58,472 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 19:43:58,472 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:58,472 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:43:58,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:43:58,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:58,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:43:58,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:43:58,473 INFO L87 Difference]: Start difference. First operand 20103 states and 59665 transitions. Second operand 5 states. [2019-12-27 19:43:58,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:58,616 INFO L93 Difference]: Finished difference Result 20407 states and 60436 transitions. [2019-12-27 19:43:58,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:43:58,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 19:43:58,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:58,652 INFO L225 Difference]: With dead ends: 20407 [2019-12-27 19:43:58,653 INFO L226 Difference]: Without dead ends: 20407 [2019-12-27 19:43:58,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:43:58,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20407 states. [2019-12-27 19:43:58,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20407 to 20407. [2019-12-27 19:43:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20407 states. [2019-12-27 19:43:58,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20407 states to 20407 states and 60436 transitions. [2019-12-27 19:43:58,979 INFO L78 Accepts]: Start accepts. Automaton has 20407 states and 60436 transitions. Word has length 28 [2019-12-27 19:43:58,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:58,979 INFO L462 AbstractCegarLoop]: Abstraction has 20407 states and 60436 transitions. [2019-12-27 19:43:58,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:43:58,979 INFO L276 IsEmpty]: Start isEmpty. Operand 20407 states and 60436 transitions. [2019-12-27 19:43:58,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 19:43:58,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:58,996 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] [2019-12-27 19:43:58,996 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:58,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:58,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1237552585, now seen corresponding path program 1 times [2019-12-27 19:43:58,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:58,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155718492] [2019-12-27 19:43:58,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:59,086 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-27 19:43:59,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155718492] [2019-12-27 19:43:59,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:59,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:43:59,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [353661330] [2019-12-27 19:43:59,087 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:59,092 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:59,100 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 29 transitions. [2019-12-27 19:43:59,100 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:59,100 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:43:59,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:43:59,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:59,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:43:59,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:43:59,101 INFO L87 Difference]: Start difference. First operand 20407 states and 60436 transitions. Second operand 5 states. [2019-12-27 19:43:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:59,443 INFO L93 Difference]: Finished difference Result 23784 states and 69539 transitions. [2019-12-27 19:43:59,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:43:59,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 19:43:59,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:59,475 INFO L225 Difference]: With dead ends: 23784 [2019-12-27 19:43:59,475 INFO L226 Difference]: Without dead ends: 23784 [2019-12-27 19:43:59,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:43:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23784 states. [2019-12-27 19:43:59,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23784 to 20614. [2019-12-27 19:43:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20614 states. [2019-12-27 19:44:00,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20614 states to 20614 states and 60980 transitions. [2019-12-27 19:44:00,015 INFO L78 Accepts]: Start accepts. Automaton has 20614 states and 60980 transitions. Word has length 29 [2019-12-27 19:44:00,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:44:00,016 INFO L462 AbstractCegarLoop]: Abstraction has 20614 states and 60980 transitions. [2019-12-27 19:44:00,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:44:00,016 INFO L276 IsEmpty]: Start isEmpty. Operand 20614 states and 60980 transitions. [2019-12-27 19:44:00,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 19:44:00,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:44:00,038 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] [2019-12-27 19:44:00,038 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:44:00,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:44:00,038 INFO L82 PathProgramCache]: Analyzing trace with hash 900090167, now seen corresponding path program 1 times [2019-12-27 19:44:00,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:44:00,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773256889] [2019-12-27 19:44:00,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:44:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:44:00,143 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-27 19:44:00,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773256889] [2019-12-27 19:44:00,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:44:00,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:44:00,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2032169888] [2019-12-27 19:44:00,144 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:44:00,149 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:44:00,160 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 19:44:00,160 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:44:00,190 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:44:00,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:44:00,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:44:00,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:44:00,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:44:00,191 INFO L87 Difference]: Start difference. First operand 20614 states and 60980 transitions. Second operand 7 states. [2019-12-27 19:44:01,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:44:01,054 INFO L93 Difference]: Finished difference Result 27479 states and 79870 transitions. [2019-12-27 19:44:01,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:44:01,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 19:44:01,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:44:01,092 INFO L225 Difference]: With dead ends: 27479 [2019-12-27 19:44:01,092 INFO L226 Difference]: Without dead ends: 27479 [2019-12-27 19:44:01,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:44:01,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27479 states. [2019-12-27 19:44:01,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27479 to 21693. [2019-12-27 19:44:01,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21693 states. [2019-12-27 19:44:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21693 states to 21693 states and 64090 transitions. [2019-12-27 19:44:01,463 INFO L78 Accepts]: Start accepts. Automaton has 21693 states and 64090 transitions. Word has length 33 [2019-12-27 19:44:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:44:01,464 INFO L462 AbstractCegarLoop]: Abstraction has 21693 states and 64090 transitions. [2019-12-27 19:44:01,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:44:01,464 INFO L276 IsEmpty]: Start isEmpty. Operand 21693 states and 64090 transitions. [2019-12-27 19:44:01,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 19:44:01,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:44:01,483 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] [2019-12-27 19:44:01,483 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:44:01,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:44:01,484 INFO L82 PathProgramCache]: Analyzing trace with hash 810881567, now seen corresponding path program 1 times [2019-12-27 19:44:01,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:44:01,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222060855] [2019-12-27 19:44:01,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:44:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:44:01,604 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-27 19:44:01,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222060855] [2019-12-27 19:44:01,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:44:01,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:44:01,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [249402001] [2019-12-27 19:44:01,605 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:44:01,612 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:44:01,626 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 63 transitions. [2019-12-27 19:44:01,626 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:44:01,652 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:44:01,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:44:01,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:44:01,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:44:01,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:44:01,653 INFO L87 Difference]: Start difference. First operand 21693 states and 64090 transitions. Second operand 7 states. [2019-12-27 19:44:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:44:02,543 INFO L93 Difference]: Finished difference Result 26605 states and 77567 transitions. [2019-12-27 19:44:02,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:44:02,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-27 19:44:02,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:44:02,580 INFO L225 Difference]: With dead ends: 26605 [2019-12-27 19:44:02,581 INFO L226 Difference]: Without dead ends: 26605 [2019-12-27 19:44:02,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:44:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26605 states. [2019-12-27 19:44:02,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26605 to 18643. [2019-12-27 19:44:02,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18643 states. [2019-12-27 19:44:02,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18643 states to 18643 states and 55403 transitions. [2019-12-27 19:44:02,923 INFO L78 Accepts]: Start accepts. Automaton has 18643 states and 55403 transitions. Word has length 35 [2019-12-27 19:44:02,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:44:02,923 INFO L462 AbstractCegarLoop]: Abstraction has 18643 states and 55403 transitions. [2019-12-27 19:44:02,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:44:02,924 INFO L276 IsEmpty]: Start isEmpty. Operand 18643 states and 55403 transitions. [2019-12-27 19:44:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 19:44:02,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:44:02,942 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] [2019-12-27 19:44:02,943 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:44:02,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:44:02,943 INFO L82 PathProgramCache]: Analyzing trace with hash 173355914, now seen corresponding path program 1 times [2019-12-27 19:44:02,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:44:02,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817511763] [2019-12-27 19:44:02,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:44:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:44:03,003 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-27 19:44:03,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817511763] [2019-12-27 19:44:03,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:44:03,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:44:03,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1941332872] [2019-12-27 19:44:03,005 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:44:03,012 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:44:03,057 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 231 transitions. [2019-12-27 19:44:03,057 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:44:03,058 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:44:03,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:44:03,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:44:03,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:44:03,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:44:03,059 INFO L87 Difference]: Start difference. First operand 18643 states and 55403 transitions. Second operand 3 states. [2019-12-27 19:44:03,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:44:03,116 INFO L93 Difference]: Finished difference Result 18642 states and 55401 transitions. [2019-12-27 19:44:03,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:44:03,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 19:44:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:44:03,142 INFO L225 Difference]: With dead ends: 18642 [2019-12-27 19:44:03,142 INFO L226 Difference]: Without dead ends: 18642 [2019-12-27 19:44:03,142 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-27 19:44:03,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18642 states. [2019-12-27 19:44:03,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18642 to 18642. [2019-12-27 19:44:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18642 states. [2019-12-27 19:44:03,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18642 states to 18642 states and 55401 transitions. [2019-12-27 19:44:03,592 INFO L78 Accepts]: Start accepts. Automaton has 18642 states and 55401 transitions. Word has length 39 [2019-12-27 19:44:03,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:44:03,592 INFO L462 AbstractCegarLoop]: Abstraction has 18642 states and 55401 transitions. [2019-12-27 19:44:03,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:44:03,592 INFO L276 IsEmpty]: Start isEmpty. Operand 18642 states and 55401 transitions. [2019-12-27 19:44:03,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 19:44:03,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:44:03,617 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] [2019-12-27 19:44:03,617 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:44:03,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:44:03,617 INFO L82 PathProgramCache]: Analyzing trace with hash -121906311, now seen corresponding path program 1 times [2019-12-27 19:44:03,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:44:03,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990680860] [2019-12-27 19:44:03,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:44:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:44:03,691 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-27 19:44:03,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990680860] [2019-12-27 19:44:03,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:44:03,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:44:03,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1913519782] [2019-12-27 19:44:03,693 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:44:03,701 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:44:03,766 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 276 transitions. [2019-12-27 19:44:03,767 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:44:03,781 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:44:03,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:44:03,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:44:03,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:44:03,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:44:03,782 INFO L87 Difference]: Start difference. First operand 18642 states and 55401 transitions. Second operand 4 states. [2019-12-27 19:44:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:44:04,120 INFO L93 Difference]: Finished difference Result 27440 states and 79592 transitions. [2019-12-27 19:44:04,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:44:04,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 19:44:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:44:04,156 INFO L225 Difference]: With dead ends: 27440 [2019-12-27 19:44:04,156 INFO L226 Difference]: Without dead ends: 27440 [2019-12-27 19:44:04,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-27 19:44:04,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27440 states. [2019-12-27 19:44:04,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27440 to 18634. [2019-12-27 19:44:04,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18634 states. [2019-12-27 19:44:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18634 states to 18634 states and 54671 transitions. [2019-12-27 19:44:04,496 INFO L78 Accepts]: Start accepts. Automaton has 18634 states and 54671 transitions. Word has length 40 [2019-12-27 19:44:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:44:04,496 INFO L462 AbstractCegarLoop]: Abstraction has 18634 states and 54671 transitions. [2019-12-27 19:44:04,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:44:04,496 INFO L276 IsEmpty]: Start isEmpty. Operand 18634 states and 54671 transitions. [2019-12-27 19:44:04,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 19:44:04,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:44:04,520 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] [2019-12-27 19:44:04,520 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:44:04,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:44:04,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1092762268, now seen corresponding path program 1 times [2019-12-27 19:44:04,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:44:04,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085828188] [2019-12-27 19:44:04,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:44:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:44:04,602 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-27 19:44:04,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085828188] [2019-12-27 19:44:04,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:44:04,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:44:04,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [189606160] [2019-12-27 19:44:04,606 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:44:04,617 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:44:04,665 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 237 transitions. [2019-12-27 19:44:04,666 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:44:04,667 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:44:04,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:44:04,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:44:04,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:44:04,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:44:04,668 INFO L87 Difference]: Start difference. First operand 18634 states and 54671 transitions. Second operand 3 states. [2019-12-27 19:44:04,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:44:04,727 INFO L93 Difference]: Finished difference Result 18634 states and 54594 transitions. [2019-12-27 19:44:04,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:44:04,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 19:44:04,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:44:04,751 INFO L225 Difference]: With dead ends: 18634 [2019-12-27 19:44:04,751 INFO L226 Difference]: Without dead ends: 18634 [2019-12-27 19:44:04,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-27 19:44:04,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18634 states. [2019-12-27 19:44:04,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18634 to 16452. [2019-12-27 19:44:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16452 states. [2019-12-27 19:44:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16452 states to 16452 states and 48592 transitions. [2019-12-27 19:44:05,018 INFO L78 Accepts]: Start accepts. Automaton has 16452 states and 48592 transitions. Word has length 41 [2019-12-27 19:44:05,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:44:05,019 INFO L462 AbstractCegarLoop]: Abstraction has 16452 states and 48592 transitions. [2019-12-27 19:44:05,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:44:05,019 INFO L276 IsEmpty]: Start isEmpty. Operand 16452 states and 48592 transitions. [2019-12-27 19:44:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 19:44:05,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:44:05,034 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] [2019-12-27 19:44:05,034 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:44:05,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:44:05,035 INFO L82 PathProgramCache]: Analyzing trace with hash 592584646, now seen corresponding path program 1 times [2019-12-27 19:44:05,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:44:05,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273184308] [2019-12-27 19:44:05,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:44:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:44:05,094 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-27 19:44:05,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273184308] [2019-12-27 19:44:05,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:44:05,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:44:05,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [256168586] [2019-12-27 19:44:05,095 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:44:05,105 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:44:05,168 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 240 transitions. [2019-12-27 19:44:05,168 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:44:05,203 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 19:44:05,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:44:05,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:44:05,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:44:05,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:44:05,204 INFO L87 Difference]: Start difference. First operand 16452 states and 48592 transitions. Second operand 7 states. [2019-12-27 19:44:05,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:44:05,292 INFO L93 Difference]: Finished difference Result 15254 states and 46027 transitions. [2019-12-27 19:44:05,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:44:05,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-27 19:44:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:44:05,314 INFO L225 Difference]: With dead ends: 15254 [2019-12-27 19:44:05,314 INFO L226 Difference]: Without dead ends: 15254 [2019-12-27 19:44:05,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:44:05,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15254 states. [2019-12-27 19:44:05,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15254 to 15254. [2019-12-27 19:44:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15254 states. [2019-12-27 19:44:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15254 states to 15254 states and 46027 transitions. [2019-12-27 19:44:05,767 INFO L78 Accepts]: Start accepts. Automaton has 15254 states and 46027 transitions. Word has length 42 [2019-12-27 19:44:05,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:44:05,767 INFO L462 AbstractCegarLoop]: Abstraction has 15254 states and 46027 transitions. [2019-12-27 19:44:05,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:44:05,767 INFO L276 IsEmpty]: Start isEmpty. Operand 15254 states and 46027 transitions. [2019-12-27 19:44:05,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 19:44:05,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:44:05,783 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-27 19:44:05,783 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:44:05,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:44:05,783 INFO L82 PathProgramCache]: Analyzing trace with hash -269656493, now seen corresponding path program 1 times [2019-12-27 19:44:05,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:44:05,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856357772] [2019-12-27 19:44:05,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:44:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:44:05,876 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-27 19:44:05,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856357772] [2019-12-27 19:44:05,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:44:05,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:44:05,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1990193157] [2019-12-27 19:44:05,877 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:44:05,915 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:44:06,100 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 422 transitions. [2019-12-27 19:44:06,100 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:44:06,102 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:44:06,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:44:06,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:44:06,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:44:06,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:44:06,103 INFO L87 Difference]: Start difference. First operand 15254 states and 46027 transitions. Second operand 3 states. [2019-12-27 19:44:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:44:06,195 INFO L93 Difference]: Finished difference Result 17746 states and 53311 transitions. [2019-12-27 19:44:06,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:44:06,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 19:44:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:44:06,219 INFO L225 Difference]: With dead ends: 17746 [2019-12-27 19:44:06,219 INFO L226 Difference]: Without dead ends: 17746 [2019-12-27 19:44:06,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-27 19:44:06,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17746 states. [2019-12-27 19:44:06,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17746 to 14015. [2019-12-27 19:44:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14015 states. [2019-12-27 19:44:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14015 states to 14015 states and 42411 transitions. [2019-12-27 19:44:06,470 INFO L78 Accepts]: Start accepts. Automaton has 14015 states and 42411 transitions. Word has length 66 [2019-12-27 19:44:06,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:44:06,470 INFO L462 AbstractCegarLoop]: Abstraction has 14015 states and 42411 transitions. [2019-12-27 19:44:06,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:44:06,470 INFO L276 IsEmpty]: Start isEmpty. Operand 14015 states and 42411 transitions. [2019-12-27 19:44:06,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:44:06,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:44:06,485 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-27 19:44:06,485 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:44:06,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:44:06,485 INFO L82 PathProgramCache]: Analyzing trace with hash -466576635, now seen corresponding path program 1 times [2019-12-27 19:44:06,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:44:06,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955087882] [2019-12-27 19:44:06,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:44:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:44:06,712 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-27 19:44:06,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955087882] [2019-12-27 19:44:06,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:44:06,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:44:06,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1344206881] [2019-12-27 19:44:06,713 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:44:06,766 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:44:07,093 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 427 transitions. [2019-12-27 19:44:07,093 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:44:07,163 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:44:07,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:44:07,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:44:07,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:44:07,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:44:07,166 INFO L87 Difference]: Start difference. First operand 14015 states and 42411 transitions. Second operand 12 states. [2019-12-27 19:44:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:44:09,333 INFO L93 Difference]: Finished difference Result 29414 states and 88402 transitions. [2019-12-27 19:44:09,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 19:44:09,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 19:44:09,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:44:09,362 INFO L225 Difference]: With dead ends: 29414 [2019-12-27 19:44:09,362 INFO L226 Difference]: Without dead ends: 20262 [2019-12-27 19:44:09,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2019-12-27 19:44:09,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20262 states. [2019-12-27 19:44:09,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20262 to 16785. [2019-12-27 19:44:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16785 states. [2019-12-27 19:44:09,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16785 states to 16785 states and 50449 transitions. [2019-12-27 19:44:09,829 INFO L78 Accepts]: Start accepts. Automaton has 16785 states and 50449 transitions. Word has length 67 [2019-12-27 19:44:09,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:44:09,829 INFO L462 AbstractCegarLoop]: Abstraction has 16785 states and 50449 transitions. [2019-12-27 19:44:09,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:44:09,829 INFO L276 IsEmpty]: Start isEmpty. Operand 16785 states and 50449 transitions. [2019-12-27 19:44:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:44:09,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:44:09,847 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-27 19:44:09,847 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:44:09,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:44:09,847 INFO L82 PathProgramCache]: Analyzing trace with hash -638378747, now seen corresponding path program 2 times [2019-12-27 19:44:09,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:44:09,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314788518] [2019-12-27 19:44:09,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:44:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:44:10,176 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-27 19:44:10,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314788518] [2019-12-27 19:44:10,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:44:10,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 19:44:10,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1889071880] [2019-12-27 19:44:10,178 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:44:10,200 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:44:10,451 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 262 states and 495 transitions. [2019-12-27 19:44:10,452 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:44:10,608 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 19:44:10,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 19:44:10,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:44:10,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 19:44:10,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:44:10,609 INFO L87 Difference]: Start difference. First operand 16785 states and 50449 transitions. Second operand 16 states. [2019-12-27 19:44:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:44:12,704 INFO L93 Difference]: Finished difference Result 22973 states and 68370 transitions. [2019-12-27 19:44:12,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 19:44:12,704 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 19:44:12,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:44:12,729 INFO L225 Difference]: With dead ends: 22973 [2019-12-27 19:44:12,729 INFO L226 Difference]: Without dead ends: 19466 [2019-12-27 19:44:12,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2019-12-27 19:44:12,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19466 states. [2019-12-27 19:44:12,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19466 to 17328. [2019-12-27 19:44:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17328 states. [2019-12-27 19:44:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17328 states to 17328 states and 51836 transitions. [2019-12-27 19:44:13,013 INFO L78 Accepts]: Start accepts. Automaton has 17328 states and 51836 transitions. Word has length 67 [2019-12-27 19:44:13,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:44:13,013 INFO L462 AbstractCegarLoop]: Abstraction has 17328 states and 51836 transitions. [2019-12-27 19:44:13,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 19:44:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 17328 states and 51836 transitions. [2019-12-27 19:44:13,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:44:13,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:44:13,031 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-27 19:44:13,032 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:44:13,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:44:13,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1948834343, now seen corresponding path program 3 times [2019-12-27 19:44:13,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:44:13,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780772425] [2019-12-27 19:44:13,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:44:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:44:13,246 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-27 19:44:13,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780772425] [2019-12-27 19:44:13,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:44:13,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 19:44:13,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [17043876] [2019-12-27 19:44:13,250 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:44:13,271 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:44:13,669 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 263 states and 518 transitions. [2019-12-27 19:44:13,669 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:44:14,017 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 19:44:14,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 19:44:14,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:44:14,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 19:44:14,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-27 19:44:14,018 INFO L87 Difference]: Start difference. First operand 17328 states and 51836 transitions. Second operand 17 states. [2019-12-27 19:44:19,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:44:19,429 INFO L93 Difference]: Finished difference Result 42971 states and 128143 transitions. [2019-12-27 19:44:19,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 19:44:19,430 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 19:44:19,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:44:19,477 INFO L225 Difference]: With dead ends: 42971 [2019-12-27 19:44:19,477 INFO L226 Difference]: Without dead ends: 33865 [2019-12-27 19:44:19,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=496, Invalid=2366, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 19:44:19,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33865 states. [2019-12-27 19:44:19,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33865 to 21522. [2019-12-27 19:44:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21522 states. [2019-12-27 19:44:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21522 states to 21522 states and 65157 transitions. [2019-12-27 19:44:19,913 INFO L78 Accepts]: Start accepts. Automaton has 21522 states and 65157 transitions. Word has length 67 [2019-12-27 19:44:19,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:44:19,913 INFO L462 AbstractCegarLoop]: Abstraction has 21522 states and 65157 transitions. [2019-12-27 19:44:19,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 19:44:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 21522 states and 65157 transitions. [2019-12-27 19:44:19,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:44:19,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:44:19,938 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-27 19:44:19,938 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:44:19,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:44:19,939 INFO L82 PathProgramCache]: Analyzing trace with hash -626626987, now seen corresponding path program 4 times [2019-12-27 19:44:19,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:44:19,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515776970] [2019-12-27 19:44:19,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:44:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:44:20,234 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-27 19:44:20,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515776970] [2019-12-27 19:44:20,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:44:20,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:44:20,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [549103002] [2019-12-27 19:44:20,235 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:44:20,255 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:44:20,718 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 419 transitions. [2019-12-27 19:44:20,718 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:44:20,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:44:21,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:44:21,329 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 19:44:21,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 19:44:21,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:44:21,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 19:44:21,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-12-27 19:44:21,331 INFO L87 Difference]: Start difference. First operand 21522 states and 65157 transitions. Second operand 24 states. [2019-12-27 19:44:29,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:44:29,092 INFO L93 Difference]: Finished difference Result 42949 states and 128831 transitions. [2019-12-27 19:44:29,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-27 19:44:29,092 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-12-27 19:44:29,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:44:29,154 INFO L225 Difference]: With dead ends: 42949 [2019-12-27 19:44:29,154 INFO L226 Difference]: Without dead ends: 40134 [2019-12-27 19:44:29,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1747 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=818, Invalid=5662, Unknown=0, NotChecked=0, Total=6480 [2019-12-27 19:44:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40134 states. [2019-12-27 19:44:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40134 to 22383. [2019-12-27 19:44:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22383 states. [2019-12-27 19:44:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22383 states to 22383 states and 67553 transitions. [2019-12-27 19:44:29,870 INFO L78 Accepts]: Start accepts. Automaton has 22383 states and 67553 transitions. Word has length 67 [2019-12-27 19:44:29,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:44:29,871 INFO L462 AbstractCegarLoop]: Abstraction has 22383 states and 67553 transitions. [2019-12-27 19:44:29,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 19:44:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 22383 states and 67553 transitions. [2019-12-27 19:44:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:44:29,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:44:29,893 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-27 19:44:29,893 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:44:29,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:44:29,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1945162693, now seen corresponding path program 5 times [2019-12-27 19:44:29,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:44:29,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602794822] [2019-12-27 19:44:29,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:44:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:44:30,198 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-27 19:44:30,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602794822] [2019-12-27 19:44:30,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:44:30,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:44:30,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1346516352] [2019-12-27 19:44:30,199 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:44:30,215 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:44:30,583 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 592 transitions. [2019-12-27 19:44:30,583 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:44:30,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 19:44:30,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:44:31,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 19:44:31,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:44:31,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:44:31,281 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 33 times. [2019-12-27 19:44:31,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 19:44:31,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:44:31,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 19:44:31,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-12-27 19:44:31,282 INFO L87 Difference]: Start difference. First operand 22383 states and 67553 transitions. Second operand 25 states. [2019-12-27 19:44:38,201 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-12-27 19:44:39,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:44:39,662 INFO L93 Difference]: Finished difference Result 48997 states and 145786 transitions. [2019-12-27 19:44:39,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-27 19:44:39,663 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2019-12-27 19:44:39,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:44:39,723 INFO L225 Difference]: With dead ends: 48997 [2019-12-27 19:44:39,723 INFO L226 Difference]: Without dead ends: 43144 [2019-12-27 19:44:39,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=900, Invalid=5262, Unknown=0, NotChecked=0, Total=6162 [2019-12-27 19:44:39,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43144 states. [2019-12-27 19:44:40,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43144 to 21240. [2019-12-27 19:44:40,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21240 states. [2019-12-27 19:44:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21240 states to 21240 states and 64374 transitions. [2019-12-27 19:44:40,215 INFO L78 Accepts]: Start accepts. Automaton has 21240 states and 64374 transitions. Word has length 67 [2019-12-27 19:44:40,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:44:40,215 INFO L462 AbstractCegarLoop]: Abstraction has 21240 states and 64374 transitions. [2019-12-27 19:44:40,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 19:44:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 21240 states and 64374 transitions. [2019-12-27 19:44:40,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:44:40,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:44:40,239 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-27 19:44:40,240 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:44:40,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:44:40,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1040963391, now seen corresponding path program 6 times [2019-12-27 19:44:40,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:44:40,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594212191] [2019-12-27 19:44:40,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:44:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:44:40,581 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-27 19:44:40,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594212191] [2019-12-27 19:44:40,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:44:40,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 19:44:40,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1049946362] [2019-12-27 19:44:40,582 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:44:40,592 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:44:40,777 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 254 states and 470 transitions. [2019-12-27 19:44:40,777 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:44:41,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 19:44:41,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:44:41,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:44:41,451 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 33 times. [2019-12-27 19:44:41,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 19:44:41,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:44:41,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 19:44:41,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:44:41,452 INFO L87 Difference]: Start difference. First operand 21240 states and 64374 transitions. Second operand 22 states. [2019-12-27 19:44:48,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:44:48,608 INFO L93 Difference]: Finished difference Result 28660 states and 85326 transitions. [2019-12-27 19:44:48,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-27 19:44:48,608 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-12-27 19:44:48,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:44:48,647 INFO L225 Difference]: With dead ends: 28660 [2019-12-27 19:44:48,647 INFO L226 Difference]: Without dead ends: 27145 [2019-12-27 19:44:48,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 16 SyntacticMatches, 15 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=478, Invalid=3304, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 19:44:48,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27145 states. [2019-12-27 19:44:48,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27145 to 22012. [2019-12-27 19:44:48,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22012 states. [2019-12-27 19:44:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22012 states to 22012 states and 66553 transitions. [2019-12-27 19:44:49,027 INFO L78 Accepts]: Start accepts. Automaton has 22012 states and 66553 transitions. Word has length 67 [2019-12-27 19:44:49,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:44:49,027 INFO L462 AbstractCegarLoop]: Abstraction has 22012 states and 66553 transitions. [2019-12-27 19:44:49,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 19:44:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 22012 states and 66553 transitions. [2019-12-27 19:44:49,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:44:49,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:44:49,052 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-27 19:44:49,053 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:44:49,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:44:49,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1050036249, now seen corresponding path program 7 times [2019-12-27 19:44:49,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:44:49,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127392897] [2019-12-27 19:44:49,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:44:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:44:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:44:49,192 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:44:49,193 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:44:49,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= 0 v_~z$r_buff1_thd2~0_19) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~main$tmp_guard1~0_16 0) (= v_~z$r_buff0_thd3~0_79 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t83~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t83~0.base_27|) |v_ULTIMATE.start_main_~#t83~0.offset_19| 0)) |v_#memory_int_21|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t83~0.base_27|)) (= 0 v_~__unbuffered_cnt~0_21) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t83~0.base_27| 1)) (= 0 |v_ULTIMATE.start_main_~#t83~0.offset_19|) (= v_~z$read_delayed~0_6 0) (= 0 v_~weak$$choice2~0_32) (= v_~z$r_buff0_thd0~0_21 0) (= v_~z$w_buff0_used~0_112 0) (= 0 v_~z$r_buff1_thd1~0_17) (= v_~x~0_10 0) (= 0 v_~z$mem_tmp~0_9) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t83~0.base_27| 4)) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$r_buff1_thd0~0_23) (= 0 v_~z$w_buff1_used~0_70) (= 0 v_~weak$$choice0~0_7) (= v_~__unbuffered_p2_EBX~0_15 0) (= v_~z~0_25 0) (= 0 |v_#NULL.base_7|) (= 0 v_~y~0_8) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 v_~z$r_buff1_thd3~0_47) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_25) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~z$r_buff0_thd2~0_21 0) (= v_~z$r_buff0_thd1~0_28 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t83~0.base_27|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t83~0.base=|v_ULTIMATE.start_main_~#t83~0.base_27|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ULTIMATE.start_main_~#t85~0.offset=|v_ULTIMATE.start_main_~#t85~0.offset_15|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_10|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_21|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t84~0.base=|v_ULTIMATE.start_main_~#t84~0.base_24|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_10|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ULTIMATE.start_main_~#t84~0.offset=|v_ULTIMATE.start_main_~#t84~0.offset_18|, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ULTIMATE.start_main_~#t85~0.base=|v_ULTIMATE.start_main_~#t85~0.base_18|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t83~0.offset=|v_ULTIMATE.start_main_~#t83~0.offset_19|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t83~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t85~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t84~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t84~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t85~0.base, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t83~0.offset, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 19:44:49,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L750: Formula: (and (= ~z$r_buff0_thd1~0_Out-1604102430 1) (= ~z$r_buff0_thd3~0_In-1604102430 ~z$r_buff1_thd3~0_Out-1604102430) (= ~z$r_buff1_thd1~0_Out-1604102430 ~z$r_buff0_thd1~0_In-1604102430) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1604102430 0)) (= ~z$r_buff1_thd2~0_Out-1604102430 ~z$r_buff0_thd2~0_In-1604102430) (= ~z$r_buff0_thd0~0_In-1604102430 ~z$r_buff1_thd0~0_Out-1604102430) (= ~__unbuffered_p0_EAX~0_Out-1604102430 ~x~0_In-1604102430)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1604102430, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1604102430, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1604102430, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1604102430, ~x~0=~x~0_In-1604102430, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1604102430} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1604102430, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1604102430, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1604102430, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1604102430, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1604102430, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1604102430, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1604102430, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1604102430, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1604102430, ~x~0=~x~0_In-1604102430, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1604102430} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 19:44:49,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t84~0.offset_10| 0) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t84~0.base_11| 1)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t84~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t84~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t84~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t84~0.base_11| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t84~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t84~0.base_11|) |v_ULTIMATE.start_main_~#t84~0.offset_10| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t84~0.base=|v_ULTIMATE.start_main_~#t84~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t84~0.offset=|v_ULTIMATE.start_main_~#t84~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t84~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t84~0.offset] because there is no mapped edge [2019-12-27 19:44:49,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L834-1-->L836: Formula: (and (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t85~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t85~0.base_11| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t85~0.base_11|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t85~0.base_11| 1) |v_#valid_31|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t85~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t85~0.base_11|) |v_ULTIMATE.start_main_~#t85~0.offset_10| 2)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t85~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t85~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t85~0.base=|v_ULTIMATE.start_main_~#t85~0.base_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t85~0.offset=|v_ULTIMATE.start_main_~#t85~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t85~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t85~0.offset] because there is no mapped edge [2019-12-27 19:44:49,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L773-2-->L773-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out-849178472| |P1Thread1of1ForFork2_#t~ite10_Out-849178472|)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-849178472 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-849178472 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out-849178472| ~z$w_buff1~0_In-849178472)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-849178472| ~z~0_In-849178472) .cse1 (or .cse0 .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-849178472, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-849178472, ~z$w_buff1~0=~z$w_buff1~0_In-849178472, ~z~0=~z~0_In-849178472} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-849178472|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-849178472, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-849178472|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-849178472, ~z$w_buff1~0=~z$w_buff1~0_In-849178472, ~z~0=~z~0_In-849178472} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 19:44:49,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In181044970 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In181044970 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out181044970|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In181044970 |P1Thread1of1ForFork2_#t~ite11_Out181044970|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In181044970, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In181044970} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In181044970, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out181044970|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In181044970} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 19:44:49,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1662983973 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1662983973 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1662983973 |P0Thread1of1ForFork1_#t~ite5_Out1662983973|)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out1662983973| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1662983973, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1662983973} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1662983973|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1662983973, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1662983973} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 19:44:49,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1343751912 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1343751912 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1343751912 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1343751912 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-1343751912| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite6_Out-1343751912| ~z$w_buff1_used~0_In-1343751912)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1343751912, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1343751912, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1343751912, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1343751912} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1343751912, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1343751912|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1343751912, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1343751912, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1343751912} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 19:44:49,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-461647850 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-461647850 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-461647850 ~z$r_buff0_thd1~0_Out-461647850)) (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-461647850) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-461647850, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-461647850} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-461647850, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-461647850|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-461647850} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 19:44:49,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In319565252 256))) (.cse0 (= (mod ~z$r_buff1_thd1~0_In319565252 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In319565252 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In319565252 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out319565252| ~z$r_buff1_thd1~0_In319565252) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out319565252| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In319565252, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In319565252, ~z$w_buff1_used~0=~z$w_buff1_used~0_In319565252, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In319565252} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out319565252|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In319565252, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In319565252, ~z$w_buff1_used~0=~z$w_buff1_used~0_In319565252, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In319565252} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 19:44:49,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In834449670 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In834449670 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In834449670 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In834449670 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out834449670| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out834449670| ~z$w_buff1_used~0_In834449670)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In834449670, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In834449670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In834449670, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In834449670} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In834449670, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In834449670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In834449670, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out834449670|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In834449670} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 19:44:49,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1432752775 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1432752775 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out1432752775| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In1432752775 |P1Thread1of1ForFork2_#t~ite13_Out1432752775|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1432752775, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1432752775} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1432752775, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1432752775|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1432752775} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 19:44:49,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-132397107 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-132397107 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-132397107 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-132397107 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-132397107| ~z$r_buff1_thd2~0_In-132397107) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork2_#t~ite14_Out-132397107| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-132397107, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-132397107, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-132397107, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-132397107} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-132397107, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-132397107, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-132397107, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-132397107|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-132397107} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 19:44:49,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L777-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_16) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 19:44:49,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L754-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_14 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_14, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 19:44:49,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L801-->L801-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In33385265 256) 0))) (or (and (= ~z$w_buff1_used~0_In33385265 |P2Thread1of1ForFork0_#t~ite29_Out33385265|) (= |P2Thread1of1ForFork0_#t~ite30_Out33385265| |P2Thread1of1ForFork0_#t~ite29_Out33385265|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In33385265 256)))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In33385265 256))) (and (= 0 (mod ~z$r_buff1_thd3~0_In33385265 256)) .cse0) (= (mod ~z$w_buff0_used~0_In33385265 256) 0))) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite29_In33385265| |P2Thread1of1ForFork0_#t~ite29_Out33385265|) (= |P2Thread1of1ForFork0_#t~ite30_Out33385265| ~z$w_buff1_used~0_In33385265) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In33385265, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In33385265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In33385265, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In33385265, ~weak$$choice2~0=~weak$$choice2~0_In33385265, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In33385265|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In33385265, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In33385265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In33385265, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In33385265, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out33385265|, ~weak$$choice2~0=~weak$$choice2~0_In33385265, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out33385265|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 19:44:49,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L802-->L803: Formula: (and (= v_~z$r_buff0_thd3~0_51 v_~z$r_buff0_thd3~0_50) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_50, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 19:44:49,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L805-->L809: Formula: (and (= v_~z~0_21 v_~z$mem_tmp~0_5) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 19:44:49,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-2-->L809-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-545509178 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-545509178 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-545509178 |P2Thread1of1ForFork0_#t~ite38_Out-545509178|)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-545509178| ~z$w_buff1~0_In-545509178) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-545509178, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-545509178, ~z$w_buff1~0=~z$w_buff1~0_In-545509178, ~z~0=~z~0_In-545509178} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-545509178|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-545509178, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-545509178, ~z$w_buff1~0=~z$w_buff1~0_In-545509178, ~z~0=~z~0_In-545509178} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 19:44:49,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-4-->L810: Formula: (= v_~z~0_19 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|, ~z~0=v_~z~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-27 19:44:49,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1180033965 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1180033965 256)))) (or (and (= ~z$w_buff0_used~0_In1180033965 |P2Thread1of1ForFork0_#t~ite40_Out1180033965|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1180033965|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1180033965, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1180033965} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1180033965, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1180033965|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1180033965} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 19:44:49,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-523295045 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-523295045 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-523295045 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-523295045 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-523295045 |P2Thread1of1ForFork0_#t~ite41_Out-523295045|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-523295045|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-523295045, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-523295045, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-523295045, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-523295045} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-523295045, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-523295045, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-523295045, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-523295045, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-523295045|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 19:44:49,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In194695637 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In194695637 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out194695637| ~z$r_buff0_thd3~0_In194695637)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out194695637|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In194695637, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In194695637} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In194695637, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In194695637, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out194695637|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 19:44:49,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In711003256 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In711003256 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In711003256 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In711003256 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out711003256| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite43_Out711003256| ~z$r_buff1_thd3~0_In711003256) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In711003256, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In711003256, ~z$w_buff1_used~0=~z$w_buff1_used~0_In711003256, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In711003256} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out711003256|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In711003256, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In711003256, ~z$w_buff1_used~0=~z$w_buff1_used~0_In711003256, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In711003256} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 19:44:49,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 19:44:49,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 19:44:49,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L842-2-->L842-5: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In2066454990 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite47_Out2066454990| |ULTIMATE.start_main_#t~ite48_Out2066454990|)) (.cse1 (= (mod ~z$w_buff1_used~0_In2066454990 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite47_Out2066454990| ~z~0_In2066454990)) (and (= |ULTIMATE.start_main_#t~ite47_Out2066454990| ~z$w_buff1~0_In2066454990) (not .cse2) .cse0 (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2066454990, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2066454990, ~z$w_buff1~0=~z$w_buff1~0_In2066454990, ~z~0=~z~0_In2066454990} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2066454990, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2066454990|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2066454990, ~z$w_buff1~0=~z$w_buff1~0_In2066454990, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out2066454990|, ~z~0=~z~0_In2066454990} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 19:44:49,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1282287731 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1282287731 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1282287731| 0)) (and (= |ULTIMATE.start_main_#t~ite49_Out1282287731| ~z$w_buff0_used~0_In1282287731) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1282287731, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1282287731} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1282287731, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1282287731, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1282287731|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 19:44:49,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L844-->L844-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1711995762 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1711995762 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1711995762 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1711995762 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1711995762 |ULTIMATE.start_main_#t~ite50_Out-1711995762|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite50_Out-1711995762| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1711995762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1711995762, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1711995762, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1711995762} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1711995762|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1711995762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1711995762, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1711995762, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1711995762} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 19:44:49,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L845-->L845-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In409685324 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In409685324 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In409685324 |ULTIMATE.start_main_#t~ite51_Out409685324|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out409685324| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In409685324, ~z$w_buff0_used~0=~z$w_buff0_used~0_In409685324} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In409685324, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out409685324|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In409685324} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 19:44:49,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L846-->L846-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-174370015 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-174370015 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-174370015 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-174370015 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-174370015| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-174370015| ~z$r_buff1_thd0~0_In-174370015) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-174370015, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-174370015, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-174370015, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-174370015} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-174370015|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-174370015, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-174370015, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-174370015, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-174370015} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 19:44:49,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= 0 v_~__unbuffered_p0_EAX~0_10) (= |v_ULTIMATE.start_main_#t~ite52_12| v_~z$r_buff1_thd0~0_16) (= 0 v_~__unbuffered_p1_EBX~0_7)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 19:44:49,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:44:49 BasicIcfg [2019-12-27 19:44:49,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:44:49,324 INFO L168 Benchmark]: Toolchain (without parser) took 125713.59 ms. Allocated memory was 146.3 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 102.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 19:44:49,325 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 19:44:49,325 INFO L168 Benchmark]: CACSL2BoogieTranslator took 857.16 ms. Allocated memory was 146.3 MB in the beginning and 200.3 MB in the end (delta: 54.0 MB). Free memory was 102.2 MB in the beginning and 153.3 MB in the end (delta: -51.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 19:44:49,326 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.86 ms. Allocated memory is still 200.3 MB. Free memory was 153.3 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 19:44:49,326 INFO L168 Benchmark]: Boogie Preprocessor took 39.13 ms. Allocated memory is still 200.3 MB. Free memory was 150.8 MB in the beginning and 148.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 19:44:49,329 INFO L168 Benchmark]: RCFGBuilder took 809.12 ms. Allocated memory is still 200.3 MB. Free memory was 148.2 MB in the beginning and 97.5 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-27 19:44:49,329 INFO L168 Benchmark]: TraceAbstraction took 123945.17 ms. Allocated memory was 200.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 97.5 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-27 19:44:49,335 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 857.16 ms. Allocated memory was 146.3 MB in the beginning and 200.3 MB in the end (delta: 54.0 MB). Free memory was 102.2 MB in the beginning and 153.3 MB in the end (delta: -51.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.86 ms. Allocated memory is still 200.3 MB. Free memory was 153.3 MB in the beginning and 150.8 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.13 ms. Allocated memory is still 200.3 MB. Free memory was 150.8 MB in the beginning and 148.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 809.12 ms. Allocated memory is still 200.3 MB. Free memory was 148.2 MB in the beginning and 97.5 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 123945.17 ms. Allocated memory was 200.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 97.5 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: 3.8s, 178 ProgramPointsBefore, 95 ProgramPointsAfterwards, 215 TransitionsBefore, 106 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7190 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 85139 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t83, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$w_buff1 = z$w_buff0 [L736] 1 z$w_buff0 = 1 [L737] 1 z$w_buff1_used = z$w_buff0_used [L738] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t84, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = x [L770] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L773] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L836] FCALL, FORK 0 pthread_create(&t85, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 y = 1 [L790] 3 __unbuffered_p2_EAX = y [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L775] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L798] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 123.6s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 52.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5653 SDtfs, 7354 SDslu, 26564 SDs, 0 SdLazy, 28481 SolverSat, 603 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 554 GetRequests, 100 SyntacticMatches, 50 SemanticMatches, 404 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5239 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155734occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 39.6s AutomataMinimizationTime, 26 MinimizatonAttempts, 176060 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1020 NumberOfCodeBlocks, 1020 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 927 ConstructedInterpolants, 0 QuantifiedInterpolants, 243789 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...