/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/safe013_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:25:40,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:25:40,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:25:40,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:25:40,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:25:40,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:25:40,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:25:40,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:25:40,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:25:40,288 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:25:40,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:25:40,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:25:40,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:25:40,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:25:40,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:25:40,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:25:40,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:25:40,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:25:40,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:25:40,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:25:40,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:25:40,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:25:40,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:25:40,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:25:40,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:25:40,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:25:40,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:25:40,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:25:40,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:25:40,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:25:40,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:25:40,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:25:40,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:25:40,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:25:40,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:25:40,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:25:40,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:25:40,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:25:40,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:25:40,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:25:40,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:25:40,332 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 22:25:40,364 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:25:40,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:25:40,371 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:25:40,371 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:25:40,371 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:25:40,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:25:40,372 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:25:40,372 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:25:40,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:25:40,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:25:40,373 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:25:40,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:25:40,373 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:25:40,373 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:25:40,373 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:25:40,374 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:25:40,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:25:40,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:25:40,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:25:40,374 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:25:40,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:25:40,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:25:40,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:25:40,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:25:40,381 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:25:40,381 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:25:40,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:25:40,382 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:25:40,382 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:25:40,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:25:40,382 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:25:40,382 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:25:40,690 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:25:40,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:25:40,707 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:25:40,709 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:25:40,709 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:25:40,710 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_pso.oepc.i [2019-12-27 22:25:40,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f535922e/1c6e956eadac476782fdca9992fca2db/FLAG354d6fa70 [2019-12-27 22:25:41,319 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:25:41,320 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_pso.oepc.i [2019-12-27 22:25:41,335 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f535922e/1c6e956eadac476782fdca9992fca2db/FLAG354d6fa70 [2019-12-27 22:25:41,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f535922e/1c6e956eadac476782fdca9992fca2db [2019-12-27 22:25:41,620 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:25:41,622 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:25:41,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:25:41,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:25:41,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:25:41,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:25:41" (1/1) ... [2019-12-27 22:25:41,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@746c584f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:41, skipping insertion in model container [2019-12-27 22:25:41,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:25:41" (1/1) ... [2019-12-27 22:25:41,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:25:41,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:25:42,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:25:42,276 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:25:42,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:25:42,413 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:25:42,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:42 WrapperNode [2019-12-27 22:25:42,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:25:42,415 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:25:42,415 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:25:42,415 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:25:42,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:42" (1/1) ... [2019-12-27 22:25:42,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:42" (1/1) ... [2019-12-27 22:25:42,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:25:42,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:25:42,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:25:42,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:25:42,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:42" (1/1) ... [2019-12-27 22:25:42,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:42" (1/1) ... [2019-12-27 22:25:42,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:42" (1/1) ... [2019-12-27 22:25:42,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:42" (1/1) ... [2019-12-27 22:25:42,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:42" (1/1) ... [2019-12-27 22:25:42,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:42" (1/1) ... [2019-12-27 22:25:42,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:42" (1/1) ... [2019-12-27 22:25:42,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:25:42,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:25:42,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:25:42,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:25:42,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:42" (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 22:25:42,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:25:42,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:25:42,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:25:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:25:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:25:42,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:25:42,601 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:25:42,602 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:25:42,602 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:25:42,602 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:25:42,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:25:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:25:42,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:25:42,605 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 22:25:43,377 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:25:43,377 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:25:43,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:25:43 BoogieIcfgContainer [2019-12-27 22:25:43,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:25:43,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:25:43,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:25:43,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:25:43,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:25:41" (1/3) ... [2019-12-27 22:25:43,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3385e266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:25:43, skipping insertion in model container [2019-12-27 22:25:43,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:42" (2/3) ... [2019-12-27 22:25:43,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3385e266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:25:43, skipping insertion in model container [2019-12-27 22:25:43,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:25:43" (3/3) ... [2019-12-27 22:25:43,391 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_pso.oepc.i [2019-12-27 22:25:43,403 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:25:43,403 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:25:43,414 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:25:43,415 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:25:43,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,456 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,457 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,481 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,481 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,482 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,482 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,482 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,489 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,490 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,517 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,518 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,518 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,524 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,524 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,528 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,529 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:43,551 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:25:43,572 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:25:43,572 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:25:43,572 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:25:43,573 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:25:43,573 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:25:43,573 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:25:43,573 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:25:43,573 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:25:43,589 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 22:25:43,591 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 22:25:43,691 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 22:25:43,691 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:25:43,707 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:25:43,732 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 22:25:43,784 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 22:25:43,784 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:25:43,791 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:25:43,811 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 22:25:43,812 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:25:47,593 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 22:25:47,714 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 22:25:47,832 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68909 [2019-12-27 22:25:47,833 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 22:25:47,837 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 92 transitions [2019-12-27 22:26:00,369 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92280 states. [2019-12-27 22:26:00,371 INFO L276 IsEmpty]: Start isEmpty. Operand 92280 states. [2019-12-27 22:26:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:26:00,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:00,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:26:00,379 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:00,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:00,384 INFO L82 PathProgramCache]: Analyzing trace with hash 793714210, now seen corresponding path program 1 times [2019-12-27 22:26:00,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:00,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339413084] [2019-12-27 22:26:00,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:00,710 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 22:26:00,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339413084] [2019-12-27 22:26:00,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:00,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:26:00,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1070393971] [2019-12-27 22:26:00,714 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:00,718 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:00,732 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:26:00,732 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:00,736 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:26:00,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:26:00,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:00,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:26:00,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:26:00,754 INFO L87 Difference]: Start difference. First operand 92280 states. Second operand 3 states. [2019-12-27 22:26:03,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:03,557 INFO L93 Difference]: Finished difference Result 90395 states and 387830 transitions. [2019-12-27 22:26:03,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:26:03,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:26:03,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:04,113 INFO L225 Difference]: With dead ends: 90395 [2019-12-27 22:26:04,113 INFO L226 Difference]: Without dead ends: 85117 [2019-12-27 22:26:04,115 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 22:26:09,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85117 states. [2019-12-27 22:26:10,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85117 to 85117. [2019-12-27 22:26:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85117 states. [2019-12-27 22:26:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85117 states to 85117 states and 364674 transitions. [2019-12-27 22:26:14,797 INFO L78 Accepts]: Start accepts. Automaton has 85117 states and 364674 transitions. Word has length 5 [2019-12-27 22:26:14,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:14,797 INFO L462 AbstractCegarLoop]: Abstraction has 85117 states and 364674 transitions. [2019-12-27 22:26:14,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:26:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 85117 states and 364674 transitions. [2019-12-27 22:26:14,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:26:14,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:14,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:14,814 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:14,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:14,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1502291338, now seen corresponding path program 1 times [2019-12-27 22:26:14,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:14,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971791449] [2019-12-27 22:26:14,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:14,971 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 22:26:14,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971791449] [2019-12-27 22:26:14,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:14,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:26:14,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [297395868] [2019-12-27 22:26:14,974 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:14,975 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:14,979 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:26:14,979 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:14,980 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:26:14,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:26:14,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:14,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:26:14,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:26:14,982 INFO L87 Difference]: Start difference. First operand 85117 states and 364674 transitions. Second operand 4 states. [2019-12-27 22:26:15,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:15,918 INFO L93 Difference]: Finished difference Result 130038 states and 533020 transitions. [2019-12-27 22:26:15,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:26:15,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:26:15,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:17,352 INFO L225 Difference]: With dead ends: 130038 [2019-12-27 22:26:17,353 INFO L226 Difference]: Without dead ends: 129940 [2019-12-27 22:26:17,353 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 22:26:20,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129940 states. [2019-12-27 22:26:27,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129940 to 116665. [2019-12-27 22:26:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116665 states. [2019-12-27 22:26:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116665 states to 116665 states and 485676 transitions. [2019-12-27 22:26:28,222 INFO L78 Accepts]: Start accepts. Automaton has 116665 states and 485676 transitions. Word has length 13 [2019-12-27 22:26:28,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:28,223 INFO L462 AbstractCegarLoop]: Abstraction has 116665 states and 485676 transitions. [2019-12-27 22:26:28,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:26:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 116665 states and 485676 transitions. [2019-12-27 22:26:28,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:26:28,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:28,227 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:28,227 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:28,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:28,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1013715486, now seen corresponding path program 1 times [2019-12-27 22:26:28,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:28,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538734775] [2019-12-27 22:26:28,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:28,335 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 22:26:28,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538734775] [2019-12-27 22:26:28,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:28,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:26:28,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [563561924] [2019-12-27 22:26:28,337 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:28,338 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:28,340 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:26:28,340 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:28,340 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:26:28,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:26:28,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:28,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:26:28,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:26:28,341 INFO L87 Difference]: Start difference. First operand 116665 states and 485676 transitions. Second operand 4 states. [2019-12-27 22:26:30,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:30,187 INFO L93 Difference]: Finished difference Result 161841 states and 657746 transitions. [2019-12-27 22:26:30,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:26:30,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:26:30,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:30,770 INFO L225 Difference]: With dead ends: 161841 [2019-12-27 22:26:30,770 INFO L226 Difference]: Without dead ends: 161729 [2019-12-27 22:26:30,770 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 22:26:39,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161729 states. [2019-12-27 22:26:41,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161729 to 135524. [2019-12-27 22:26:41,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135524 states. [2019-12-27 22:26:41,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135524 states to 135524 states and 561455 transitions. [2019-12-27 22:26:41,908 INFO L78 Accepts]: Start accepts. Automaton has 135524 states and 561455 transitions. Word has length 13 [2019-12-27 22:26:41,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:41,908 INFO L462 AbstractCegarLoop]: Abstraction has 135524 states and 561455 transitions. [2019-12-27 22:26:41,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:26:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 135524 states and 561455 transitions. [2019-12-27 22:26:41,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:26:41,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:41,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:41,914 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:41,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:41,914 INFO L82 PathProgramCache]: Analyzing trace with hash -19781077, now seen corresponding path program 1 times [2019-12-27 22:26:41,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:41,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271284355] [2019-12-27 22:26:41,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:41,971 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 22:26:41,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271284355] [2019-12-27 22:26:41,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:41,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:26:41,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1276012144] [2019-12-27 22:26:41,976 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:41,978 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:41,982 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:26:41,982 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:42,050 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:26:42,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:26:42,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:42,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:26:42,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:26:42,052 INFO L87 Difference]: Start difference. First operand 135524 states and 561455 transitions. Second operand 5 states. [2019-12-27 22:26:44,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:44,186 INFO L93 Difference]: Finished difference Result 181948 states and 742402 transitions. [2019-12-27 22:26:44,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:26:44,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:26:44,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:44,766 INFO L225 Difference]: With dead ends: 181948 [2019-12-27 22:26:44,766 INFO L226 Difference]: Without dead ends: 181948 [2019-12-27 22:26:44,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 22:26:54,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181948 states. [2019-12-27 22:26:56,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181948 to 149024. [2019-12-27 22:26:56,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149024 states. [2019-12-27 22:26:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149024 states to 149024 states and 615188 transitions. [2019-12-27 22:26:57,397 INFO L78 Accepts]: Start accepts. Automaton has 149024 states and 615188 transitions. Word has length 14 [2019-12-27 22:26:57,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:57,397 INFO L462 AbstractCegarLoop]: Abstraction has 149024 states and 615188 transitions. [2019-12-27 22:26:57,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:26:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 149024 states and 615188 transitions. [2019-12-27 22:26:57,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:26:57,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:57,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:57,401 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:57,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:57,402 INFO L82 PathProgramCache]: Analyzing trace with hash -19914749, now seen corresponding path program 1 times [2019-12-27 22:26:57,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:57,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994565695] [2019-12-27 22:26:57,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:58,567 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 22:26:58,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994565695] [2019-12-27 22:26:58,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:58,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:26:58,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [908982608] [2019-12-27 22:26:58,569 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:58,571 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:58,574 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:26:58,574 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:58,613 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:26:58,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:26:58,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:58,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:26:58,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:26:58,614 INFO L87 Difference]: Start difference. First operand 149024 states and 615188 transitions. Second operand 5 states. [2019-12-27 22:26:59,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:59,844 INFO L93 Difference]: Finished difference Result 176806 states and 719392 transitions. [2019-12-27 22:26:59,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:26:59,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:26:59,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:00,440 INFO L225 Difference]: With dead ends: 176806 [2019-12-27 22:27:00,441 INFO L226 Difference]: Without dead ends: 176726 [2019-12-27 22:27:00,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:27:11,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176726 states. [2019-12-27 22:27:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176726 to 154481. [2019-12-27 22:27:14,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154481 states. [2019-12-27 22:27:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154481 states to 154481 states and 636822 transitions. [2019-12-27 22:27:15,421 INFO L78 Accepts]: Start accepts. Automaton has 154481 states and 636822 transitions. Word has length 14 [2019-12-27 22:27:15,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:15,421 INFO L462 AbstractCegarLoop]: Abstraction has 154481 states and 636822 transitions. [2019-12-27 22:27:15,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:27:15,422 INFO L276 IsEmpty]: Start isEmpty. Operand 154481 states and 636822 transitions. [2019-12-27 22:27:15,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:27:15,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:15,424 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:15,425 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:15,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:15,425 INFO L82 PathProgramCache]: Analyzing trace with hash 140256175, now seen corresponding path program 1 times [2019-12-27 22:27:15,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:15,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008355053] [2019-12-27 22:27:15,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:15,503 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 22:27:15,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008355053] [2019-12-27 22:27:15,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:15,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:27:15,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [36939123] [2019-12-27 22:27:15,505 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:15,508 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:15,513 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:27:15,513 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:15,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:27:15,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:27:15,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:15,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:27:15,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:27:15,545 INFO L87 Difference]: Start difference. First operand 154481 states and 636822 transitions. Second operand 5 states. [2019-12-27 22:27:21,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:21,917 INFO L93 Difference]: Finished difference Result 181899 states and 742115 transitions. [2019-12-27 22:27:21,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:27:21,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:27:21,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:22,458 INFO L225 Difference]: With dead ends: 181899 [2019-12-27 22:27:22,458 INFO L226 Difference]: Without dead ends: 181811 [2019-12-27 22:27:22,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:27:26,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181811 states. [2019-12-27 22:27:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181811 to 156231. [2019-12-27 22:27:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156231 states. [2019-12-27 22:27:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156231 states to 156231 states and 644534 transitions. [2019-12-27 22:27:30,491 INFO L78 Accepts]: Start accepts. Automaton has 156231 states and 644534 transitions. Word has length 14 [2019-12-27 22:27:30,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:30,491 INFO L462 AbstractCegarLoop]: Abstraction has 156231 states and 644534 transitions. [2019-12-27 22:27:30,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:27:30,491 INFO L276 IsEmpty]: Start isEmpty. Operand 156231 states and 644534 transitions. [2019-12-27 22:27:30,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 22:27:30,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:30,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:30,511 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:30,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:30,513 INFO L82 PathProgramCache]: Analyzing trace with hash -757674417, now seen corresponding path program 1 times [2019-12-27 22:27:30,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:30,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173140410] [2019-12-27 22:27:30,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:30,560 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 22:27:30,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173140410] [2019-12-27 22:27:30,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:30,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:27:30,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2013493265] [2019-12-27 22:27:30,563 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:30,565 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:30,568 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 22:27:30,568 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:30,569 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:27:30,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:27:30,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:30,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:27:30,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:27:30,570 INFO L87 Difference]: Start difference. First operand 156231 states and 644534 transitions. Second operand 3 states. [2019-12-27 22:27:31,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:31,378 INFO L93 Difference]: Finished difference Result 155313 states and 640741 transitions. [2019-12-27 22:27:31,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:27:31,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 22:27:31,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:38,033 INFO L225 Difference]: With dead ends: 155313 [2019-12-27 22:27:38,033 INFO L226 Difference]: Without dead ends: 155313 [2019-12-27 22:27:38,034 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 22:27:41,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155313 states. [2019-12-27 22:27:44,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155313 to 155313. [2019-12-27 22:27:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155313 states. [2019-12-27 22:27:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155313 states to 155313 states and 640741 transitions. [2019-12-27 22:27:44,799 INFO L78 Accepts]: Start accepts. Automaton has 155313 states and 640741 transitions. Word has length 18 [2019-12-27 22:27:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:44,799 INFO L462 AbstractCegarLoop]: Abstraction has 155313 states and 640741 transitions. [2019-12-27 22:27:44,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:27:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 155313 states and 640741 transitions. [2019-12-27 22:27:44,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:27:44,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:44,819 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:44,820 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:44,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:44,820 INFO L82 PathProgramCache]: Analyzing trace with hash -562123947, now seen corresponding path program 1 times [2019-12-27 22:27:44,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:44,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344616192] [2019-12-27 22:27:44,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:27:44,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344616192] [2019-12-27 22:27:44,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:44,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:27:44,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [621277585] [2019-12-27 22:27:44,909 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:44,911 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:44,915 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 50 transitions. [2019-12-27 22:27:44,915 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:44,925 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:27:44,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:27:44,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:44,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:27:44,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:27:44,926 INFO L87 Difference]: Start difference. First operand 155313 states and 640741 transitions. Second operand 5 states. [2019-12-27 22:27:51,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:51,706 INFO L93 Difference]: Finished difference Result 306320 states and 1277665 transitions. [2019-12-27 22:27:51,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:27:51,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 22:27:51,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:53,038 INFO L225 Difference]: With dead ends: 306320 [2019-12-27 22:27:53,038 INFO L226 Difference]: Without dead ends: 183766 [2019-12-27 22:27:53,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:28:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183766 states. [2019-12-27 22:28:03,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183766 to 120708. [2019-12-27 22:28:03,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120708 states. [2019-12-27 22:28:04,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120708 states to 120708 states and 492233 transitions. [2019-12-27 22:28:04,770 INFO L78 Accepts]: Start accepts. Automaton has 120708 states and 492233 transitions. Word has length 19 [2019-12-27 22:28:04,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:04,771 INFO L462 AbstractCegarLoop]: Abstraction has 120708 states and 492233 transitions. [2019-12-27 22:28:04,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:28:04,771 INFO L276 IsEmpty]: Start isEmpty. Operand 120708 states and 492233 transitions. [2019-12-27 22:28:04,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:28:04,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:04,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:28:04,785 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:04,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:04,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1224805741, now seen corresponding path program 1 times [2019-12-27 22:28:04,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:04,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032764134] [2019-12-27 22:28:04,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:04,858 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 22:28:04,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032764134] [2019-12-27 22:28:04,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:04,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:28:04,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1051961535] [2019-12-27 22:28:04,859 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:04,861 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:04,865 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 22:28:04,865 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:04,899 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:28:04,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:28:04,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:04,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:28:04,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:28:04,900 INFO L87 Difference]: Start difference. First operand 120708 states and 492233 transitions. Second operand 5 states. [2019-12-27 22:28:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:05,292 INFO L93 Difference]: Finished difference Result 37032 states and 127160 transitions. [2019-12-27 22:28:05,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:28:05,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 22:28:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:05,359 INFO L225 Difference]: With dead ends: 37032 [2019-12-27 22:28:05,359 INFO L226 Difference]: Without dead ends: 29472 [2019-12-27 22:28:05,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:28:05,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29472 states. [2019-12-27 22:28:05,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29472 to 27307. [2019-12-27 22:28:05,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27307 states. [2019-12-27 22:28:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27307 states to 27307 states and 90236 transitions. [2019-12-27 22:28:05,943 INFO L78 Accepts]: Start accepts. Automaton has 27307 states and 90236 transitions. Word has length 19 [2019-12-27 22:28:05,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:05,943 INFO L462 AbstractCegarLoop]: Abstraction has 27307 states and 90236 transitions. [2019-12-27 22:28:05,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:28:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 27307 states and 90236 transitions. [2019-12-27 22:28:05,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:28:05,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:05,949 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 22:28:05,949 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:05,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:05,950 INFO L82 PathProgramCache]: Analyzing trace with hash -108369065, now seen corresponding path program 1 times [2019-12-27 22:28:05,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:05,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112074562] [2019-12-27 22:28:05,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:06,043 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 22:28:06,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112074562] [2019-12-27 22:28:06,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:06,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:28:06,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [112433927] [2019-12-27 22:28:06,045 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:06,049 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:06,062 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 112 transitions. [2019-12-27 22:28:06,063 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:06,098 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:28:06,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:28:06,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:06,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:28:06,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:28:06,100 INFO L87 Difference]: Start difference. First operand 27307 states and 90236 transitions. Second operand 6 states. [2019-12-27 22:28:07,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:07,519 INFO L93 Difference]: Finished difference Result 36015 states and 116977 transitions. [2019-12-27 22:28:07,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 22:28:07,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:28:07,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:07,575 INFO L225 Difference]: With dead ends: 36015 [2019-12-27 22:28:07,575 INFO L226 Difference]: Without dead ends: 35713 [2019-12-27 22:28:07,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:28:07,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35713 states. [2019-12-27 22:28:08,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35713 to 28287. [2019-12-27 22:28:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28287 states. [2019-12-27 22:28:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28287 states to 28287 states and 93457 transitions. [2019-12-27 22:28:08,089 INFO L78 Accepts]: Start accepts. Automaton has 28287 states and 93457 transitions. Word has length 22 [2019-12-27 22:28:08,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:08,090 INFO L462 AbstractCegarLoop]: Abstraction has 28287 states and 93457 transitions. [2019-12-27 22:28:08,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:28:08,090 INFO L276 IsEmpty]: Start isEmpty. Operand 28287 states and 93457 transitions. [2019-12-27 22:28:08,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:28:08,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:08,096 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 22:28:08,096 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:08,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:08,096 INFO L82 PathProgramCache]: Analyzing trace with hash 576586499, now seen corresponding path program 1 times [2019-12-27 22:28:08,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:08,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386789926] [2019-12-27 22:28:08,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:08,191 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 22:28:08,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386789926] [2019-12-27 22:28:08,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:08,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:28:08,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1572439164] [2019-12-27 22:28:08,192 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:08,195 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:08,209 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 112 transitions. [2019-12-27 22:28:08,209 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:08,235 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:28:08,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:28:08,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:08,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:28:08,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:28:08,237 INFO L87 Difference]: Start difference. First operand 28287 states and 93457 transitions. Second operand 6 states. [2019-12-27 22:28:08,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:08,731 INFO L93 Difference]: Finished difference Result 36002 states and 117278 transitions. [2019-12-27 22:28:08,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 22:28:08,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:28:08,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:08,786 INFO L225 Difference]: With dead ends: 36002 [2019-12-27 22:28:08,787 INFO L226 Difference]: Without dead ends: 35602 [2019-12-27 22:28:08,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:28:08,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35602 states. [2019-12-27 22:28:10,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35602 to 27135. [2019-12-27 22:28:10,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27135 states. [2019-12-27 22:28:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27135 states to 27135 states and 89912 transitions. [2019-12-27 22:28:10,184 INFO L78 Accepts]: Start accepts. Automaton has 27135 states and 89912 transitions. Word has length 22 [2019-12-27 22:28:10,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:10,184 INFO L462 AbstractCegarLoop]: Abstraction has 27135 states and 89912 transitions. [2019-12-27 22:28:10,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:28:10,184 INFO L276 IsEmpty]: Start isEmpty. Operand 27135 states and 89912 transitions. [2019-12-27 22:28:10,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:28:10,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:10,193 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 22:28:10,193 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:10,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:10,193 INFO L82 PathProgramCache]: Analyzing trace with hash -589690530, now seen corresponding path program 1 times [2019-12-27 22:28:10,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:10,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389523816] [2019-12-27 22:28:10,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:10,263 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 22:28:10,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389523816] [2019-12-27 22:28:10,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:10,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:28:10,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [899921645] [2019-12-27 22:28:10,264 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:10,267 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:10,271 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:28:10,272 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:10,272 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:28:10,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:28:10,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:10,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:28:10,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:28:10,273 INFO L87 Difference]: Start difference. First operand 27135 states and 89912 transitions. Second operand 5 states. [2019-12-27 22:28:10,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:10,360 INFO L93 Difference]: Finished difference Result 12477 states and 38286 transitions. [2019-12-27 22:28:10,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:28:10,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 22:28:10,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:10,379 INFO L225 Difference]: With dead ends: 12477 [2019-12-27 22:28:10,379 INFO L226 Difference]: Without dead ends: 10644 [2019-12-27 22:28:10,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:28:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10644 states. [2019-12-27 22:28:10,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10644 to 10604. [2019-12-27 22:28:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10604 states. [2019-12-27 22:28:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10604 states to 10604 states and 32268 transitions. [2019-12-27 22:28:10,591 INFO L78 Accepts]: Start accepts. Automaton has 10604 states and 32268 transitions. Word has length 25 [2019-12-27 22:28:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:10,592 INFO L462 AbstractCegarLoop]: Abstraction has 10604 states and 32268 transitions. [2019-12-27 22:28:10,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:28:10,592 INFO L276 IsEmpty]: Start isEmpty. Operand 10604 states and 32268 transitions. [2019-12-27 22:28:10,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 22:28:10,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:10,606 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 22:28:10,607 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:10,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:10,607 INFO L82 PathProgramCache]: Analyzing trace with hash -112163197, now seen corresponding path program 1 times [2019-12-27 22:28:10,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:10,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304733624] [2019-12-27 22:28:10,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:10,655 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 22:28:10,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304733624] [2019-12-27 22:28:10,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:10,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:28:10,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [43043826] [2019-12-27 22:28:10,656 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:10,665 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:10,701 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 143 transitions. [2019-12-27 22:28:10,701 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:10,728 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:28:10,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:28:10,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:10,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:28:10,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:28:10,730 INFO L87 Difference]: Start difference. First operand 10604 states and 32268 transitions. Second operand 4 states. [2019-12-27 22:28:10,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:10,929 INFO L93 Difference]: Finished difference Result 20825 states and 63783 transitions. [2019-12-27 22:28:10,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:28:10,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 22:28:10,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:10,944 INFO L225 Difference]: With dead ends: 20825 [2019-12-27 22:28:10,944 INFO L226 Difference]: Without dead ends: 9973 [2019-12-27 22:28:10,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:28:10,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9973 states. [2019-12-27 22:28:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9973 to 6220. [2019-12-27 22:28:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2019-12-27 22:28:11,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 18997 transitions. [2019-12-27 22:28:11,072 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 18997 transitions. Word has length 39 [2019-12-27 22:28:11,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:11,072 INFO L462 AbstractCegarLoop]: Abstraction has 6220 states and 18997 transitions. [2019-12-27 22:28:11,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:28:11,072 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 18997 transitions. [2019-12-27 22:28:11,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:28:11,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:11,081 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 22:28:11,081 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:11,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:11,081 INFO L82 PathProgramCache]: Analyzing trace with hash -2009375071, now seen corresponding path program 1 times [2019-12-27 22:28:11,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:11,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222865041] [2019-12-27 22:28:11,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:11,171 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 22:28:11,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222865041] [2019-12-27 22:28:11,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:11,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:28:11,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1099223483] [2019-12-27 22:28:11,172 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:11,181 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:11,245 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 202 transitions. [2019-12-27 22:28:11,246 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:11,272 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:28:11,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:28:11,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:11,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:28:11,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:28:11,274 INFO L87 Difference]: Start difference. First operand 6220 states and 18997 transitions. Second operand 7 states. [2019-12-27 22:28:11,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:11,380 INFO L93 Difference]: Finished difference Result 5287 states and 16627 transitions. [2019-12-27 22:28:11,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:28:11,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 22:28:11,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:11,389 INFO L225 Difference]: With dead ends: 5287 [2019-12-27 22:28:11,389 INFO L226 Difference]: Without dead ends: 4788 [2019-12-27 22:28:11,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:28:11,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4788 states. [2019-12-27 22:28:11,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4788 to 4788. [2019-12-27 22:28:11,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4788 states. [2019-12-27 22:28:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4788 states to 4788 states and 15565 transitions. [2019-12-27 22:28:11,496 INFO L78 Accepts]: Start accepts. Automaton has 4788 states and 15565 transitions. Word has length 40 [2019-12-27 22:28:11,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:11,496 INFO L462 AbstractCegarLoop]: Abstraction has 4788 states and 15565 transitions. [2019-12-27 22:28:11,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:28:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 4788 states and 15565 transitions. [2019-12-27 22:28:11,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:28:11,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:11,506 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] [2019-12-27 22:28:11,506 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:11,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:11,507 INFO L82 PathProgramCache]: Analyzing trace with hash -26633300, now seen corresponding path program 1 times [2019-12-27 22:28:11,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:11,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644341512] [2019-12-27 22:28:11,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:11,587 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 22:28:11,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644341512] [2019-12-27 22:28:11,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:11,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:28:11,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1408250890] [2019-12-27 22:28:11,588 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:11,603 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:12,019 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 436 transitions. [2019-12-27 22:28:12,019 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:12,106 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:28:12,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:28:12,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:12,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:28:12,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:28:12,107 INFO L87 Difference]: Start difference. First operand 4788 states and 15565 transitions. Second operand 7 states. [2019-12-27 22:28:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:12,335 INFO L93 Difference]: Finished difference Result 9084 states and 28982 transitions. [2019-12-27 22:28:12,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 22:28:12,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 22:28:12,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:12,346 INFO L225 Difference]: With dead ends: 9084 [2019-12-27 22:28:12,346 INFO L226 Difference]: Without dead ends: 6576 [2019-12-27 22:28:12,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:28:12,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6576 states. [2019-12-27 22:28:12,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6576 to 5930. [2019-12-27 22:28:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5930 states. [2019-12-27 22:28:12,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5930 states to 5930 states and 19209 transitions. [2019-12-27 22:28:12,445 INFO L78 Accepts]: Start accepts. Automaton has 5930 states and 19209 transitions. Word has length 54 [2019-12-27 22:28:12,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:12,445 INFO L462 AbstractCegarLoop]: Abstraction has 5930 states and 19209 transitions. [2019-12-27 22:28:12,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:28:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 5930 states and 19209 transitions. [2019-12-27 22:28:12,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:28:12,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:12,455 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] [2019-12-27 22:28:12,455 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:12,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:12,455 INFO L82 PathProgramCache]: Analyzing trace with hash 219895980, now seen corresponding path program 2 times [2019-12-27 22:28:12,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:12,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045296063] [2019-12-27 22:28:12,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:12,543 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 22:28:12,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045296063] [2019-12-27 22:28:12,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:12,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:28:12,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1107357884] [2019-12-27 22:28:12,544 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:12,560 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:12,797 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 309 states and 637 transitions. [2019-12-27 22:28:12,797 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:12,863 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:28:12,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:28:12,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:12,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:28:12,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:28:12,865 INFO L87 Difference]: Start difference. First operand 5930 states and 19209 transitions. Second operand 8 states. [2019-12-27 22:28:13,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:13,984 INFO L93 Difference]: Finished difference Result 13352 states and 42359 transitions. [2019-12-27 22:28:13,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 22:28:13,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 22:28:13,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:14,001 INFO L225 Difference]: With dead ends: 13352 [2019-12-27 22:28:14,001 INFO L226 Difference]: Without dead ends: 10146 [2019-12-27 22:28:14,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2019-12-27 22:28:14,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10146 states. [2019-12-27 22:28:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10146 to 7238. [2019-12-27 22:28:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7238 states. [2019-12-27 22:28:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7238 states to 7238 states and 23230 transitions. [2019-12-27 22:28:14,127 INFO L78 Accepts]: Start accepts. Automaton has 7238 states and 23230 transitions. Word has length 54 [2019-12-27 22:28:14,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:14,128 INFO L462 AbstractCegarLoop]: Abstraction has 7238 states and 23230 transitions. [2019-12-27 22:28:14,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:28:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 7238 states and 23230 transitions. [2019-12-27 22:28:14,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:28:14,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:14,137 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] [2019-12-27 22:28:14,137 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:14,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:14,137 INFO L82 PathProgramCache]: Analyzing trace with hash 625959458, now seen corresponding path program 3 times [2019-12-27 22:28:14,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:14,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402221157] [2019-12-27 22:28:14,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:14,242 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 22:28:14,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402221157] [2019-12-27 22:28:14,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:14,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:28:14,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [626070299] [2019-12-27 22:28:14,243 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:14,258 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:14,740 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 296 states and 614 transitions. [2019-12-27 22:28:14,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:14,973 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 22:28:14,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:28:14,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:14,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:28:14,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:28:14,975 INFO L87 Difference]: Start difference. First operand 7238 states and 23230 transitions. Second operand 10 states. [2019-12-27 22:28:16,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:16,692 INFO L93 Difference]: Finished difference Result 30335 states and 93023 transitions. [2019-12-27 22:28:16,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 22:28:16,693 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 22:28:16,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:16,736 INFO L225 Difference]: With dead ends: 30335 [2019-12-27 22:28:16,737 INFO L226 Difference]: Without dead ends: 24335 [2019-12-27 22:28:16,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 16 SyntacticMatches, 12 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=541, Invalid=1715, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 22:28:16,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24335 states. [2019-12-27 22:28:16,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24335 to 9222. [2019-12-27 22:28:16,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9222 states. [2019-12-27 22:28:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9222 states to 9222 states and 29627 transitions. [2019-12-27 22:28:17,008 INFO L78 Accepts]: Start accepts. Automaton has 9222 states and 29627 transitions. Word has length 54 [2019-12-27 22:28:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:17,009 INFO L462 AbstractCegarLoop]: Abstraction has 9222 states and 29627 transitions. [2019-12-27 22:28:17,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:28:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 9222 states and 29627 transitions. [2019-12-27 22:28:17,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:28:17,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:17,025 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] [2019-12-27 22:28:17,025 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:17,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:17,026 INFO L82 PathProgramCache]: Analyzing trace with hash 644386982, now seen corresponding path program 4 times [2019-12-27 22:28:17,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:17,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197242381] [2019-12-27 22:28:17,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:17,128 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 22:28:17,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197242381] [2019-12-27 22:28:17,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:17,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:28:17,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1521581871] [2019-12-27 22:28:17,131 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:17,166 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:17,714 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 413 transitions. [2019-12-27 22:28:17,714 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:17,833 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 22:28:17,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:28:17,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:17,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:28:17,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:28:17,834 INFO L87 Difference]: Start difference. First operand 9222 states and 29627 transitions. Second operand 10 states. [2019-12-27 22:28:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:21,050 INFO L93 Difference]: Finished difference Result 42171 states and 128807 transitions. [2019-12-27 22:28:21,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 22:28:21,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 22:28:21,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:21,113 INFO L225 Difference]: With dead ends: 42171 [2019-12-27 22:28:21,113 INFO L226 Difference]: Without dead ends: 42087 [2019-12-27 22:28:21,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=309, Invalid=1023, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 22:28:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42087 states. [2019-12-27 22:28:21,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42087 to 16423. [2019-12-27 22:28:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16423 states. [2019-12-27 22:28:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16423 states to 16423 states and 51766 transitions. [2019-12-27 22:28:21,594 INFO L78 Accepts]: Start accepts. Automaton has 16423 states and 51766 transitions. Word has length 54 [2019-12-27 22:28:21,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:21,594 INFO L462 AbstractCegarLoop]: Abstraction has 16423 states and 51766 transitions. [2019-12-27 22:28:21,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:28:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 16423 states and 51766 transitions. [2019-12-27 22:28:21,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:28:21,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:21,613 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] [2019-12-27 22:28:21,613 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:21,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:21,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1158703824, now seen corresponding path program 5 times [2019-12-27 22:28:21,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:21,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995999072] [2019-12-27 22:28:21,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:21,705 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 22:28:21,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995999072] [2019-12-27 22:28:21,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:21,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:28:21,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1848193774] [2019-12-27 22:28:21,706 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:21,722 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:22,211 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 234 states and 418 transitions. [2019-12-27 22:28:22,212 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:22,247 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:28:22,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:28:22,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:22,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:28:22,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:28:22,248 INFO L87 Difference]: Start difference. First operand 16423 states and 51766 transitions. Second operand 7 states. [2019-12-27 22:28:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:23,235 INFO L93 Difference]: Finished difference Result 28625 states and 87831 transitions. [2019-12-27 22:28:23,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 22:28:23,237 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 22:28:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:23,278 INFO L225 Difference]: With dead ends: 28625 [2019-12-27 22:28:23,278 INFO L226 Difference]: Without dead ends: 28515 [2019-12-27 22:28:23,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:28:23,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28515 states. [2019-12-27 22:28:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28515 to 20157. [2019-12-27 22:28:23,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20157 states. [2019-12-27 22:28:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20157 states to 20157 states and 63053 transitions. [2019-12-27 22:28:23,640 INFO L78 Accepts]: Start accepts. Automaton has 20157 states and 63053 transitions. Word has length 54 [2019-12-27 22:28:23,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:23,640 INFO L462 AbstractCegarLoop]: Abstraction has 20157 states and 63053 transitions. [2019-12-27 22:28:23,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:28:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 20157 states and 63053 transitions. [2019-12-27 22:28:23,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:28:23,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:23,669 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] [2019-12-27 22:28:23,669 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:23,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:23,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1984492944, now seen corresponding path program 6 times [2019-12-27 22:28:23,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:23,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918359383] [2019-12-27 22:28:23,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:23,733 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 22:28:23,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918359383] [2019-12-27 22:28:23,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:23,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:28:23,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1059974810] [2019-12-27 22:28:23,734 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:23,749 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:23,969 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 442 transitions. [2019-12-27 22:28:23,969 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:23,980 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:28:23,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:28:23,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:23,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:28:23,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:28:23,982 INFO L87 Difference]: Start difference. First operand 20157 states and 63053 transitions. Second operand 4 states. [2019-12-27 22:28:24,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:24,312 INFO L93 Difference]: Finished difference Result 19352 states and 59497 transitions. [2019-12-27 22:28:24,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:28:24,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 22:28:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:24,348 INFO L225 Difference]: With dead ends: 19352 [2019-12-27 22:28:24,348 INFO L226 Difference]: Without dead ends: 19352 [2019-12-27 22:28:24,349 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 22:28:24,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19352 states. [2019-12-27 22:28:24,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19352 to 14649. [2019-12-27 22:28:24,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14649 states. [2019-12-27 22:28:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14649 states to 14649 states and 45419 transitions. [2019-12-27 22:28:25,007 INFO L78 Accepts]: Start accepts. Automaton has 14649 states and 45419 transitions. Word has length 54 [2019-12-27 22:28:25,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:25,008 INFO L462 AbstractCegarLoop]: Abstraction has 14649 states and 45419 transitions. [2019-12-27 22:28:25,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:28:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 14649 states and 45419 transitions. [2019-12-27 22:28:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:28:25,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:25,029 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] [2019-12-27 22:28:25,029 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:25,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:25,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1496178910, now seen corresponding path program 1 times [2019-12-27 22:28:25,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:25,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843214257] [2019-12-27 22:28:25,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:25,481 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 22:28:25,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843214257] [2019-12-27 22:28:25,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:25,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 22:28:25,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [866959088] [2019-12-27 22:28:25,482 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:25,494 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:25,628 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 425 transitions. [2019-12-27 22:28:25,628 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:25,828 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 22:28:25,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 22:28:25,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:25,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 22:28:25,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-27 22:28:25,829 INFO L87 Difference]: Start difference. First operand 14649 states and 45419 transitions. Second operand 16 states. [2019-12-27 22:28:29,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:29,028 INFO L93 Difference]: Finished difference Result 22356 states and 67983 transitions. [2019-12-27 22:28:29,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 22:28:29,029 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-27 22:28:29,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:29,056 INFO L225 Difference]: With dead ends: 22356 [2019-12-27 22:28:29,056 INFO L226 Difference]: Without dead ends: 18862 [2019-12-27 22:28:29,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 9 SyntacticMatches, 12 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=534, Invalid=2772, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 22:28:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18862 states. [2019-12-27 22:28:29,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18862 to 15175. [2019-12-27 22:28:29,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15175 states. [2019-12-27 22:28:29,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15175 states to 15175 states and 46808 transitions. [2019-12-27 22:28:29,620 INFO L78 Accepts]: Start accepts. Automaton has 15175 states and 46808 transitions. Word has length 55 [2019-12-27 22:28:29,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:29,620 INFO L462 AbstractCegarLoop]: Abstraction has 15175 states and 46808 transitions. [2019-12-27 22:28:29,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 22:28:29,621 INFO L276 IsEmpty]: Start isEmpty. Operand 15175 states and 46808 transitions. [2019-12-27 22:28:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:28:29,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:29,638 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] [2019-12-27 22:28:29,638 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:29,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:29,639 INFO L82 PathProgramCache]: Analyzing trace with hash 684333320, now seen corresponding path program 2 times [2019-12-27 22:28:29,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:29,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134250281] [2019-12-27 22:28:29,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:30,081 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 22:28:30,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134250281] [2019-12-27 22:28:30,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:30,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 22:28:30,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [3950896] [2019-12-27 22:28:30,082 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:30,094 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:30,262 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 193 states and 359 transitions. [2019-12-27 22:28:30,262 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:30,484 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 22:28:30,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 22:28:30,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:30,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 22:28:30,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:28:30,486 INFO L87 Difference]: Start difference. First operand 15175 states and 46808 transitions. Second operand 17 states. [2019-12-27 22:28:36,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:36,622 INFO L93 Difference]: Finished difference Result 26396 states and 78915 transitions. [2019-12-27 22:28:36,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-12-27 22:28:36,622 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-12-27 22:28:36,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:36,660 INFO L225 Difference]: With dead ends: 26396 [2019-12-27 22:28:36,661 INFO L226 Difference]: Without dead ends: 22570 [2019-12-27 22:28:36,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 13 SyntacticMatches, 14 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4656 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1682, Invalid=10974, Unknown=0, NotChecked=0, Total=12656 [2019-12-27 22:28:36,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22570 states. [2019-12-27 22:28:36,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22570 to 15295. [2019-12-27 22:28:36,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15295 states. [2019-12-27 22:28:36,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15295 states to 15295 states and 47136 transitions. [2019-12-27 22:28:36,947 INFO L78 Accepts]: Start accepts. Automaton has 15295 states and 47136 transitions. Word has length 55 [2019-12-27 22:28:36,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:36,947 INFO L462 AbstractCegarLoop]: Abstraction has 15295 states and 47136 transitions. [2019-12-27 22:28:36,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 22:28:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 15295 states and 47136 transitions. [2019-12-27 22:28:36,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:28:36,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:36,963 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] [2019-12-27 22:28:36,963 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:36,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:36,963 INFO L82 PathProgramCache]: Analyzing trace with hash -157173428, now seen corresponding path program 3 times [2019-12-27 22:28:36,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:36,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104547697] [2019-12-27 22:28:36,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:37,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 22:28:37,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104547697] [2019-12-27 22:28:37,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:37,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:28:37,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [854903337] [2019-12-27 22:28:37,041 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:37,053 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:37,215 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 260 states and 529 transitions. [2019-12-27 22:28:37,215 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:37,302 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:28:37,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:28:37,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:37,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:28:37,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:28:37,303 INFO L87 Difference]: Start difference. First operand 15295 states and 47136 transitions. Second operand 9 states. [2019-12-27 22:28:40,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:40,348 INFO L93 Difference]: Finished difference Result 38809 states and 116424 transitions. [2019-12-27 22:28:40,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 22:28:40,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 22:28:40,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:40,402 INFO L225 Difference]: With dead ends: 38809 [2019-12-27 22:28:40,403 INFO L226 Difference]: Without dead ends: 38701 [2019-12-27 22:28:40,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=680, Unknown=0, NotChecked=0, Total=870 [2019-12-27 22:28:40,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38701 states. [2019-12-27 22:28:40,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38701 to 17178. [2019-12-27 22:28:40,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17178 states. [2019-12-27 22:28:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17178 states to 17178 states and 52885 transitions. [2019-12-27 22:28:40,807 INFO L78 Accepts]: Start accepts. Automaton has 17178 states and 52885 transitions. Word has length 55 [2019-12-27 22:28:40,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:40,808 INFO L462 AbstractCegarLoop]: Abstraction has 17178 states and 52885 transitions. [2019-12-27 22:28:40,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:28:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 17178 states and 52885 transitions. [2019-12-27 22:28:40,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:28:40,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:40,825 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] [2019-12-27 22:28:40,825 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:40,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:40,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1284697888, now seen corresponding path program 1 times [2019-12-27 22:28:40,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:40,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324183255] [2019-12-27 22:28:40,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:40,867 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 22:28:40,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324183255] [2019-12-27 22:28:40,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:40,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:28:40,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1168728902] [2019-12-27 22:28:40,868 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:40,883 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:41,118 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 260 states and 529 transitions. [2019-12-27 22:28:41,118 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:41,126 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:28:41,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:28:41,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:41,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:28:41,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:28:41,128 INFO L87 Difference]: Start difference. First operand 17178 states and 52885 transitions. Second operand 3 states. [2019-12-27 22:28:41,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:41,204 INFO L93 Difference]: Finished difference Result 18203 states and 54578 transitions. [2019-12-27 22:28:41,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:28:41,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 22:28:41,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:41,227 INFO L225 Difference]: With dead ends: 18203 [2019-12-27 22:28:41,227 INFO L226 Difference]: Without dead ends: 18203 [2019-12-27 22:28:41,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 3 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 22:28:41,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18203 states. [2019-12-27 22:28:41,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18203 to 11407. [2019-12-27 22:28:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11407 states. [2019-12-27 22:28:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11407 states to 11407 states and 33692 transitions. [2019-12-27 22:28:41,438 INFO L78 Accepts]: Start accepts. Automaton has 11407 states and 33692 transitions. Word has length 55 [2019-12-27 22:28:41,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:41,439 INFO L462 AbstractCegarLoop]: Abstraction has 11407 states and 33692 transitions. [2019-12-27 22:28:41,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:28:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 11407 states and 33692 transitions. [2019-12-27 22:28:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:28:41,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:41,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:28:41,451 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:41,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:41,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1146608012, now seen corresponding path program 4 times [2019-12-27 22:28:41,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:41,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426882156] [2019-12-27 22:28:41,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:41,605 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 22:28:41,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426882156] [2019-12-27 22:28:41,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:41,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:28:41,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [542956822] [2019-12-27 22:28:41,607 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:41,621 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:42,035 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 169 states and 304 transitions. [2019-12-27 22:28:42,036 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:42,101 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:28:42,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:28:42,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:42,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:28:42,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:28:42,102 INFO L87 Difference]: Start difference. First operand 11407 states and 33692 transitions. Second operand 9 states. [2019-12-27 22:28:42,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:42,893 INFO L93 Difference]: Finished difference Result 18657 states and 54513 transitions. [2019-12-27 22:28:42,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 22:28:42,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 22:28:42,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:42,911 INFO L225 Difference]: With dead ends: 18657 [2019-12-27 22:28:42,911 INFO L226 Difference]: Without dead ends: 12980 [2019-12-27 22:28:42,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-27 22:28:42,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12980 states. [2019-12-27 22:28:43,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12980 to 11626. [2019-12-27 22:28:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11626 states. [2019-12-27 22:28:43,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11626 states to 11626 states and 33923 transitions. [2019-12-27 22:28:43,100 INFO L78 Accepts]: Start accepts. Automaton has 11626 states and 33923 transitions. Word has length 55 [2019-12-27 22:28:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:43,100 INFO L462 AbstractCegarLoop]: Abstraction has 11626 states and 33923 transitions. [2019-12-27 22:28:43,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:28:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 11626 states and 33923 transitions. [2019-12-27 22:28:43,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:28:43,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:43,113 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] [2019-12-27 22:28:43,113 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:43,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:43,113 INFO L82 PathProgramCache]: Analyzing trace with hash -521745152, now seen corresponding path program 5 times [2019-12-27 22:28:43,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:43,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035754948] [2019-12-27 22:28:43,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:43,518 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 22:28:43,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035754948] [2019-12-27 22:28:43,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:43,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 22:28:43,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [420204334] [2019-12-27 22:28:43,519 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:43,531 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:43,718 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 351 transitions. [2019-12-27 22:28:43,718 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:44,189 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 22:28:44,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 22:28:44,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:44,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 22:28:44,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-12-27 22:28:44,190 INFO L87 Difference]: Start difference. First operand 11626 states and 33923 transitions. Second operand 22 states. [2019-12-27 22:28:50,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:50,192 INFO L93 Difference]: Finished difference Result 25218 states and 72637 transitions. [2019-12-27 22:28:50,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-27 22:28:50,193 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 55 [2019-12-27 22:28:50,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:50,224 INFO L225 Difference]: With dead ends: 25218 [2019-12-27 22:28:50,224 INFO L226 Difference]: Without dead ends: 23416 [2019-12-27 22:28:50,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 7 SyntacticMatches, 9 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1884 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=812, Invalid=5508, Unknown=0, NotChecked=0, Total=6320 [2019-12-27 22:28:50,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23416 states. [2019-12-27 22:28:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23416 to 11766. [2019-12-27 22:28:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11766 states. [2019-12-27 22:28:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11766 states to 11766 states and 34244 transitions. [2019-12-27 22:28:50,468 INFO L78 Accepts]: Start accepts. Automaton has 11766 states and 34244 transitions. Word has length 55 [2019-12-27 22:28:50,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:50,469 INFO L462 AbstractCegarLoop]: Abstraction has 11766 states and 34244 transitions. [2019-12-27 22:28:50,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 22:28:50,469 INFO L276 IsEmpty]: Start isEmpty. Operand 11766 states and 34244 transitions. [2019-12-27 22:28:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:28:50,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:50,481 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] [2019-12-27 22:28:50,481 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:50,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:50,482 INFO L82 PathProgramCache]: Analyzing trace with hash 711089790, now seen corresponding path program 6 times [2019-12-27 22:28:50,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:50,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109743626] [2019-12-27 22:28:50,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:50,635 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 22:28:50,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109743626] [2019-12-27 22:28:50,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:50,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:28:50,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2127841135] [2019-12-27 22:28:50,636 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:50,646 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:50,807 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 407 transitions. [2019-12-27 22:28:50,807 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:51,055 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 22:28:51,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:28:51,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:51,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:28:51,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:28:51,056 INFO L87 Difference]: Start difference. First operand 11766 states and 34244 transitions. Second operand 15 states. [2019-12-27 22:28:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:55,172 INFO L93 Difference]: Finished difference Result 27804 states and 80969 transitions. [2019-12-27 22:28:55,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 22:28:55,172 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-27 22:28:55,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:55,199 INFO L225 Difference]: With dead ends: 27804 [2019-12-27 22:28:55,199 INFO L226 Difference]: Without dead ends: 19876 [2019-12-27 22:28:55,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=662, Invalid=3370, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 22:28:55,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19876 states. [2019-12-27 22:28:55,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19876 to 12368. [2019-12-27 22:28:55,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12368 states. [2019-12-27 22:28:55,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12368 states to 12368 states and 36504 transitions. [2019-12-27 22:28:55,441 INFO L78 Accepts]: Start accepts. Automaton has 12368 states and 36504 transitions. Word has length 55 [2019-12-27 22:28:55,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:55,442 INFO L462 AbstractCegarLoop]: Abstraction has 12368 states and 36504 transitions. [2019-12-27 22:28:55,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:28:55,442 INFO L276 IsEmpty]: Start isEmpty. Operand 12368 states and 36504 transitions. [2019-12-27 22:28:55,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:28:55,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:55,455 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] [2019-12-27 22:28:55,455 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:55,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:55,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1031259352, now seen corresponding path program 7 times [2019-12-27 22:28:55,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:55,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812633692] [2019-12-27 22:28:55,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:55,513 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 22:28:55,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812633692] [2019-12-27 22:28:55,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:55,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:28:55,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [129059010] [2019-12-27 22:28:55,514 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:55,524 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:55,643 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 330 transitions. [2019-12-27 22:28:55,643 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:55,644 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:28:55,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:28:55,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:55,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:28:55,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:28:55,645 INFO L87 Difference]: Start difference. First operand 12368 states and 36504 transitions. Second operand 3 states. [2019-12-27 22:28:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:55,684 INFO L93 Difference]: Finished difference Result 12366 states and 36499 transitions. [2019-12-27 22:28:55,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:28:55,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 22:28:55,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:55,702 INFO L225 Difference]: With dead ends: 12366 [2019-12-27 22:28:55,702 INFO L226 Difference]: Without dead ends: 12366 [2019-12-27 22:28:55,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:28:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12366 states. [2019-12-27 22:28:55,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12366 to 10412. [2019-12-27 22:28:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10412 states. [2019-12-27 22:28:55,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10412 states to 10412 states and 31088 transitions. [2019-12-27 22:28:55,869 INFO L78 Accepts]: Start accepts. Automaton has 10412 states and 31088 transitions. Word has length 55 [2019-12-27 22:28:55,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:55,869 INFO L462 AbstractCegarLoop]: Abstraction has 10412 states and 31088 transitions. [2019-12-27 22:28:55,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:28:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 10412 states and 31088 transitions. [2019-12-27 22:28:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:28:55,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:55,881 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] [2019-12-27 22:28:55,881 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:55,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:55,881 INFO L82 PathProgramCache]: Analyzing trace with hash 639764934, now seen corresponding path program 1 times [2019-12-27 22:28:55,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:55,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479639351] [2019-12-27 22:28:55,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:28:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:28:56,005 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:28:56,006 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:28:56,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_58| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_13) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~x$w_buff1~0_26) (= 0 v_~x$r_buff0_thd0~0_22) (= v_~z~0_14 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~weak$$choice2~0_34) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2079~0.base_22|) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2079~0.base_22| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2079~0.base_22|) |v_ULTIMATE.start_main_~#t2079~0.offset_18| 0))) (= v_~x$r_buff1_thd0~0_21 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_cnt~0_19) (= 0 v_~weak$$choice0~0_7) (= 0 v_~__unbuffered_p2_EAX~0_13) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd2~0_19 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2079~0.base_22|) 0) (= 0 v_~x$r_buff0_thd3~0_20) (= v_~x$flush_delayed~0_12 0) (= |v_#valid_56| (store .cse0 |v_ULTIMATE.start_main_~#t2079~0.base_22| 1)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2079~0.base_22| 4) |v_#length_23|) (= |v_#NULL.offset_4| 0) (= v_~x~0_22 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd1~0_70) (= 0 v_~x$w_buff0~0_31) (= v_~main$tmp_guard1~0_13 0) (= |v_ULTIMATE.start_main_~#t2079~0.offset_18| 0) (= 0 v_~x$w_buff0_used~0_112) (= v_~x$w_buff1_used~0_68 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_31, ULTIMATE.start_main_~#t2081~0.base=|v_ULTIMATE.start_main_~#t2081~0.base_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t2081~0.offset=|v_ULTIMATE.start_main_~#t2081~0.offset_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ULTIMATE.start_main_~#t2079~0.offset=|v_ULTIMATE.start_main_~#t2079~0.offset_18|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_26, ULTIMATE.start_main_~#t2080~0.base=|v_ULTIMATE.start_main_~#t2080~0.base_23|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_68, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_70, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_20|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t2079~0.base=|v_ULTIMATE.start_main_~#t2079~0.base_22|, ~y~0=v_~y~0_9, ULTIMATE.start_main_~#t2080~0.offset=|v_ULTIMATE.start_main_~#t2080~0.offset_18|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_21, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2081~0.base, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ULTIMATE.start_main_~#t2081~0.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2079~0.offset, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2079~0.base, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t2080~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_~#t2080~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 22:28:56,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2080~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2080~0.base_10|) |v_ULTIMATE.start_main_~#t2080~0.offset_9| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2080~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t2080~0.base_10|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2080~0.base_10| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2080~0.base_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2080~0.base_10| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t2080~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2080~0.base=|v_ULTIMATE.start_main_~#t2080~0.base_10|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2080~0.offset=|v_ULTIMATE.start_main_~#t2080~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2080~0.base, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2080~0.offset] because there is no mapped edge [2019-12-27 22:28:56,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= 1 v_~x$w_buff0~0_14) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= v_~x$w_buff1_used~0_41 v_~x$w_buff0_used~0_70) (= 1 v_~x$w_buff0_used~0_69) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= v_~x$w_buff0~0_15 v_~x$w_buff1~0_14) (= (mod v_~x$w_buff1_used~0_41 256) 0) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_14, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~x$w_buff1~0=v_~x$w_buff1~0_14, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 22:28:56,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2081~0.base_11| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2081~0.base_11|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2081~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2081~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2081~0.base_11|) |v_ULTIMATE.start_main_~#t2081~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2081~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2081~0.base_11|) (= |v_ULTIMATE.start_main_~#t2081~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2081~0.base=|v_ULTIMATE.start_main_~#t2081~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2081~0.offset=|v_ULTIMATE.start_main_~#t2081~0.offset_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2081~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2081~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 22:28:56,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1361627777 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1361627777 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1361627777 |P2Thread1of1ForFork1_#t~ite32_Out-1361627777|) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-1361627777| ~x~0_In-1361627777)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1361627777, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1361627777, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1361627777, ~x~0=~x~0_In-1361627777} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1361627777|, ~x$w_buff1~0=~x$w_buff1~0_In-1361627777, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1361627777, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1361627777, ~x~0=~x~0_In-1361627777} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 22:28:56,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_14 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 22:28:56,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1894754137 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1894754137 256)))) (or (and (= ~x$w_buff0_used~0_In-1894754137 |P2Thread1of1ForFork1_#t~ite34_Out-1894754137|) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-1894754137| 0) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1894754137, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1894754137} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1894754137|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1894754137, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1894754137} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 22:28:56,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1753957000 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1753957000 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1753957000| ~x$w_buff0_used~0_In-1753957000) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1753957000|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1753957000, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1753957000} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1753957000, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1753957000|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1753957000} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 22:28:56,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1865766546 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1865766546 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1865766546 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1865766546 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out1865766546| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out1865766546| ~x$w_buff1_used~0_In1865766546) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1865766546, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1865766546, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1865766546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1865766546} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1865766546, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1865766546, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1865766546, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1865766546|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1865766546} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 22:28:56,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1573347570 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1573347570 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out1573347570 0)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In1573347570 ~x$r_buff0_thd2~0_Out1573347570)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1573347570, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1573347570} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1573347570|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1573347570, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1573347570} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 22:28:56,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1614983613 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1614983613 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1614983613 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1614983613 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out1614983613| ~x$r_buff1_thd2~0_In1614983613) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite31_Out1614983613| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1614983613, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1614983613, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1614983613, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1614983613} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1614983613|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1614983613, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1614983613, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1614983613, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1614983613} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 22:28:56,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork0_#t~ite31_8|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 22:28:56,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1875104864 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite9_Out-1875104864| ~x$w_buff0~0_In-1875104864) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite8_In-1875104864| |P0Thread1of1ForFork2_#t~ite8_Out-1875104864|)) (and (= |P0Thread1of1ForFork2_#t~ite9_Out-1875104864| |P0Thread1of1ForFork2_#t~ite8_Out-1875104864|) .cse0 (= ~x$w_buff0~0_In-1875104864 |P0Thread1of1ForFork2_#t~ite8_Out-1875104864|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1875104864 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In-1875104864 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-1875104864 256)) (and (= (mod ~x$r_buff1_thd1~0_In-1875104864 256) 0) .cse1)))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1875104864, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1875104864, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-1875104864|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1875104864, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1875104864, ~weak$$choice2~0=~weak$$choice2~0_In-1875104864, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1875104864} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1875104864, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1875104864, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1875104864|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1875104864, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-1875104864|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1875104864, ~weak$$choice2~0=~weak$$choice2~0_In-1875104864, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1875104864} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 22:28:56,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In-2081913686 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2081913686 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-2081913686 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2081913686 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out-2081913686| 0)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out-2081913686| ~x$w_buff1_used~0_In-2081913686) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2081913686, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2081913686, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2081913686, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2081913686} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-2081913686|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2081913686, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2081913686, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2081913686, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2081913686} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 22:28:56,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-993103246 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-993103246 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-993103246|)) (and (= ~x$r_buff0_thd3~0_In-993103246 |P2Thread1of1ForFork1_#t~ite36_Out-993103246|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-993103246, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-993103246} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-993103246|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-993103246, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-993103246} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 22:28:56,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd3~0_In-1539414206 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1539414206 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-1539414206 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1539414206 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out-1539414206| ~x$r_buff1_thd3~0_In-1539414206) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1539414206|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1539414206, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1539414206, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1539414206, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1539414206} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1539414206|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1539414206, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1539414206, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1539414206, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1539414206} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:28:56,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 22:28:56,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1117264007 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In-1117264007| |P0Thread1of1ForFork2_#t~ite17_Out-1117264007|) (= |P0Thread1of1ForFork2_#t~ite18_Out-1117264007| ~x$w_buff1_used~0_In-1117264007)) (and (= |P0Thread1of1ForFork2_#t~ite17_Out-1117264007| ~x$w_buff1_used~0_In-1117264007) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1117264007 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1117264007 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In-1117264007 256)) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In-1117264007 256)) .cse1))) (= |P0Thread1of1ForFork2_#t~ite18_Out-1117264007| |P0Thread1of1ForFork2_#t~ite17_Out-1117264007|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1117264007, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-1117264007|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1117264007, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1117264007, ~weak$$choice2~0=~weak$$choice2~0_In-1117264007, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1117264007} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1117264007, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-1117264007|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-1117264007|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1117264007, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1117264007, ~weak$$choice2~0=~weak$$choice2~0_In-1117264007, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1117264007} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 22:28:56,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_53 v_~x$r_buff0_thd1~0_52) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_52, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 22:28:56,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L745-->L745-8: Formula: (let ((.cse4 (= (mod ~x$w_buff0_used~0_In1508116012 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In1508116012 256) 0)) (.cse5 (= 0 (mod ~x$w_buff1_used~0_In1508116012 256))) (.cse6 (= 0 (mod ~x$r_buff0_thd1~0_In1508116012 256))) (.cse0 (= (mod ~weak$$choice2~0_In1508116012 256) 0)) (.cse3 (= |P0Thread1of1ForFork2_#t~ite24_Out1508116012| |P0Thread1of1ForFork2_#t~ite23_Out1508116012|))) (or (let ((.cse2 (not .cse6))) (and .cse0 (or (not .cse1) .cse2) (= |P0Thread1of1ForFork2_#t~ite22_Out1508116012| 0) (= |P0Thread1of1ForFork2_#t~ite22_Out1508116012| |P0Thread1of1ForFork2_#t~ite23_Out1508116012|) .cse3 (not .cse4) (or (not .cse5) .cse2))) (and (= |P0Thread1of1ForFork2_#t~ite22_In1508116012| |P0Thread1of1ForFork2_#t~ite22_Out1508116012|) (or (and (= |P0Thread1of1ForFork2_#t~ite24_Out1508116012| ~x$r_buff1_thd1~0_In1508116012) (= |P0Thread1of1ForFork2_#t~ite23_Out1508116012| |P0Thread1of1ForFork2_#t~ite23_In1508116012|) (not .cse0)) (and (or .cse4 (and .cse6 .cse1) (and .cse5 .cse6)) .cse0 (= ~x$r_buff1_thd1~0_In1508116012 |P0Thread1of1ForFork2_#t~ite23_Out1508116012|) .cse3))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1508116012, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1508116012, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1508116012, ~weak$$choice2~0=~weak$$choice2~0_In1508116012, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1508116012|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In1508116012|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1508116012} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1508116012, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1508116012, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1508116012, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1508116012|, ~weak$$choice2~0=~weak$$choice2~0_In1508116012, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1508116012|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out1508116012|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1508116012} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-27 22:28:56,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_17) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 22:28:56,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= (mod v_~x$w_buff0_used~0_82 256) 0) (= (mod v_~x$r_buff0_thd0~0_14 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:28:56,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In985910884 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In985910884 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out985910884| ~x$w_buff1~0_In985910884) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out985910884| ~x~0_In985910884) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In985910884, ~x$w_buff1_used~0=~x$w_buff1_used~0_In985910884, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In985910884, ~x~0=~x~0_In985910884} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out985910884|, ~x$w_buff1~0=~x$w_buff1~0_In985910884, ~x$w_buff1_used~0=~x$w_buff1_used~0_In985910884, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In985910884, ~x~0=~x~0_In985910884} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 22:28:56,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_15 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 22:28:56,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1345355438 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1345355438 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-1345355438| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1345355438 |ULTIMATE.start_main_#t~ite43_Out-1345355438|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1345355438, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1345355438} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1345355438, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1345355438|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1345355438} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 22:28:56,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In1885114944 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1885114944 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1885114944 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1885114944 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out1885114944| 0)) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In1885114944 |ULTIMATE.start_main_#t~ite44_Out1885114944|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1885114944, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1885114944, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1885114944, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1885114944} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1885114944, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1885114944, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1885114944, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1885114944|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1885114944} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 22:28:56,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-135751387 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-135751387 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-135751387|)) (and (= |ULTIMATE.start_main_#t~ite45_Out-135751387| ~x$r_buff0_thd0~0_In-135751387) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-135751387, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-135751387} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-135751387, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-135751387|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-135751387} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 22:28:56,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1876966623 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1876966623 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1876966623 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1876966623 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1876966623| ~x$r_buff1_thd0~0_In-1876966623) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite46_Out-1876966623| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1876966623, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1876966623, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1876966623, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1876966623} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1876966623, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1876966623|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1876966623, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1876966623, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1876966623} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 22:28:56,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_11 2) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_10 256)) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 1 v_~__unbuffered_p2_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite46_16|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:28:56,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:28:56 BasicIcfg [2019-12-27 22:28:56,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:28:56,144 INFO L168 Benchmark]: Toolchain (without parser) took 194521.45 ms. Allocated memory was 137.4 MB in the beginning and 4.3 GB in the end (delta: 4.2 GB). Free memory was 100.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2019-12-27 22:28:56,144 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 137.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 22:28:56,145 INFO L168 Benchmark]: CACSL2BoogieTranslator took 791.51 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.0 MB in the beginning and 154.5 MB in the end (delta: -54.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:28:56,145 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.63 ms. Allocated memory is still 201.3 MB. Free memory was 154.5 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:28:56,146 INFO L168 Benchmark]: Boogie Preprocessor took 44.81 ms. Allocated memory is still 201.3 MB. Free memory was 152.6 MB in the beginning and 149.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:28:56,151 INFO L168 Benchmark]: RCFGBuilder took 857.42 ms. Allocated memory is still 201.3 MB. Free memory was 149.6 MB in the beginning and 103.3 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:28:56,152 INFO L168 Benchmark]: TraceAbstraction took 192760.84 ms. Allocated memory was 201.3 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 103.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-27 22:28:56,156 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.26 ms. Allocated memory is still 137.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 791.51 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.0 MB in the beginning and 154.5 MB in the end (delta: -54.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.63 ms. Allocated memory is still 201.3 MB. Free memory was 154.5 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.81 ms. Allocated memory is still 201.3 MB. Free memory was 152.6 MB in the beginning and 149.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 857.42 ms. Allocated memory is still 201.3 MB. Free memory was 149.6 MB in the beginning and 103.3 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192760.84 ms. Allocated memory was 201.3 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 103.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 27 ChoiceCompositions, 6547 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68909 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2079, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2080, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2081, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 192.4s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 69.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5068 SDtfs, 10690 SDslu, 18542 SDs, 0 SdLazy, 18964 SolverSat, 787 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 782 GetRequests, 151 SyntacticMatches, 100 SemanticMatches, 531 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9953 ImplicationChecksByTransitivity, 13.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156231occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 94.0s AutomataMinimizationTime, 28 MinimizatonAttempts, 324277 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1097 NumberOfCodeBlocks, 1097 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1013 ConstructedInterpolants, 0 QuantifiedInterpolants, 202437 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...