/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/mix023_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:28:12,291 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:28:12,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:28:12,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:28:12,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:28:12,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:28:12,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:28:12,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:28:12,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:28:12,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:28:12,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:28:12,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:28:12,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:28:12,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:28:12,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:28:12,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:28:12,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:28:12,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:28:12,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:28:12,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:28:12,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:28:12,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:28:12,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:28:12,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:28:12,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:28:12,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:28:12,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:28:12,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:28:12,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:28:12,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:28:12,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:28:12,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:28:12,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:28:12,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:28:12,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:28:12,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:28:12,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:28:12,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:28:12,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:28:12,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:28:12,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:28:12,367 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 20:28:12,380 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:28:12,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:28:12,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:28:12,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:28:12,382 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:28:12,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:28:12,383 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:28:12,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:28:12,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:28:12,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:28:12,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:28:12,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:28:12,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:28:12,384 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:28:12,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:28:12,384 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:28:12,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:28:12,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:28:12,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:28:12,385 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:28:12,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:28:12,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:28:12,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:28:12,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:28:12,386 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:28:12,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:28:12,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:28:12,387 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:28:12,387 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:28:12,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:28:12,387 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:28:12,387 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:28:12,670 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:28:12,686 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:28:12,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:28:12,692 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:28:12,692 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:28:12,693 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_pso.opt.i [2019-12-27 20:28:12,768 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79de01c65/e49d85b1bab44f16a1c31e55ea8101f8/FLAGcbdcc8c76 [2019-12-27 20:28:13,337 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:28:13,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_pso.opt.i [2019-12-27 20:28:13,355 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79de01c65/e49d85b1bab44f16a1c31e55ea8101f8/FLAGcbdcc8c76 [2019-12-27 20:28:13,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79de01c65/e49d85b1bab44f16a1c31e55ea8101f8 [2019-12-27 20:28:13,619 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:28:13,623 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:28:13,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:28:13,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:28:13,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:28:13,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:28:13" (1/1) ... [2019-12-27 20:28:13,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee3c599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:13, skipping insertion in model container [2019-12-27 20:28:13,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:28:13" (1/1) ... [2019-12-27 20:28:13,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:28:13,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:28:14,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:28:14,257 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:28:14,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:28:14,430 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:28:14,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:14 WrapperNode [2019-12-27 20:28:14,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:28:14,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:28:14,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:28:14,432 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:28:14,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:14" (1/1) ... [2019-12-27 20:28:14,462 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:14" (1/1) ... [2019-12-27 20:28:14,497 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:28:14,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:28:14,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:28:14,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:28:14,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:14" (1/1) ... [2019-12-27 20:28:14,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:14" (1/1) ... [2019-12-27 20:28:14,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:14" (1/1) ... [2019-12-27 20:28:14,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:14" (1/1) ... [2019-12-27 20:28:14,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:14" (1/1) ... [2019-12-27 20:28:14,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:14" (1/1) ... [2019-12-27 20:28:14,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:14" (1/1) ... [2019-12-27 20:28:14,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:28:14,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:28:14,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:28:14,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:28:14,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:14" (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 20:28:14,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:28:14,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:28:14,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:28:14,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:28:14,607 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:28:14,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:28:14,608 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:28:14,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:28:14,608 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:28:14,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:28:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 20:28:14,609 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 20:28:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:28:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:28:14,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:28:14,612 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 20:28:15,341 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:28:15,342 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:28:15,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:28:15 BoogieIcfgContainer [2019-12-27 20:28:15,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:28:15,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:28:15,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:28:15,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:28:15,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:28:13" (1/3) ... [2019-12-27 20:28:15,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3e4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:28:15, skipping insertion in model container [2019-12-27 20:28:15,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:14" (2/3) ... [2019-12-27 20:28:15,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3e4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:28:15, skipping insertion in model container [2019-12-27 20:28:15,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:28:15" (3/3) ... [2019-12-27 20:28:15,353 INFO L109 eAbstractionObserver]: Analyzing ICFG mix023_pso.opt.i [2019-12-27 20:28:15,363 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:28:15,364 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:28:15,376 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:28:15,377 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:28:15,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,420 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,421 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,439 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,439 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,483 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,483 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,483 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,484 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,484 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,492 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,492 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,492 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,492 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,493 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,493 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,493 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,493 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,493 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,494 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,494 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,494 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,494 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,494 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,495 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,495 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,495 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,495 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,495 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,496 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,496 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,496 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,496 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,496 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,496 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,497 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,497 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,497 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,497 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,497 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,504 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,504 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,506 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,506 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,506 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,506 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,507 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,507 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,507 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,507 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,513 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,514 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,519 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,522 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,526 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,526 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,526 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:28:15,542 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 20:28:15,563 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:28:15,563 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:28:15,563 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:28:15,563 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:28:15,563 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:28:15,564 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:28:15,564 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:28:15,564 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:28:15,585 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-27 20:28:15,587 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 20:28:15,695 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 20:28:15,695 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:28:15,712 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 20:28:15,737 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 20:28:15,794 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 20:28:15,794 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:28:15,802 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 20:28:15,824 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 20:28:15,825 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:28:19,960 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 20:28:20,098 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 20:28:20,123 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68763 [2019-12-27 20:28:20,123 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 20:28:20,126 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 94 transitions [2019-12-27 20:28:54,647 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 166438 states. [2019-12-27 20:28:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 166438 states. [2019-12-27 20:28:54,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 20:28:54,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:28:54,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:28:54,657 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:28:54,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:28:54,663 INFO L82 PathProgramCache]: Analyzing trace with hash 404581936, now seen corresponding path program 1 times [2019-12-27 20:28:54,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:28:54,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884570376] [2019-12-27 20:28:54,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:28:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:28:54,924 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 20:28:54,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884570376] [2019-12-27 20:28:54,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:28:54,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:28:54,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [884856192] [2019-12-27 20:28:54,927 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:28:54,932 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:28:54,946 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 20:28:54,947 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:28:54,951 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:28:54,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:28:54,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:28:54,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:28:54,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:28:54,969 INFO L87 Difference]: Start difference. First operand 166438 states. Second operand 3 states. [2019-12-27 20:28:59,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:28:59,458 INFO L93 Difference]: Finished difference Result 163218 states and 783804 transitions. [2019-12-27 20:28:59,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:28:59,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 20:28:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:29:00,567 INFO L225 Difference]: With dead ends: 163218 [2019-12-27 20:29:00,567 INFO L226 Difference]: Without dead ends: 153026 [2019-12-27 20:29:00,568 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 20:29:09,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153026 states. [2019-12-27 20:29:12,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153026 to 153026. [2019-12-27 20:29:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153026 states. [2019-12-27 20:29:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153026 states to 153026 states and 733880 transitions. [2019-12-27 20:29:18,676 INFO L78 Accepts]: Start accepts. Automaton has 153026 states and 733880 transitions. Word has length 7 [2019-12-27 20:29:18,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:29:18,677 INFO L462 AbstractCegarLoop]: Abstraction has 153026 states and 733880 transitions. [2019-12-27 20:29:18,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:29:18,677 INFO L276 IsEmpty]: Start isEmpty. Operand 153026 states and 733880 transitions. [2019-12-27 20:29:18,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 20:29:18,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:29:18,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:29:18,688 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:29:18,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:29:18,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1448601888, now seen corresponding path program 1 times [2019-12-27 20:29:18,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:29:18,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161105250] [2019-12-27 20:29:18,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:29:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:29:18,813 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 20:29:18,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161105250] [2019-12-27 20:29:18,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:29:18,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:29:18,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [219643108] [2019-12-27 20:29:18,814 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:29:18,815 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:29:18,824 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 20:29:18,825 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:29:18,825 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:29:18,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:29:18,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:29:18,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:29:18,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:29:18,827 INFO L87 Difference]: Start difference. First operand 153026 states and 733880 transitions. Second operand 3 states. [2019-12-27 20:29:20,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:29:20,761 INFO L93 Difference]: Finished difference Result 96841 states and 419275 transitions. [2019-12-27 20:29:20,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:29:20,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 20:29:20,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:29:21,156 INFO L225 Difference]: With dead ends: 96841 [2019-12-27 20:29:21,156 INFO L226 Difference]: Without dead ends: 96841 [2019-12-27 20:29:21,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:29:29,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96841 states. [2019-12-27 20:29:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96841 to 96841. [2019-12-27 20:29:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96841 states. [2019-12-27 20:29:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96841 states to 96841 states and 419275 transitions. [2019-12-27 20:29:30,813 INFO L78 Accepts]: Start accepts. Automaton has 96841 states and 419275 transitions. Word has length 15 [2019-12-27 20:29:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:29:30,813 INFO L462 AbstractCegarLoop]: Abstraction has 96841 states and 419275 transitions. [2019-12-27 20:29:30,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:29:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 96841 states and 419275 transitions. [2019-12-27 20:29:30,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 20:29:30,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:29:30,817 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:29:30,818 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:29:30,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:29:30,818 INFO L82 PathProgramCache]: Analyzing trace with hash 576667599, now seen corresponding path program 1 times [2019-12-27 20:29:30,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:29:30,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940527913] [2019-12-27 20:29:30,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:29:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:29:30,936 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 20:29:30,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940527913] [2019-12-27 20:29:30,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:29:30,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:29:30,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2078786757] [2019-12-27 20:29:30,941 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:29:30,943 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:29:30,945 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 20:29:30,946 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:29:30,946 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:29:30,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:29:30,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:29:30,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:29:30,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:29:30,947 INFO L87 Difference]: Start difference. First operand 96841 states and 419275 transitions. Second operand 4 states. [2019-12-27 20:29:32,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:29:32,977 INFO L93 Difference]: Finished difference Result 146922 states and 610245 transitions. [2019-12-27 20:29:32,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:29:32,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 20:29:32,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:29:33,482 INFO L225 Difference]: With dead ends: 146922 [2019-12-27 20:29:33,482 INFO L226 Difference]: Without dead ends: 146817 [2019-12-27 20:29:33,483 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 20:29:37,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146817 states. [2019-12-27 20:29:46,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146817 to 132421. [2019-12-27 20:29:46,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132421 states. [2019-12-27 20:29:47,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132421 states to 132421 states and 557528 transitions. [2019-12-27 20:29:47,062 INFO L78 Accepts]: Start accepts. Automaton has 132421 states and 557528 transitions. Word has length 15 [2019-12-27 20:29:47,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:29:47,063 INFO L462 AbstractCegarLoop]: Abstraction has 132421 states and 557528 transitions. [2019-12-27 20:29:47,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:29:47,063 INFO L276 IsEmpty]: Start isEmpty. Operand 132421 states and 557528 transitions. [2019-12-27 20:29:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:29:47,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:29:47,068 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:29:47,068 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:29:47,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:29:47,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1043569302, now seen corresponding path program 1 times [2019-12-27 20:29:47,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:29:47,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420661510] [2019-12-27 20:29:47,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:29:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:29:47,129 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 20:29:47,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420661510] [2019-12-27 20:29:47,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:29:47,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:29:47,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [770680177] [2019-12-27 20:29:47,130 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:29:47,132 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:29:47,135 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 20:29:47,135 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:29:47,136 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:29:47,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:29:47,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:29:47,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:29:47,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:29:47,137 INFO L87 Difference]: Start difference. First operand 132421 states and 557528 transitions. Second operand 4 states. [2019-12-27 20:29:47,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:29:47,344 INFO L93 Difference]: Finished difference Result 36987 states and 132370 transitions. [2019-12-27 20:29:47,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:29:47,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:29:47,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:29:47,429 INFO L225 Difference]: With dead ends: 36987 [2019-12-27 20:29:47,429 INFO L226 Difference]: Without dead ends: 36987 [2019-12-27 20:29:47,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:29:47,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36987 states. [2019-12-27 20:29:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36987 to 36987. [2019-12-27 20:29:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36987 states. [2019-12-27 20:29:49,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36987 states to 36987 states and 132370 transitions. [2019-12-27 20:29:49,016 INFO L78 Accepts]: Start accepts. Automaton has 36987 states and 132370 transitions. Word has length 16 [2019-12-27 20:29:49,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:29:49,017 INFO L462 AbstractCegarLoop]: Abstraction has 36987 states and 132370 transitions. [2019-12-27 20:29:49,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:29:49,017 INFO L276 IsEmpty]: Start isEmpty. Operand 36987 states and 132370 transitions. [2019-12-27 20:29:49,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:29:49,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:29:49,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:29:49,020 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:29:49,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:29:49,021 INFO L82 PathProgramCache]: Analyzing trace with hash 372623930, now seen corresponding path program 1 times [2019-12-27 20:29:49,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:29:49,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770939977] [2019-12-27 20:29:49,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:29:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:29:49,141 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 20:29:49,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770939977] [2019-12-27 20:29:49,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:29:49,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:29:49,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1242565404] [2019-12-27 20:29:49,142 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:29:49,144 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:29:49,148 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 20:29:49,148 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:29:49,251 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:29:49,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:29:49,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:29:49,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:29:49,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:29:49,253 INFO L87 Difference]: Start difference. First operand 36987 states and 132370 transitions. Second operand 7 states. [2019-12-27 20:29:50,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:29:50,127 INFO L93 Difference]: Finished difference Result 54351 states and 190541 transitions. [2019-12-27 20:29:50,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:29:50,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-27 20:29:50,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:29:50,282 INFO L225 Difference]: With dead ends: 54351 [2019-12-27 20:29:50,282 INFO L226 Difference]: Without dead ends: 54333 [2019-12-27 20:29:50,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:29:50,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54333 states. [2019-12-27 20:29:51,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54333 to 42478. [2019-12-27 20:29:51,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42478 states. [2019-12-27 20:29:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42478 states to 42478 states and 151468 transitions. [2019-12-27 20:29:51,924 INFO L78 Accepts]: Start accepts. Automaton has 42478 states and 151468 transitions. Word has length 16 [2019-12-27 20:29:51,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:29:51,924 INFO L462 AbstractCegarLoop]: Abstraction has 42478 states and 151468 transitions. [2019-12-27 20:29:51,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:29:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand 42478 states and 151468 transitions. [2019-12-27 20:29:51,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 20:29:51,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:29:51,940 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] [2019-12-27 20:29:51,941 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:29:51,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:29:51,941 INFO L82 PathProgramCache]: Analyzing trace with hash -351800871, now seen corresponding path program 1 times [2019-12-27 20:29:51,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:29:51,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074924981] [2019-12-27 20:29:51,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:29:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:29:52,091 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 20:29:52,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074924981] [2019-12-27 20:29:52,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:29:52,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:29:52,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1119228404] [2019-12-27 20:29:52,092 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:29:52,095 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:29:52,110 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 114 transitions. [2019-12-27 20:29:52,111 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:29:52,178 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:29:52,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:29:52,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:29:52,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:29:52,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:29:52,179 INFO L87 Difference]: Start difference. First operand 42478 states and 151468 transitions. Second operand 8 states. [2019-12-27 20:29:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:29:53,516 INFO L93 Difference]: Finished difference Result 63900 states and 221523 transitions. [2019-12-27 20:29:53,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:29:53,517 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-27 20:29:53,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:29:53,644 INFO L225 Difference]: With dead ends: 63900 [2019-12-27 20:29:53,644 INFO L226 Difference]: Without dead ends: 63870 [2019-12-27 20:29:53,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:29:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63870 states. [2019-12-27 20:29:55,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63870 to 42427. [2019-12-27 20:29:55,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42427 states. [2019-12-27 20:29:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42427 states to 42427 states and 150408 transitions. [2019-12-27 20:29:55,432 INFO L78 Accepts]: Start accepts. Automaton has 42427 states and 150408 transitions. Word has length 24 [2019-12-27 20:29:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:29:55,432 INFO L462 AbstractCegarLoop]: Abstraction has 42427 states and 150408 transitions. [2019-12-27 20:29:55,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:29:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 42427 states and 150408 transitions. [2019-12-27 20:29:55,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:29:55,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:29:55,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:29:55,455 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:29:55,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:29:55,455 INFO L82 PathProgramCache]: Analyzing trace with hash -478348385, now seen corresponding path program 1 times [2019-12-27 20:29:55,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:29:55,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397201836] [2019-12-27 20:29:55,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:29:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:29:55,516 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 20:29:55,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397201836] [2019-12-27 20:29:55,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:29:55,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:29:55,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [629574220] [2019-12-27 20:29:55,517 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:29:55,523 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:29:55,531 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 40 transitions. [2019-12-27 20:29:55,531 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:29:55,532 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:29:55,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:29:55,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:29:55,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:29:55,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:29:55,533 INFO L87 Difference]: Start difference. First operand 42427 states and 150408 transitions. Second operand 5 states. [2019-12-27 20:29:55,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:29:55,666 INFO L93 Difference]: Finished difference Result 22700 states and 81312 transitions. [2019-12-27 20:29:55,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:29:55,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 20:29:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:29:55,707 INFO L225 Difference]: With dead ends: 22700 [2019-12-27 20:29:55,707 INFO L226 Difference]: Without dead ends: 22700 [2019-12-27 20:29:55,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:29:55,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22700 states. [2019-12-27 20:29:56,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22700 to 22364. [2019-12-27 20:29:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22364 states. [2019-12-27 20:29:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22364 states to 22364 states and 80168 transitions. [2019-12-27 20:29:56,095 INFO L78 Accepts]: Start accepts. Automaton has 22364 states and 80168 transitions. Word has length 28 [2019-12-27 20:29:56,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:29:56,095 INFO L462 AbstractCegarLoop]: Abstraction has 22364 states and 80168 transitions. [2019-12-27 20:29:56,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:29:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 22364 states and 80168 transitions. [2019-12-27 20:29:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 20:29:56,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:29:56,134 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:29:56,134 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:29:56,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:29:56,134 INFO L82 PathProgramCache]: Analyzing trace with hash -89817491, now seen corresponding path program 1 times [2019-12-27 20:29:56,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:29:56,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120247793] [2019-12-27 20:29:56,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:29:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:29:56,207 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 20:29:56,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120247793] [2019-12-27 20:29:56,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:29:56,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:29:56,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1463661107] [2019-12-27 20:29:56,208 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:29:56,217 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:29:56,252 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 103 transitions. [2019-12-27 20:29:56,252 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:29:56,252 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:29:56,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:29:56,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:29:56,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:29:56,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:29:56,254 INFO L87 Difference]: Start difference. First operand 22364 states and 80168 transitions. Second operand 3 states. [2019-12-27 20:29:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:29:56,469 INFO L93 Difference]: Finished difference Result 33735 states and 115366 transitions. [2019-12-27 20:29:56,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:29:56,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-27 20:29:56,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:29:56,526 INFO L225 Difference]: With dead ends: 33735 [2019-12-27 20:29:56,527 INFO L226 Difference]: Without dead ends: 22811 [2019-12-27 20:29:56,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:29:56,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22811 states. [2019-12-27 20:29:58,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22811 to 22329. [2019-12-27 20:29:58,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22329 states. [2019-12-27 20:29:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22329 states to 22329 states and 69880 transitions. [2019-12-27 20:29:59,001 INFO L78 Accepts]: Start accepts. Automaton has 22329 states and 69880 transitions. Word has length 42 [2019-12-27 20:29:59,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:29:59,001 INFO L462 AbstractCegarLoop]: Abstraction has 22329 states and 69880 transitions. [2019-12-27 20:29:59,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:29:59,001 INFO L276 IsEmpty]: Start isEmpty. Operand 22329 states and 69880 transitions. [2019-12-27 20:29:59,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 20:29:59,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:29:59,033 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] [2019-12-27 20:29:59,034 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:29:59,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:29:59,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1643728433, now seen corresponding path program 1 times [2019-12-27 20:29:59,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:29:59,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877623803] [2019-12-27 20:29:59,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:29:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:29:59,111 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 20:29:59,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877623803] [2019-12-27 20:29:59,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:29:59,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:29:59,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [831006691] [2019-12-27 20:29:59,112 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:29:59,122 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:29:59,220 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 413 transitions. [2019-12-27 20:29:59,220 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:29:59,237 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:29:59,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:29:59,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:29:59,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:29:59,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:29:59,238 INFO L87 Difference]: Start difference. First operand 22329 states and 69880 transitions. Second operand 7 states. [2019-12-27 20:29:59,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:29:59,417 INFO L93 Difference]: Finished difference Result 21070 states and 66665 transitions. [2019-12-27 20:29:59,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:29:59,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-27 20:29:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:29:59,441 INFO L225 Difference]: With dead ends: 21070 [2019-12-27 20:29:59,441 INFO L226 Difference]: Without dead ends: 10890 [2019-12-27 20:29:59,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:29:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10890 states. [2019-12-27 20:29:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10890 to 10414. [2019-12-27 20:29:59,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10414 states. [2019-12-27 20:29:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10414 states to 10414 states and 32808 transitions. [2019-12-27 20:29:59,690 INFO L78 Accepts]: Start accepts. Automaton has 10414 states and 32808 transitions. Word has length 43 [2019-12-27 20:29:59,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:29:59,690 INFO L462 AbstractCegarLoop]: Abstraction has 10414 states and 32808 transitions. [2019-12-27 20:29:59,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:29:59,691 INFO L276 IsEmpty]: Start isEmpty. Operand 10414 states and 32808 transitions. [2019-12-27 20:29:59,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:29:59,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:29:59,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:29:59,710 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:29:59,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:29:59,710 INFO L82 PathProgramCache]: Analyzing trace with hash -400777059, now seen corresponding path program 1 times [2019-12-27 20:29:59,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:29:59,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73280516] [2019-12-27 20:29:59,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:29:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:29:59,832 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 20:29:59,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73280516] [2019-12-27 20:29:59,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:29:59,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:29:59,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [805636333] [2019-12-27 20:29:59,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:29:59,852 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:30:00,142 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 288 states and 509 transitions. [2019-12-27 20:30:00,142 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:30:00,156 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:30:00,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:30:00,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:30:00,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:30:00,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:30:00,157 INFO L87 Difference]: Start difference. First operand 10414 states and 32808 transitions. Second operand 5 states. [2019-12-27 20:30:00,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:30:00,284 INFO L93 Difference]: Finished difference Result 18914 states and 59584 transitions. [2019-12-27 20:30:00,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:30:00,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 20:30:00,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:30:00,303 INFO L225 Difference]: With dead ends: 18914 [2019-12-27 20:30:00,303 INFO L226 Difference]: Without dead ends: 8811 [2019-12-27 20:30:00,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:30:00,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8811 states. [2019-12-27 20:30:00,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8811 to 8811. [2019-12-27 20:30:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8811 states. [2019-12-27 20:30:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8811 states to 8811 states and 27635 transitions. [2019-12-27 20:30:00,684 INFO L78 Accepts]: Start accepts. Automaton has 8811 states and 27635 transitions. Word has length 57 [2019-12-27 20:30:00,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:30:00,684 INFO L462 AbstractCegarLoop]: Abstraction has 8811 states and 27635 transitions. [2019-12-27 20:30:00,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:30:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 8811 states and 27635 transitions. [2019-12-27 20:30:00,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:30:00,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:30:00,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:30:00,697 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:30:00,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:30:00,698 INFO L82 PathProgramCache]: Analyzing trace with hash 2006827895, now seen corresponding path program 2 times [2019-12-27 20:30:00,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:30:00,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235779959] [2019-12-27 20:30:00,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:30:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:30:00,789 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 20:30:00,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235779959] [2019-12-27 20:30:00,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:30:00,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:30:00,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [604546904] [2019-12-27 20:30:00,790 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:30:00,808 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:30:00,938 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 174 states and 247 transitions. [2019-12-27 20:30:00,938 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:30:00,946 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:30:00,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:30:00,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:30:00,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:30:00,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:30:00,947 INFO L87 Difference]: Start difference. First operand 8811 states and 27635 transitions. Second operand 7 states. [2019-12-27 20:30:01,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:30:01,346 INFO L93 Difference]: Finished difference Result 23195 states and 72754 transitions. [2019-12-27 20:30:01,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:30:01,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 20:30:01,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:30:01,381 INFO L225 Difference]: With dead ends: 23195 [2019-12-27 20:30:01,382 INFO L226 Difference]: Without dead ends: 17949 [2019-12-27 20:30:01,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:30:01,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17949 states. [2019-12-27 20:30:01,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17949 to 10607. [2019-12-27 20:30:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10607 states. [2019-12-27 20:30:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10607 states to 10607 states and 33546 transitions. [2019-12-27 20:30:01,618 INFO L78 Accepts]: Start accepts. Automaton has 10607 states and 33546 transitions. Word has length 57 [2019-12-27 20:30:01,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:30:01,619 INFO L462 AbstractCegarLoop]: Abstraction has 10607 states and 33546 transitions. [2019-12-27 20:30:01,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:30:01,619 INFO L276 IsEmpty]: Start isEmpty. Operand 10607 states and 33546 transitions. [2019-12-27 20:30:01,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:30:01,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:30:01,630 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:30:01,630 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:30:01,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:30:01,630 INFO L82 PathProgramCache]: Analyzing trace with hash 716545355, now seen corresponding path program 3 times [2019-12-27 20:30:01,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:30:01,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418380447] [2019-12-27 20:30:01,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:30:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:30:01,746 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 20:30:01,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418380447] [2019-12-27 20:30:01,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:30:01,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:30:01,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [743850777] [2019-12-27 20:30:01,747 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:30:01,765 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:30:01,991 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 276 transitions. [2019-12-27 20:30:01,992 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:30:02,130 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 20:30:02,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:30:02,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:30:02,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:30:02,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:30:02,131 INFO L87 Difference]: Start difference. First operand 10607 states and 33546 transitions. Second operand 8 states. [2019-12-27 20:30:03,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:30:03,316 INFO L93 Difference]: Finished difference Result 44112 states and 139302 transitions. [2019-12-27 20:30:03,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 20:30:03,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-27 20:30:03,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:30:03,368 INFO L225 Difference]: With dead ends: 44112 [2019-12-27 20:30:03,368 INFO L226 Difference]: Without dead ends: 31559 [2019-12-27 20:30:03,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:30:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31559 states. [2019-12-27 20:30:03,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31559 to 13319. [2019-12-27 20:30:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13319 states. [2019-12-27 20:30:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13319 states to 13319 states and 42674 transitions. [2019-12-27 20:30:03,722 INFO L78 Accepts]: Start accepts. Automaton has 13319 states and 42674 transitions. Word has length 57 [2019-12-27 20:30:03,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:30:03,723 INFO L462 AbstractCegarLoop]: Abstraction has 13319 states and 42674 transitions. [2019-12-27 20:30:03,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:30:03,723 INFO L276 IsEmpty]: Start isEmpty. Operand 13319 states and 42674 transitions. [2019-12-27 20:30:03,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:30:03,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:30:03,739 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:30:03,739 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:30:03,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:30:03,740 INFO L82 PathProgramCache]: Analyzing trace with hash -747821109, now seen corresponding path program 1 times [2019-12-27 20:30:03,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:30:03,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151924916] [2019-12-27 20:30:03,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:30:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:30:03,797 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 20:30:03,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151924916] [2019-12-27 20:30:03,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:30:03,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:30:03,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [223769189] [2019-12-27 20:30:03,798 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:30:03,817 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:30:04,065 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 364 transitions. [2019-12-27 20:30:04,065 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:30:04,101 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:30:04,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:30:04,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:30:04,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:30:04,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:30:04,103 INFO L87 Difference]: Start difference. First operand 13319 states and 42674 transitions. Second operand 5 states. [2019-12-27 20:30:04,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:30:04,844 INFO L93 Difference]: Finished difference Result 37394 states and 116447 transitions. [2019-12-27 20:30:04,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:30:04,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 20:30:04,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:30:04,907 INFO L225 Difference]: With dead ends: 37394 [2019-12-27 20:30:04,908 INFO L226 Difference]: Without dead ends: 37394 [2019-12-27 20:30:04,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:30:05,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37394 states. [2019-12-27 20:30:05,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37394 to 15832. [2019-12-27 20:30:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15832 states. [2019-12-27 20:30:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15832 states to 15832 states and 50778 transitions. [2019-12-27 20:30:05,352 INFO L78 Accepts]: Start accepts. Automaton has 15832 states and 50778 transitions. Word has length 57 [2019-12-27 20:30:05,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:30:05,352 INFO L462 AbstractCegarLoop]: Abstraction has 15832 states and 50778 transitions. [2019-12-27 20:30:05,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:30:05,352 INFO L276 IsEmpty]: Start isEmpty. Operand 15832 states and 50778 transitions. [2019-12-27 20:30:05,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:30:05,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:30:05,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:30:05,376 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:30:05,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:30:05,376 INFO L82 PathProgramCache]: Analyzing trace with hash -780825525, now seen corresponding path program 4 times [2019-12-27 20:30:05,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:30:05,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813610853] [2019-12-27 20:30:05,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:30:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:30:05,487 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 20:30:05,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813610853] [2019-12-27 20:30:05,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:30:05,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:30:05,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1464663575] [2019-12-27 20:30:05,489 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:30:05,528 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:30:05,723 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 236 states and 384 transitions. [2019-12-27 20:30:05,723 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:30:05,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:30:05,942 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 20:30:05,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 20:30:05,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:30:05,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 20:30:05,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:30:05,944 INFO L87 Difference]: Start difference. First operand 15832 states and 50778 transitions. Second operand 13 states. [2019-12-27 20:30:14,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:30:14,016 INFO L93 Difference]: Finished difference Result 93050 states and 284821 transitions. [2019-12-27 20:30:14,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-12-27 20:30:14,017 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 20:30:14,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:30:14,144 INFO L225 Difference]: With dead ends: 93050 [2019-12-27 20:30:14,144 INFO L226 Difference]: Without dead ends: 85882 [2019-12-27 20:30:14,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 11 SyntacticMatches, 11 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6235 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2655, Invalid=12845, Unknown=0, NotChecked=0, Total=15500 [2019-12-27 20:30:14,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85882 states. [2019-12-27 20:30:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85882 to 16039. [2019-12-27 20:30:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16039 states. [2019-12-27 20:30:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16039 states to 16039 states and 51732 transitions. [2019-12-27 20:30:14,923 INFO L78 Accepts]: Start accepts. Automaton has 16039 states and 51732 transitions. Word has length 57 [2019-12-27 20:30:14,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:30:14,923 INFO L462 AbstractCegarLoop]: Abstraction has 16039 states and 51732 transitions. [2019-12-27 20:30:14,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 20:30:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 16039 states and 51732 transitions. [2019-12-27 20:30:14,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:30:14,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:30:14,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:30:14,941 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:30:14,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:30:14,942 INFO L82 PathProgramCache]: Analyzing trace with hash -414013221, now seen corresponding path program 5 times [2019-12-27 20:30:14,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:30:14,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045005638] [2019-12-27 20:30:14,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:30:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:30:15,014 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 20:30:15,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045005638] [2019-12-27 20:30:15,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:30:15,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:30:15,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1146048640] [2019-12-27 20:30:15,015 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:30:15,032 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:30:15,408 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 217 states and 343 transitions. [2019-12-27 20:30:15,408 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:30:15,437 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:30:15,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:30:15,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:30:15,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:30:15,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:30:15,438 INFO L87 Difference]: Start difference. First operand 16039 states and 51732 transitions. Second operand 7 states. [2019-12-27 20:30:15,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:30:15,770 INFO L93 Difference]: Finished difference Result 32485 states and 101940 transitions. [2019-12-27 20:30:15,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:30:15,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 20:30:15,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:30:15,812 INFO L225 Difference]: With dead ends: 32485 [2019-12-27 20:30:15,812 INFO L226 Difference]: Without dead ends: 27447 [2019-12-27 20:30:15,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:30:15,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27447 states. [2019-12-27 20:30:16,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27447 to 16249. [2019-12-27 20:30:16,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16249 states. [2019-12-27 20:30:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16249 states to 16249 states and 52319 transitions. [2019-12-27 20:30:16,160 INFO L78 Accepts]: Start accepts. Automaton has 16249 states and 52319 transitions. Word has length 57 [2019-12-27 20:30:16,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:30:16,160 INFO L462 AbstractCegarLoop]: Abstraction has 16249 states and 52319 transitions. [2019-12-27 20:30:16,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:30:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 16249 states and 52319 transitions. [2019-12-27 20:30:16,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:30:16,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:30:16,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:30:16,185 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:30:16,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:30:16,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1111165587, now seen corresponding path program 6 times [2019-12-27 20:30:16,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:30:16,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714143773] [2019-12-27 20:30:16,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:30:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:30:16,257 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 20:30:16,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714143773] [2019-12-27 20:30:16,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:30:16,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:30:16,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1261174935] [2019-12-27 20:30:16,258 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:30:16,274 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:30:16,452 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 208 states and 309 transitions. [2019-12-27 20:30:16,452 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:30:16,473 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:30:16,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:30:16,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:30:16,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:30:16,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:30:16,474 INFO L87 Difference]: Start difference. First operand 16249 states and 52319 transitions. Second operand 6 states. [2019-12-27 20:30:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:30:17,179 INFO L93 Difference]: Finished difference Result 24266 states and 75625 transitions. [2019-12-27 20:30:17,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:30:17,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 20:30:17,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:30:17,213 INFO L225 Difference]: With dead ends: 24266 [2019-12-27 20:30:17,213 INFO L226 Difference]: Without dead ends: 24140 [2019-12-27 20:30:17,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:30:17,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24140 states. [2019-12-27 20:30:17,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24140 to 19024. [2019-12-27 20:30:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19024 states. [2019-12-27 20:30:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19024 states to 19024 states and 60429 transitions. [2019-12-27 20:30:17,654 INFO L78 Accepts]: Start accepts. Automaton has 19024 states and 60429 transitions. Word has length 57 [2019-12-27 20:30:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:30:17,655 INFO L462 AbstractCegarLoop]: Abstraction has 19024 states and 60429 transitions. [2019-12-27 20:30:17,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:30:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 19024 states and 60429 transitions. [2019-12-27 20:30:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:30:17,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:30:17,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:30:17,676 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:30:17,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:30:17,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1189678611, now seen corresponding path program 7 times [2019-12-27 20:30:17,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:30:17,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526774748] [2019-12-27 20:30:17,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:30:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:30:17,756 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 20:30:17,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526774748] [2019-12-27 20:30:17,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:30:17,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:30:17,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [403196572] [2019-12-27 20:30:17,757 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:30:17,773 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:30:17,945 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 296 transitions. [2019-12-27 20:30:17,946 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:30:18,020 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:30:18,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:30:18,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:30:18,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:30:18,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:30:18,021 INFO L87 Difference]: Start difference. First operand 19024 states and 60429 transitions. Second operand 9 states. [2019-12-27 20:30:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:30:19,067 INFO L93 Difference]: Finished difference Result 32267 states and 99825 transitions. [2019-12-27 20:30:19,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 20:30:19,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 20:30:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:30:19,116 INFO L225 Difference]: With dead ends: 32267 [2019-12-27 20:30:19,116 INFO L226 Difference]: Without dead ends: 32084 [2019-12-27 20:30:19,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:30:19,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32084 states. [2019-12-27 20:30:19,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32084 to 22650. [2019-12-27 20:30:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22650 states. [2019-12-27 20:30:19,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22650 states to 22650 states and 71520 transitions. [2019-12-27 20:30:19,793 INFO L78 Accepts]: Start accepts. Automaton has 22650 states and 71520 transitions. Word has length 57 [2019-12-27 20:30:19,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:30:19,794 INFO L462 AbstractCegarLoop]: Abstraction has 22650 states and 71520 transitions. [2019-12-27 20:30:19,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:30:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 22650 states and 71520 transitions. [2019-12-27 20:30:19,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:30:19,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:30:19,817 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:30:19,817 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:30:19,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:30:19,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1103228865, now seen corresponding path program 8 times [2019-12-27 20:30:19,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:30:19,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528578215] [2019-12-27 20:30:19,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:30:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:30:19,943 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 20:30:19,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528578215] [2019-12-27 20:30:19,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:30:19,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:30:19,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [684611079] [2019-12-27 20:30:19,949 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:30:19,967 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:30:20,141 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 317 transitions. [2019-12-27 20:30:20,141 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:30:20,174 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:30:20,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:30:20,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:30:20,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:30:20,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:30:20,175 INFO L87 Difference]: Start difference. First operand 22650 states and 71520 transitions. Second operand 8 states. [2019-12-27 20:30:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:30:21,488 INFO L93 Difference]: Finished difference Result 30946 states and 94428 transitions. [2019-12-27 20:30:21,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 20:30:21,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-27 20:30:21,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:30:21,534 INFO L225 Difference]: With dead ends: 30946 [2019-12-27 20:30:21,535 INFO L226 Difference]: Without dead ends: 30757 [2019-12-27 20:30:21,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:30:21,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30757 states. [2019-12-27 20:30:21,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30757 to 23678. [2019-12-27 20:30:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23678 states. [2019-12-27 20:30:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23678 states to 23678 states and 74490 transitions. [2019-12-27 20:30:21,973 INFO L78 Accepts]: Start accepts. Automaton has 23678 states and 74490 transitions. Word has length 57 [2019-12-27 20:30:21,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:30:21,973 INFO L462 AbstractCegarLoop]: Abstraction has 23678 states and 74490 transitions. [2019-12-27 20:30:21,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:30:21,973 INFO L276 IsEmpty]: Start isEmpty. Operand 23678 states and 74490 transitions. [2019-12-27 20:30:21,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:30:21,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:30:21,999 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:30:21,999 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:30:21,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:30:22,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1047376819, now seen corresponding path program 9 times [2019-12-27 20:30:22,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:30:22,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028538299] [2019-12-27 20:30:22,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:30:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:30:22,147 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 20:30:22,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028538299] [2019-12-27 20:30:22,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:30:22,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:30:22,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [991816051] [2019-12-27 20:30:22,149 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:30:22,164 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:30:22,482 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 292 transitions. [2019-12-27 20:30:22,483 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:30:22,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:30:22,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:30:22,632 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-12-27 20:30:22,749 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:30:22,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:30:22,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:30:22,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:30:22,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:30:22,750 INFO L87 Difference]: Start difference. First operand 23678 states and 74490 transitions. Second operand 12 states. [2019-12-27 20:30:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:30:25,712 INFO L93 Difference]: Finished difference Result 49242 states and 147246 transitions. [2019-12-27 20:30:25,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 20:30:25,712 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-27 20:30:25,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:30:25,786 INFO L225 Difference]: With dead ends: 49242 [2019-12-27 20:30:25,786 INFO L226 Difference]: Without dead ends: 48980 [2019-12-27 20:30:25,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2019-12-27 20:30:25,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48980 states. [2019-12-27 20:30:26,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48980 to 23931. [2019-12-27 20:30:26,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23931 states. [2019-12-27 20:30:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23931 states to 23931 states and 73957 transitions. [2019-12-27 20:30:26,612 INFO L78 Accepts]: Start accepts. Automaton has 23931 states and 73957 transitions. Word has length 57 [2019-12-27 20:30:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:30:26,612 INFO L462 AbstractCegarLoop]: Abstraction has 23931 states and 73957 transitions. [2019-12-27 20:30:26,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:30:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 23931 states and 73957 transitions. [2019-12-27 20:30:26,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:30:26,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:30:26,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:30:26,642 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:30:26,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:30:26,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2105231561, now seen corresponding path program 10 times [2019-12-27 20:30:26,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:30:26,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871379064] [2019-12-27 20:30:26,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:30:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:30:26,762 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 20:30:26,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871379064] [2019-12-27 20:30:26,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:30:26,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:30:26,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [23401181] [2019-12-27 20:30:26,763 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:30:26,779 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:30:26,957 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 288 transitions. [2019-12-27 20:30:26,958 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:30:26,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:30:27,058 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:30:27,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:30:27,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:30:27,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:30:27,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:30:27,059 INFO L87 Difference]: Start difference. First operand 23931 states and 73957 transitions. Second operand 11 states. [2019-12-27 20:30:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:30:29,794 INFO L93 Difference]: Finished difference Result 40361 states and 120679 transitions. [2019-12-27 20:30:29,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 20:30:29,795 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-12-27 20:30:29,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:30:29,854 INFO L225 Difference]: With dead ends: 40361 [2019-12-27 20:30:29,854 INFO L226 Difference]: Without dead ends: 40361 [2019-12-27 20:30:29,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=920, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 20:30:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40361 states. [2019-12-27 20:30:30,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40361 to 22752. [2019-12-27 20:30:30,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22752 states. [2019-12-27 20:30:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22752 states to 22752 states and 70293 transitions. [2019-12-27 20:30:30,520 INFO L78 Accepts]: Start accepts. Automaton has 22752 states and 70293 transitions. Word has length 57 [2019-12-27 20:30:30,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:30:30,521 INFO L462 AbstractCegarLoop]: Abstraction has 22752 states and 70293 transitions. [2019-12-27 20:30:30,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:30:30,521 INFO L276 IsEmpty]: Start isEmpty. Operand 22752 states and 70293 transitions. [2019-12-27 20:30:30,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:30:30,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:30:30,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:30:30,544 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:30:30,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:30:30,545 INFO L82 PathProgramCache]: Analyzing trace with hash -87684039, now seen corresponding path program 11 times [2019-12-27 20:30:30,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:30:30,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895968730] [2019-12-27 20:30:30,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:30:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:30:30,667 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 20:30:30,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895968730] [2019-12-27 20:30:30,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:30:30,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:30:30,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1913837679] [2019-12-27 20:30:30,668 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:30:30,688 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:30:31,079 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 349 states and 605 transitions. [2019-12-27 20:30:31,079 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:30:31,350 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 20:30:31,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 20:30:31,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:30:31,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 20:30:31,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:30:31,352 INFO L87 Difference]: Start difference. First operand 22752 states and 70293 transitions. Second operand 13 states. [2019-12-27 20:30:36,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:30:36,247 INFO L93 Difference]: Finished difference Result 65741 states and 198613 transitions. [2019-12-27 20:30:36,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 20:30:36,248 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 20:30:36,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:30:36,351 INFO L225 Difference]: With dead ends: 65741 [2019-12-27 20:30:36,351 INFO L226 Difference]: Without dead ends: 65621 [2019-12-27 20:30:36,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=411, Invalid=1311, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 20:30:36,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65621 states. [2019-12-27 20:30:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65621 to 22428. [2019-12-27 20:30:37,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22428 states. [2019-12-27 20:30:37,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22428 states to 22428 states and 69309 transitions. [2019-12-27 20:30:37,089 INFO L78 Accepts]: Start accepts. Automaton has 22428 states and 69309 transitions. Word has length 57 [2019-12-27 20:30:37,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:30:37,090 INFO L462 AbstractCegarLoop]: Abstraction has 22428 states and 69309 transitions. [2019-12-27 20:30:37,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 20:30:37,090 INFO L276 IsEmpty]: Start isEmpty. Operand 22428 states and 69309 transitions. [2019-12-27 20:30:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:30:37,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:30:37,117 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:30:37,117 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:30:37,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:30:37,117 INFO L82 PathProgramCache]: Analyzing trace with hash 769055305, now seen corresponding path program 12 times [2019-12-27 20:30:37,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:30:37,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311000189] [2019-12-27 20:30:37,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:30:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:30:37,193 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 20:30:37,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311000189] [2019-12-27 20:30:37,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:30:37,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:30:37,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [846592710] [2019-12-27 20:30:37,194 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:30:37,209 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:30:37,883 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 375 states and 655 transitions. [2019-12-27 20:30:37,884 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:30:37,884 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:30:37,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:30:37,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:30:37,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:30:37,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:30:37,891 INFO L87 Difference]: Start difference. First operand 22428 states and 69309 transitions. Second operand 3 states. [2019-12-27 20:30:37,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:30:37,997 INFO L93 Difference]: Finished difference Result 22428 states and 69307 transitions. [2019-12-27 20:30:37,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:30:37,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 20:30:37,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:30:38,042 INFO L225 Difference]: With dead ends: 22428 [2019-12-27 20:30:38,042 INFO L226 Difference]: Without dead ends: 22428 [2019-12-27 20:30:38,044 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 20:30:38,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22428 states. [2019-12-27 20:30:38,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22428 to 20473. [2019-12-27 20:30:38,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20473 states. [2019-12-27 20:30:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20473 states to 20473 states and 64055 transitions. [2019-12-27 20:30:38,408 INFO L78 Accepts]: Start accepts. Automaton has 20473 states and 64055 transitions. Word has length 57 [2019-12-27 20:30:38,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:30:38,409 INFO L462 AbstractCegarLoop]: Abstraction has 20473 states and 64055 transitions. [2019-12-27 20:30:38,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:30:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 20473 states and 64055 transitions. [2019-12-27 20:30:38,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 20:30:38,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:30:38,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:30:38,434 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:30:38,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:30:38,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1000017382, now seen corresponding path program 1 times [2019-12-27 20:30:38,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:30:38,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987211676] [2019-12-27 20:30:38,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:30:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:30:38,491 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 20:30:38,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987211676] [2019-12-27 20:30:38,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:30:38,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:30:38,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [92259828] [2019-12-27 20:30:38,492 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:30:38,509 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:30:38,712 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 193 states and 267 transitions. [2019-12-27 20:30:38,713 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:30:38,713 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:30:38,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:30:38,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:30:38,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:30:38,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:30:38,715 INFO L87 Difference]: Start difference. First operand 20473 states and 64055 transitions. Second operand 3 states. [2019-12-27 20:30:38,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:30:38,838 INFO L93 Difference]: Finished difference Result 15891 states and 49413 transitions. [2019-12-27 20:30:38,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:30:38,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 20:30:38,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:30:38,880 INFO L225 Difference]: With dead ends: 15891 [2019-12-27 20:30:38,880 INFO L226 Difference]: Without dead ends: 15891 [2019-12-27 20:30:38,881 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 20:30:39,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15891 states. [2019-12-27 20:30:39,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15891 to 15496. [2019-12-27 20:30:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15496 states. [2019-12-27 20:30:39,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15496 states to 15496 states and 48206 transitions. [2019-12-27 20:30:39,348 INFO L78 Accepts]: Start accepts. Automaton has 15496 states and 48206 transitions. Word has length 58 [2019-12-27 20:30:39,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:30:39,349 INFO L462 AbstractCegarLoop]: Abstraction has 15496 states and 48206 transitions. [2019-12-27 20:30:39,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:30:39,349 INFO L276 IsEmpty]: Start isEmpty. Operand 15496 states and 48206 transitions. [2019-12-27 20:30:39,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 20:30:39,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:30:39,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:30:39,379 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:30:39,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:30:39,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1487548287, now seen corresponding path program 1 times [2019-12-27 20:30:39,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:30:39,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178904062] [2019-12-27 20:30:39,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:30:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:30:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:30:39,532 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:30:39,532 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:30:39,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] ULTIMATE.startENTRY-->L846: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t613~0.base_27|)) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_20) (= v_~y~0_23 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= 0 v_~__unbuffered_p3_EAX~0_15) (= v_~y$r_buff0_thd1~0_10 0) (= v_~z~0_18 0) (= 0 v_~y$w_buff1~0_24) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t613~0.base_27| 4)) (= v_~a~0_11 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~__unbuffered_p1_EBX~0_15 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_71 0) (= 0 |v_ULTIMATE.start_main_~#t613~0.offset_20|) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~weak$$choice2~0_34) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$r_buff0_thd3~0_28 0) (= v_~y$r_buff0_thd4~0_21 0) (= 0 v_~y$flush_delayed~0_13) (= v_~y$r_buff1_thd1~0_9 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$r_buff0_thd0~0_20 0) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t613~0.base_27| 1)) (= v_~y$w_buff1_used~0_68 0) (= 0 |v_#NULL.base_4|) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t613~0.base_27| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t613~0.base_27|) |v_ULTIMATE.start_main_~#t613~0.offset_20| 0)) |v_#memory_int_29|) (= v_~x~0_18 0) (= 0 v_~__unbuffered_cnt~0_27) (= v_~y$w_buff0_used~0_106 0) (= 0 v_~__unbuffered_p3_EBX~0_15) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t613~0.base_27|) (= 0 v_~y$w_buff0~0_25) (= |v_#NULL.offset_4| 0) (= v_~y$mem_tmp~0_10 0) (= 0 v_~y$r_buff1_thd2~0_42) (= 0 v_~y$r_buff1_thd4~0_18))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t615~0.offset=|v_ULTIMATE.start_main_~#t615~0.offset_20|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, ULTIMATE.start_main_~#t616~0.base=|v_ULTIMATE.start_main_~#t616~0.base_19|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t613~0.base=|v_ULTIMATE.start_main_~#t613~0.base_27|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_15, #length=|v_#length_31|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_71, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_18, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t615~0.base=|v_ULTIMATE.start_main_~#t615~0.base_27|, ULTIMATE.start_main_~#t616~0.offset=|v_ULTIMATE.start_main_~#t616~0.offset_17|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ~y~0=v_~y~0_23, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ULTIMATE.start_main_~#t613~0.offset=|v_ULTIMATE.start_main_~#t613~0.offset_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_15, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_71|, ULTIMATE.start_main_~#t614~0.offset=|v_ULTIMATE.start_main_~#t614~0.offset_20|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_18, ULTIMATE.start_main_~#t614~0.base=|v_ULTIMATE.start_main_~#t614~0.base_27|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t615~0.offset, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t616~0.base, #NULL.offset, ULTIMATE.start_main_~#t613~0.base, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t615~0.base, ULTIMATE.start_main_~#t616~0.offset, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t613~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ULTIMATE.start_main_~#t614~0.offset, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t614~0.base, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:30:39,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L846-1-->L848: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t614~0.offset_10|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t614~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t614~0.base_12|) |v_ULTIMATE.start_main_~#t614~0.offset_10| 1)) |v_#memory_int_17|) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t614~0.base_12| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t614~0.base_12|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t614~0.base_12| 4) |v_#length_19|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t614~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t614~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t614~0.offset=|v_ULTIMATE.start_main_~#t614~0.offset_10|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_19|, ULTIMATE.start_main_~#t614~0.base=|v_ULTIMATE.start_main_~#t614~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t614~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t614~0.base] because there is no mapped edge [2019-12-27 20:30:39,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L848-1-->L850: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t615~0.base_13|)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t615~0.base_13|) 0) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t615~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t615~0.offset_11|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t615~0.base_13|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t615~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t615~0.base_13|) |v_ULTIMATE.start_main_~#t615~0.offset_11| 2)) |v_#memory_int_21|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t615~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t615~0.base=|v_ULTIMATE.start_main_~#t615~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t615~0.offset=|v_ULTIMATE.start_main_~#t615~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t615~0.base, ULTIMATE.start_main_~#t615~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 20:30:39,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L4-->L800: Formula: (and (= v_~y$r_buff0_thd3~0_17 1) (= 1 v_~z~0_6) (= v_~y$r_buff0_thd3~0_18 v_~y$r_buff1_thd3~0_11) (= v_~y$r_buff0_thd2~0_46 v_~y$r_buff1_thd2~0_26) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_11) (= v_~y$r_buff0_thd4~0_15 v_~y$r_buff1_thd4~0_11) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_46, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_11, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_11, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_17, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_46, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6, ~z~0=v_~z~0_6, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 20:30:39,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L850-1-->L852: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t616~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t616~0.base_10|) |v_ULTIMATE.start_main_~#t616~0.offset_10| 3)) |v_#memory_int_15|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t616~0.base_10| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t616~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t616~0.offset_10| 0) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t616~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t616~0.base_10|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t616~0.base_10| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t616~0.offset=|v_ULTIMATE.start_main_~#t616~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t616~0.base=|v_ULTIMATE.start_main_~#t616~0.base_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t616~0.offset, ULTIMATE.start_main_#t~nondet40, #valid, #memory_int, ULTIMATE.start_main_~#t616~0.base, #length] because there is no mapped edge [2019-12-27 20:30:39,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 1 v_~a~0_6) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~x~0_8) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_8, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 20:30:39,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L823-2-->L823-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-318671800 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd4~0_In-318671800 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-318671800 |P3Thread1of1ForFork0_#t~ite32_Out-318671800|)) (and (or .cse1 .cse0) (= ~y~0_In-318671800 |P3Thread1of1ForFork0_#t~ite32_Out-318671800|)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-318671800, ~y$w_buff1~0=~y$w_buff1~0_In-318671800, ~y~0=~y~0_In-318671800, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-318671800} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-318671800, ~y$w_buff1~0=~y$w_buff1~0_In-318671800, ~y~0=~y~0_In-318671800, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-318671800|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-318671800} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 20:30:39,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L823-4-->L824: Formula: (= v_~y~0_17 |v_P3Thread1of1ForFork0_#t~ite32_8|) InVars {P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_8|} OutVars{~y~0=v_~y~0_17, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_7|, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_7|} AuxVars[] AssignedVars[~y~0, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 20:30:39,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1160347643 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-1160347643 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out-1160347643| 0) (not .cse0) (not .cse1)) (and (= |P3Thread1of1ForFork0_#t~ite34_Out-1160347643| ~y$w_buff0_used~0_In-1160347643) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1160347643, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1160347643} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1160347643, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1160347643, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-1160347643|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 20:30:39,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-517342361 256)))) (or (and .cse0 (= ~y$w_buff0~0_In-517342361 |P1Thread1of1ForFork2_#t~ite8_Out-517342361|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-517342361 256)))) (or (= (mod ~y$w_buff0_used~0_In-517342361 256) 0) (and (= (mod ~y$w_buff1_used~0_In-517342361 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In-517342361 256)) .cse1))) (= |P1Thread1of1ForFork2_#t~ite8_Out-517342361| |P1Thread1of1ForFork2_#t~ite9_Out-517342361|)) (and (= ~y$w_buff0~0_In-517342361 |P1Thread1of1ForFork2_#t~ite9_Out-517342361|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite8_In-517342361| |P1Thread1of1ForFork2_#t~ite8_Out-517342361|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-517342361, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-517342361, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-517342361|, ~y$w_buff0~0=~y$w_buff0~0_In-517342361, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-517342361, ~weak$$choice2~0=~weak$$choice2~0_In-517342361, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-517342361} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-517342361, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-517342361|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-517342361, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-517342361|, ~y$w_buff0~0=~y$w_buff0~0_In-517342361, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-517342361, ~weak$$choice2~0=~weak$$choice2~0_In-517342361, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-517342361} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 20:30:39,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In209018167 256)))) (or (and .cse0 (= ~y$w_buff0_used~0_In209018167 |P1Thread1of1ForFork2_#t~ite14_Out209018167|) (= |P1Thread1of1ForFork2_#t~ite15_Out209018167| |P1Thread1of1ForFork2_#t~ite14_Out209018167|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In209018167 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In209018167 256)) (and (= 0 (mod ~y$w_buff1_used~0_In209018167 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In209018167 256)) .cse1)))) (and (= |P1Thread1of1ForFork2_#t~ite14_In209018167| |P1Thread1of1ForFork2_#t~ite14_Out209018167|) (not .cse0) (= ~y$w_buff0_used~0_In209018167 |P1Thread1of1ForFork2_#t~ite15_Out209018167|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In209018167, ~y$w_buff0_used~0=~y$w_buff0_used~0_In209018167, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In209018167, ~weak$$choice2~0=~weak$$choice2~0_In209018167, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In209018167|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In209018167} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In209018167, ~y$w_buff0_used~0=~y$w_buff0_used~0_In209018167, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In209018167, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out209018167|, ~weak$$choice2~0=~weak$$choice2~0_In209018167, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out209018167|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In209018167} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 20:30:39,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L768-->L769: Formula: (and (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff0_thd2~0_56) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 20:30:39,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L769-->L769-8: Formula: (let ((.cse4 (= |P1Thread1of1ForFork2_#t~ite24_Out213025910| |P1Thread1of1ForFork2_#t~ite23_Out213025910|)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In213025910 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In213025910 256) 0)) (.cse5 (= 0 (mod ~weak$$choice2~0_In213025910 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In213025910 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In213025910 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite22_In213025910| |P1Thread1of1ForFork2_#t~ite22_Out213025910|) (or (and (= |P1Thread1of1ForFork2_#t~ite23_Out213025910| ~y$r_buff1_thd2~0_In213025910) (or .cse0 (and .cse1 .cse2) (and .cse3 .cse1)) .cse4 .cse5) (and (not .cse5) (= |P1Thread1of1ForFork2_#t~ite23_Out213025910| |P1Thread1of1ForFork2_#t~ite23_In213025910|) (= |P1Thread1of1ForFork2_#t~ite24_Out213025910| ~y$r_buff1_thd2~0_In213025910)))) (let ((.cse6 (not .cse1))) (and (= |P1Thread1of1ForFork2_#t~ite22_Out213025910| 0) (= |P1Thread1of1ForFork2_#t~ite23_Out213025910| |P1Thread1of1ForFork2_#t~ite22_Out213025910|) .cse4 (or (not .cse3) .cse6) (not .cse0) .cse5 (or .cse6 (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In213025910, ~y$w_buff0_used~0=~y$w_buff0_used~0_In213025910, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In213025910, P1Thread1of1ForFork2_#t~ite22=|P1Thread1of1ForFork2_#t~ite22_In213025910|, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In213025910|, ~weak$$choice2~0=~weak$$choice2~0_In213025910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In213025910} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In213025910, ~y$w_buff0_used~0=~y$w_buff0_used~0_In213025910, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In213025910, P1Thread1of1ForFork2_#t~ite22=|P1Thread1of1ForFork2_#t~ite22_Out213025910|, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out213025910|, ~weak$$choice2~0=~weak$$choice2~0_In213025910, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out213025910|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In213025910} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite22, P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 20:30:39,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L825-->L825-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-151376607 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In-151376607 256))) (.cse1 (= (mod ~y$r_buff0_thd4~0_In-151376607 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-151376607 256)))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite35_Out-151376607|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-151376607 |P3Thread1of1ForFork0_#t~ite35_Out-151376607|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-151376607, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-151376607, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-151376607, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-151376607} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-151376607, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-151376607, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-151376607, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-151376607|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-151376607} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-27 20:30:39,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L779: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_14 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_14, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 20:30:39,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-843266156 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-843266156 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out-843266156| 0)) (and (= |P2Thread1of1ForFork3_#t~ite28_Out-843266156| ~y$w_buff0_used~0_In-843266156) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-843266156, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-843266156} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-843266156, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-843266156, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-843266156|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-27 20:30:39,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1989106534 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1989106534 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1989106534 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-1989106534 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite29_Out-1989106534| ~y$w_buff1_used~0_In-1989106534)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-1989106534|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1989106534, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1989106534, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1989106534, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1989106534} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1989106534, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1989106534, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1989106534, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-1989106534|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1989106534} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-27 20:30:39,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L803-->L804: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-369265340 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-369265340 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out-369265340 ~y$r_buff0_thd3~0_In-369265340)) (and (not .cse1) (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out-369265340)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-369265340, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-369265340} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-369265340|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-369265340, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-369265340} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 20:30:39,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-2115090384 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2115090384 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-2115090384 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2115090384 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite31_Out-2115090384| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite31_Out-2115090384| ~y$r_buff1_thd3~0_In-2115090384) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2115090384, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2115090384, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2115090384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2115090384} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2115090384, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2115090384, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2115090384, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-2115090384|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2115090384} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 20:30:39,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L804-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= |v_P2Thread1of1ForFork3_#t~ite31_8| v_~y$r_buff1_thd3~0_16)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 20:30:39,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd4~0_In-33560930 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-33560930 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-33560930|) (not .cse1)) (and (= ~y$r_buff0_thd4~0_In-33560930 |P3Thread1of1ForFork0_#t~ite36_Out-33560930|) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-33560930, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-33560930} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-33560930, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-33560930, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-33560930|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-27 20:30:39,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L827-->L827-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-66441638 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd4~0_In-66441638 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-66441638 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-66441638 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite37_Out-66441638| 0)) (and (= ~y$r_buff1_thd4~0_In-66441638 |P3Thread1of1ForFork0_#t~ite37_Out-66441638|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-66441638, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-66441638, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-66441638, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-66441638} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-66441638, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-66441638, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-66441638, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-66441638|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-66441638} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-27 20:30:39,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L827-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= |v_P3Thread1of1ForFork0_#t~ite37_8| v_~y$r_buff1_thd4~0_13)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:30:39,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L852-1-->L858: Formula: (and (= 4 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:30:39,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L858-2-->L858-5: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In473817066 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In473817066 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite43_Out473817066| |ULTIMATE.start_main_#t~ite42_Out473817066|))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out473817066| ~y$w_buff1~0_In473817066) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite42_Out473817066| ~y~0_In473817066)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In473817066, ~y~0=~y~0_In473817066, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In473817066, ~y$w_buff1_used~0=~y$w_buff1_used~0_In473817066} OutVars{~y$w_buff1~0=~y$w_buff1~0_In473817066, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out473817066|, ~y~0=~y~0_In473817066, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out473817066|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In473817066, ~y$w_buff1_used~0=~y$w_buff1_used~0_In473817066} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:30:39,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L859-->L859-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-982880399 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-982880399 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-982880399|) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-982880399| ~y$w_buff0_used~0_In-982880399)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-982880399, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-982880399} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-982880399, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-982880399, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-982880399|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:30:39,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L860-->L860-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1816884098 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1816884098 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1816884098 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1816884098 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1816884098| ~y$w_buff1_used~0_In-1816884098)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1816884098| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1816884098, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1816884098, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1816884098, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1816884098} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1816884098, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1816884098, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1816884098, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1816884098|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1816884098} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:30:39,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L861-->L861-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In87584844 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In87584844 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite46_Out87584844|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In87584844 |ULTIMATE.start_main_#t~ite46_Out87584844|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In87584844, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In87584844} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In87584844, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In87584844, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out87584844|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 20:30:39,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L862-->L862-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1698835617 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1698835617 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1698835617 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1698835617 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-1698835617| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite47_Out-1698835617| ~y$r_buff1_thd0~0_In-1698835617)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1698835617, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1698835617, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1698835617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1698835617} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1698835617, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1698835617, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1698835617|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1698835617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1698835617} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 20:30:39,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L862-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~z~0_11 2) (= 2 v_~__unbuffered_p1_EAX~0_7) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 2 v_~__unbuffered_p3_EAX~0_8) (= 0 v_~__unbuffered_p3_EBX~0_8) (= |v_ULTIMATE.start_main_#t~ite47_13| v_~y$r_buff1_thd0~0_17) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, ~z~0=v_~z~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z~0=v_~z~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:30:39,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:30:39 BasicIcfg [2019-12-27 20:30:39,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:30:39,695 INFO L168 Benchmark]: Toolchain (without parser) took 146072.72 ms. Allocated memory was 146.3 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 102.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 20:30:39,696 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 20:30:39,696 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.22 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 154.5 MB in the end (delta: -52.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:30:39,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.52 ms. Allocated memory is still 203.4 MB. Free memory was 154.5 MB in the beginning and 151.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:30:39,698 INFO L168 Benchmark]: Boogie Preprocessor took 42.51 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 149.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:30:39,704 INFO L168 Benchmark]: RCFGBuilder took 800.34 ms. Allocated memory is still 203.4 MB. Free memory was 149.3 MB in the beginning and 100.1 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-27 20:30:39,704 INFO L168 Benchmark]: TraceAbstraction took 144348.45 ms. Allocated memory was 203.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 20:30:39,707 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 807.22 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 154.5 MB in the end (delta: -52.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.52 ms. Allocated memory is still 203.4 MB. Free memory was 154.5 MB in the beginning and 151.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.51 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 149.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 800.34 ms. Allocated memory is still 203.4 MB. Free memory was 149.3 MB in the beginning and 100.1 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 144348.45 ms. Allocated memory was 203.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 181 ProgramPointsBefore, 88 ProgramPointsAfterwards, 209 TransitionsBefore, 94 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 27 ChoiceCompositions, 7815 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68763 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L846] FCALL, FORK 0 pthread_create(&t613, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t614, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] FCALL, FORK 0 pthread_create(&t615, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 3 y$w_buff1 = y$w_buff0 [L785] 3 y$w_buff0 = 1 [L786] 3 y$w_buff1_used = y$w_buff0_used [L787] 3 y$w_buff0_used = (_Bool)1 [L852] FCALL, FORK 0 pthread_create(&t616, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 4 z = 2 [L817] 4 __unbuffered_p3_EAX = z [L820] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 2 x = 2 [L756] 2 __unbuffered_p1_EAX = x [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 y$flush_delayed = weak$$choice2 [L762] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L764] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L765] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L766] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L858] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 143.9s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 39.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4607 SDtfs, 8839 SDslu, 15692 SDs, 0 SdLazy, 13806 SolverSat, 733 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 560 GetRequests, 135 SyntacticMatches, 62 SemanticMatches, 363 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7491 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166438occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 56.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 287003 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1064 NumberOfCodeBlocks, 1064 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 982 ConstructedInterpolants, 0 QuantifiedInterpolants, 155686 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...