/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:18:37,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:18:37,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:18:37,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:18:37,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:18:37,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:18:37,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:18:37,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:18:37,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:18:37,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:18:37,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:18:37,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:18:37,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:18:37,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:18:37,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:18:37,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:18:37,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:18:37,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:18:37,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:18:37,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:18:37,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:18:37,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:18:37,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:18:37,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:18:37,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:18:37,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:18:37,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:18:37,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:18:37,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:18:37,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:18:37,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:18:37,389 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:18:37,390 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:18:37,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:18:37,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:18:37,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:18:37,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:18:37,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:18:37,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:18:37,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:18:37,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:18:37,402 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-SemanticLbe.epf [2019-12-27 02:18:37,441 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:18:37,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:18:37,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:18:37,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:18:37,445 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:18:37,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:18:37,446 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:18:37,449 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:18:37,449 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:18:37,449 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:18:37,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:18:37,450 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:18:37,450 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:18:37,450 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:18:37,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:18:37,450 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:18:37,451 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:18:37,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:18:37,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:18:37,451 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:18:37,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:18:37,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:18:37,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:18:37,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:18:37,455 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:18:37,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:18:37,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:18:37,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:18:37,456 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:18:37,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:18:37,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:18:37,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:18:37,757 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:18:37,757 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:18:37,758 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_power.oepc.i [2019-12-27 02:18:37,826 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8615daab5/4178d61b4ab8414b955de4d256c0d341/FLAG17250fd4c [2019-12-27 02:18:38,413 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:18:38,413 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.oepc.i [2019-12-27 02:18:38,430 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8615daab5/4178d61b4ab8414b955de4d256c0d341/FLAG17250fd4c [2019-12-27 02:18:38,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8615daab5/4178d61b4ab8414b955de4d256c0d341 [2019-12-27 02:18:38,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:18:38,751 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:18:38,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:18:38,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:18:38,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:18:38,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:18:38" (1/1) ... [2019-12-27 02:18:38,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f87c4eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:38, skipping insertion in model container [2019-12-27 02:18:38,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:18:38" (1/1) ... [2019-12-27 02:18:38,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:18:38,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:18:39,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:18:39,372 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:18:39,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:18:39,516 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:18:39,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:39 WrapperNode [2019-12-27 02:18:39,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:18:39,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:18:39,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:18:39,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:18:39,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:39" (1/1) ... [2019-12-27 02:18:39,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:39" (1/1) ... [2019-12-27 02:18:39,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:18:39,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:18:39,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:18:39,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:18:39,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:39" (1/1) ... [2019-12-27 02:18:39,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:39" (1/1) ... [2019-12-27 02:18:39,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:39" (1/1) ... [2019-12-27 02:18:39,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:39" (1/1) ... [2019-12-27 02:18:39,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:39" (1/1) ... [2019-12-27 02:18:39,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:39" (1/1) ... [2019-12-27 02:18:39,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:39" (1/1) ... [2019-12-27 02:18:39,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:18:39,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:18:39,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:18:39,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:18:39,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:39" (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 02:18:39,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:18:39,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:18:39,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:18:39,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:18:39,695 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:18:39,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:18:39,696 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:18:39,696 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:18:39,696 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:18:39,696 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:18:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:18:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:18:39,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:18:39,699 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 02:18:40,498 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:18:40,498 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:18:40,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:18:40 BoogieIcfgContainer [2019-12-27 02:18:40,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:18:40,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:18:40,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:18:40,505 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:18:40,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:18:38" (1/3) ... [2019-12-27 02:18:40,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9ccf18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:18:40, skipping insertion in model container [2019-12-27 02:18:40,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:39" (2/3) ... [2019-12-27 02:18:40,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9ccf18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:18:40, skipping insertion in model container [2019-12-27 02:18:40,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:18:40" (3/3) ... [2019-12-27 02:18:40,509 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_power.oepc.i [2019-12-27 02:18:40,520 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:18:40,520 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:18:40,529 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:18:40,530 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:18:40,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,578 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,578 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,579 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,579 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,580 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,604 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,604 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,612 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,612 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,640 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,643 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,650 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,651 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,651 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,657 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,657 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:40,676 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:18:40,697 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:18:40,697 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:18:40,697 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:18:40,698 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:18:40,698 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:18:40,698 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:18:40,698 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:18:40,698 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:18:40,715 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 02:18:40,717 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 02:18:40,823 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 02:18:40,823 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:18:40,843 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:18:40,867 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 02:18:40,923 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 02:18:40,923 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:18:40,932 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:18:40,953 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 02:18:40,955 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:18:46,362 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 02:18:46,480 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 02:18:46,622 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83880 [2019-12-27 02:18:46,622 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 02:18:46,626 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-27 02:19:04,819 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118052 states. [2019-12-27 02:19:04,820 INFO L276 IsEmpty]: Start isEmpty. Operand 118052 states. [2019-12-27 02:19:04,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:19:04,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:04,827 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:19:04,828 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:04,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:04,833 INFO L82 PathProgramCache]: Analyzing trace with hash 918883, now seen corresponding path program 1 times [2019-12-27 02:19:04,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:04,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720368506] [2019-12-27 02:19:04,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:05,033 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 02:19:05,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720368506] [2019-12-27 02:19:05,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:05,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:19:05,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377324886] [2019-12-27 02:19:05,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:19:05,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:05,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:19:05,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:19:05,062 INFO L87 Difference]: Start difference. First operand 118052 states. Second operand 3 states. [2019-12-27 02:19:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:08,343 INFO L93 Difference]: Finished difference Result 117122 states and 502402 transitions. [2019-12-27 02:19:08,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:19:08,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:19:08,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:08,998 INFO L225 Difference]: With dead ends: 117122 [2019-12-27 02:19:08,998 INFO L226 Difference]: Without dead ends: 109842 [2019-12-27 02:19:09,000 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 02:19:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109842 states. [2019-12-27 02:19:20,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109842 to 109842. [2019-12-27 02:19:20,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109842 states. [2019-12-27 02:19:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109842 states to 109842 states and 470538 transitions. [2019-12-27 02:19:20,700 INFO L78 Accepts]: Start accepts. Automaton has 109842 states and 470538 transitions. Word has length 3 [2019-12-27 02:19:20,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:20,700 INFO L462 AbstractCegarLoop]: Abstraction has 109842 states and 470538 transitions. [2019-12-27 02:19:20,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:19:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 109842 states and 470538 transitions. [2019-12-27 02:19:20,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:19:20,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:20,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:20,706 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:20,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:20,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1326055600, now seen corresponding path program 1 times [2019-12-27 02:19:20,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:20,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397765200] [2019-12-27 02:19:20,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:20,894 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 02:19:20,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397765200] [2019-12-27 02:19:20,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:20,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:19:20,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399853724] [2019-12-27 02:19:20,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:19:20,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:20,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:19:20,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:19:20,897 INFO L87 Difference]: Start difference. First operand 109842 states and 470538 transitions. Second operand 4 states. [2019-12-27 02:19:26,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:26,781 INFO L93 Difference]: Finished difference Result 170700 states and 702967 transitions. [2019-12-27 02:19:26,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:19:26,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:19:26,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:27,426 INFO L225 Difference]: With dead ends: 170700 [2019-12-27 02:19:27,426 INFO L226 Difference]: Without dead ends: 170651 [2019-12-27 02:19:27,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:19:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170651 states. [2019-12-27 02:19:37,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170651 to 155174. [2019-12-27 02:19:37,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155174 states. [2019-12-27 02:19:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155174 states to 155174 states and 647977 transitions. [2019-12-27 02:19:37,674 INFO L78 Accepts]: Start accepts. Automaton has 155174 states and 647977 transitions. Word has length 11 [2019-12-27 02:19:37,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:37,674 INFO L462 AbstractCegarLoop]: Abstraction has 155174 states and 647977 transitions. [2019-12-27 02:19:37,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:19:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 155174 states and 647977 transitions. [2019-12-27 02:19:37,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:19:37,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:37,680 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:37,680 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:37,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:37,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1447855061, now seen corresponding path program 1 times [2019-12-27 02:19:37,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:37,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777081815] [2019-12-27 02:19:37,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:37,773 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 02:19:37,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777081815] [2019-12-27 02:19:37,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:37,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:19:37,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642952854] [2019-12-27 02:19:37,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:19:37,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:37,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:19:37,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:19:37,776 INFO L87 Difference]: Start difference. First operand 155174 states and 647977 transitions. Second operand 3 states. [2019-12-27 02:19:37,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:37,899 INFO L93 Difference]: Finished difference Result 33806 states and 110729 transitions. [2019-12-27 02:19:37,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:19:37,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:19:37,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:37,958 INFO L225 Difference]: With dead ends: 33806 [2019-12-27 02:19:37,958 INFO L226 Difference]: Without dead ends: 33806 [2019-12-27 02:19:37,959 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 02:19:38,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33806 states. [2019-12-27 02:19:43,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33806 to 33806. [2019-12-27 02:19:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33806 states. [2019-12-27 02:19:43,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33806 states to 33806 states and 110729 transitions. [2019-12-27 02:19:43,475 INFO L78 Accepts]: Start accepts. Automaton has 33806 states and 110729 transitions. Word has length 13 [2019-12-27 02:19:43,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:43,475 INFO L462 AbstractCegarLoop]: Abstraction has 33806 states and 110729 transitions. [2019-12-27 02:19:43,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:19:43,476 INFO L276 IsEmpty]: Start isEmpty. Operand 33806 states and 110729 transitions. [2019-12-27 02:19:43,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:19:43,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:43,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:43,479 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:43,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:43,479 INFO L82 PathProgramCache]: Analyzing trace with hash 627665056, now seen corresponding path program 1 times [2019-12-27 02:19:43,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:43,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681031294] [2019-12-27 02:19:43,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:43,532 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 02:19:43,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681031294] [2019-12-27 02:19:43,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:43,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:19:43,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188789413] [2019-12-27 02:19:43,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:19:43,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:43,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:19:43,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:19:43,536 INFO L87 Difference]: Start difference. First operand 33806 states and 110729 transitions. Second operand 3 states. [2019-12-27 02:19:43,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:43,733 INFO L93 Difference]: Finished difference Result 52205 states and 169891 transitions. [2019-12-27 02:19:43,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:19:43,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 02:19:43,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:43,826 INFO L225 Difference]: With dead ends: 52205 [2019-12-27 02:19:43,827 INFO L226 Difference]: Without dead ends: 52205 [2019-12-27 02:19:43,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:19:44,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52205 states. [2019-12-27 02:19:44,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52205 to 38718. [2019-12-27 02:19:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38718 states. [2019-12-27 02:19:45,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38718 states to 38718 states and 127749 transitions. [2019-12-27 02:19:45,036 INFO L78 Accepts]: Start accepts. Automaton has 38718 states and 127749 transitions. Word has length 16 [2019-12-27 02:19:45,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:45,037 INFO L462 AbstractCegarLoop]: Abstraction has 38718 states and 127749 transitions. [2019-12-27 02:19:45,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:19:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 38718 states and 127749 transitions. [2019-12-27 02:19:45,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:19:45,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:45,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:45,040 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:45,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:45,041 INFO L82 PathProgramCache]: Analyzing trace with hash 712450242, now seen corresponding path program 1 times [2019-12-27 02:19:45,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:45,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441811328] [2019-12-27 02:19:45,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:45,154 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 02:19:45,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441811328] [2019-12-27 02:19:45,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:45,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:19:45,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636875993] [2019-12-27 02:19:45,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:19:45,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:45,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:19:45,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:19:45,156 INFO L87 Difference]: Start difference. First operand 38718 states and 127749 transitions. Second operand 4 states. [2019-12-27 02:19:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:45,487 INFO L93 Difference]: Finished difference Result 46485 states and 150983 transitions. [2019-12-27 02:19:45,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:19:45,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 02:19:45,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:45,561 INFO L225 Difference]: With dead ends: 46485 [2019-12-27 02:19:45,561 INFO L226 Difference]: Without dead ends: 46485 [2019-12-27 02:19:45,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:19:45,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46485 states. [2019-12-27 02:19:46,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46485 to 42622. [2019-12-27 02:19:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42622 states. [2019-12-27 02:19:46,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42622 states to 42622 states and 139503 transitions. [2019-12-27 02:19:46,318 INFO L78 Accepts]: Start accepts. Automaton has 42622 states and 139503 transitions. Word has length 16 [2019-12-27 02:19:46,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:46,318 INFO L462 AbstractCegarLoop]: Abstraction has 42622 states and 139503 transitions. [2019-12-27 02:19:46,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:19:46,318 INFO L276 IsEmpty]: Start isEmpty. Operand 42622 states and 139503 transitions. [2019-12-27 02:19:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:19:46,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:46,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:46,322 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:46,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:46,322 INFO L82 PathProgramCache]: Analyzing trace with hash 646000998, now seen corresponding path program 1 times [2019-12-27 02:19:46,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:46,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457679741] [2019-12-27 02:19:46,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:46,384 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 02:19:46,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457679741] [2019-12-27 02:19:46,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:46,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:19:46,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433230086] [2019-12-27 02:19:46,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:19:46,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:46,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:19:46,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:19:46,387 INFO L87 Difference]: Start difference. First operand 42622 states and 139503 transitions. Second operand 4 states. [2019-12-27 02:19:46,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:46,762 INFO L93 Difference]: Finished difference Result 51005 states and 165609 transitions. [2019-12-27 02:19:46,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:19:46,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 02:19:46,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:46,844 INFO L225 Difference]: With dead ends: 51005 [2019-12-27 02:19:46,844 INFO L226 Difference]: Without dead ends: 51005 [2019-12-27 02:19:46,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:19:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51005 states. [2019-12-27 02:19:47,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51005 to 44274. [2019-12-27 02:19:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44274 states. [2019-12-27 02:19:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44274 states to 44274 states and 144974 transitions. [2019-12-27 02:19:48,060 INFO L78 Accepts]: Start accepts. Automaton has 44274 states and 144974 transitions. Word has length 16 [2019-12-27 02:19:48,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:48,060 INFO L462 AbstractCegarLoop]: Abstraction has 44274 states and 144974 transitions. [2019-12-27 02:19:48,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:19:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 44274 states and 144974 transitions. [2019-12-27 02:19:48,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:19:48,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:48,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:48,071 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:48,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:48,071 INFO L82 PathProgramCache]: Analyzing trace with hash -2051800974, now seen corresponding path program 1 times [2019-12-27 02:19:48,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:48,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401006856] [2019-12-27 02:19:48,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:48,166 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 02:19:48,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401006856] [2019-12-27 02:19:48,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:48,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:19:48,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313942882] [2019-12-27 02:19:48,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:19:48,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:48,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:19:48,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:19:48,168 INFO L87 Difference]: Start difference. First operand 44274 states and 144974 transitions. Second operand 5 states. [2019-12-27 02:19:48,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:48,905 INFO L93 Difference]: Finished difference Result 60565 states and 193473 transitions. [2019-12-27 02:19:48,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:19:48,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 02:19:48,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:49,017 INFO L225 Difference]: With dead ends: 60565 [2019-12-27 02:19:49,017 INFO L226 Difference]: Without dead ends: 60558 [2019-12-27 02:19:49,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:19:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60558 states. [2019-12-27 02:19:50,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60558 to 45614. [2019-12-27 02:19:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45614 states. [2019-12-27 02:19:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45614 states to 45614 states and 149067 transitions. [2019-12-27 02:19:50,562 INFO L78 Accepts]: Start accepts. Automaton has 45614 states and 149067 transitions. Word has length 22 [2019-12-27 02:19:50,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:50,563 INFO L462 AbstractCegarLoop]: Abstraction has 45614 states and 149067 transitions. [2019-12-27 02:19:50,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:19:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 45614 states and 149067 transitions. [2019-12-27 02:19:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:19:50,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:50,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:50,573 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:50,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:50,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2118250218, now seen corresponding path program 1 times [2019-12-27 02:19:50,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:50,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294436643] [2019-12-27 02:19:50,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:50,652 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 02:19:50,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294436643] [2019-12-27 02:19:50,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:50,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:19:50,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670533117] [2019-12-27 02:19:50,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:19:50,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:50,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:19:50,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:19:50,654 INFO L87 Difference]: Start difference. First operand 45614 states and 149067 transitions. Second operand 5 states. [2019-12-27 02:19:51,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:51,328 INFO L93 Difference]: Finished difference Result 63360 states and 201880 transitions. [2019-12-27 02:19:51,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:19:51,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 02:19:51,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:51,437 INFO L225 Difference]: With dead ends: 63360 [2019-12-27 02:19:51,437 INFO L226 Difference]: Without dead ends: 63353 [2019-12-27 02:19:51,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:19:51,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63353 states. [2019-12-27 02:19:52,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63353 to 43925. [2019-12-27 02:19:52,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43925 states. [2019-12-27 02:19:52,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43925 states to 43925 states and 143672 transitions. [2019-12-27 02:19:52,391 INFO L78 Accepts]: Start accepts. Automaton has 43925 states and 143672 transitions. Word has length 22 [2019-12-27 02:19:52,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:52,392 INFO L462 AbstractCegarLoop]: Abstraction has 43925 states and 143672 transitions. [2019-12-27 02:19:52,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:19:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand 43925 states and 143672 transitions. [2019-12-27 02:19:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:19:52,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:52,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:52,405 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:52,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:52,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1701171988, now seen corresponding path program 1 times [2019-12-27 02:19:52,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:52,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583878651] [2019-12-27 02:19:52,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:52,453 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 02:19:52,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583878651] [2019-12-27 02:19:52,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:52,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:19:52,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562993970] [2019-12-27 02:19:52,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:19:52,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:52,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:19:52,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:19:52,456 INFO L87 Difference]: Start difference. First operand 43925 states and 143672 transitions. Second operand 4 states. [2019-12-27 02:19:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:52,536 INFO L93 Difference]: Finished difference Result 18121 states and 56197 transitions. [2019-12-27 02:19:52,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:19:52,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:19:52,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:52,565 INFO L225 Difference]: With dead ends: 18121 [2019-12-27 02:19:52,565 INFO L226 Difference]: Without dead ends: 18121 [2019-12-27 02:19:52,566 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 02:19:52,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18121 states. [2019-12-27 02:19:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18121 to 17758. [2019-12-27 02:19:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-27 02:19:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 55161 transitions. [2019-12-27 02:19:52,842 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 55161 transitions. Word has length 25 [2019-12-27 02:19:52,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:52,843 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 55161 transitions. [2019-12-27 02:19:52,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:19:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 55161 transitions. [2019-12-27 02:19:52,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:19:52,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:52,856 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:52,856 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:52,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:52,857 INFO L82 PathProgramCache]: Analyzing trace with hash -735951720, now seen corresponding path program 1 times [2019-12-27 02:19:52,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:52,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512593061] [2019-12-27 02:19:52,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:53,278 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 02:19:53,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512593061] [2019-12-27 02:19:53,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:53,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:19:53,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886265843] [2019-12-27 02:19:53,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:19:53,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:53,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:19:53,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:19:53,280 INFO L87 Difference]: Start difference. First operand 17758 states and 55161 transitions. Second operand 3 states. [2019-12-27 02:19:53,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:53,370 INFO L93 Difference]: Finished difference Result 23499 states and 69479 transitions. [2019-12-27 02:19:53,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:19:53,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 02:19:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:53,401 INFO L225 Difference]: With dead ends: 23499 [2019-12-27 02:19:53,401 INFO L226 Difference]: Without dead ends: 23499 [2019-12-27 02:19:53,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:19:53,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23499 states. [2019-12-27 02:19:53,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23499 to 17758. [2019-12-27 02:19:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-27 02:19:53,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 52847 transitions. [2019-12-27 02:19:53,696 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 52847 transitions. Word has length 27 [2019-12-27 02:19:53,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:53,696 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 52847 transitions. [2019-12-27 02:19:53,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:19:53,696 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 52847 transitions. [2019-12-27 02:19:53,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:19:53,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:53,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:53,709 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:53,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:53,709 INFO L82 PathProgramCache]: Analyzing trace with hash -963527987, now seen corresponding path program 1 times [2019-12-27 02:19:53,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:53,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126309521] [2019-12-27 02:19:53,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:53,792 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 02:19:53,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126309521] [2019-12-27 02:19:53,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:53,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:19:53,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579445943] [2019-12-27 02:19:53,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:19:53,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:53,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:19:53,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:19:53,795 INFO L87 Difference]: Start difference. First operand 17758 states and 52847 transitions. Second operand 5 states. [2019-12-27 02:19:54,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:54,189 INFO L93 Difference]: Finished difference Result 21964 states and 64554 transitions. [2019-12-27 02:19:54,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:19:54,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 02:19:54,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:54,230 INFO L225 Difference]: With dead ends: 21964 [2019-12-27 02:19:54,230 INFO L226 Difference]: Without dead ends: 21964 [2019-12-27 02:19:54,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:19:54,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21964 states. [2019-12-27 02:19:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21964 to 20594. [2019-12-27 02:19:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20594 states. [2019-12-27 02:19:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20594 states to 20594 states and 61091 transitions. [2019-12-27 02:19:54,605 INFO L78 Accepts]: Start accepts. Automaton has 20594 states and 61091 transitions. Word has length 27 [2019-12-27 02:19:54,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:54,605 INFO L462 AbstractCegarLoop]: Abstraction has 20594 states and 61091 transitions. [2019-12-27 02:19:54,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:19:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand 20594 states and 61091 transitions. [2019-12-27 02:19:54,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 02:19:54,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:54,620 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 02:19:54,620 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:54,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:54,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1072867226, now seen corresponding path program 1 times [2019-12-27 02:19:54,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:54,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887912283] [2019-12-27 02:19:54,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:54,728 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 02:19:54,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887912283] [2019-12-27 02:19:54,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:54,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:19:54,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965374715] [2019-12-27 02:19:54,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:19:54,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:54,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:19:54,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:19:54,730 INFO L87 Difference]: Start difference. First operand 20594 states and 61091 transitions. Second operand 5 states. [2019-12-27 02:19:54,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:54,843 INFO L93 Difference]: Finished difference Result 20911 states and 61888 transitions. [2019-12-27 02:19:54,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:19:54,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 02:19:54,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:54,870 INFO L225 Difference]: With dead ends: 20911 [2019-12-27 02:19:54,870 INFO L226 Difference]: Without dead ends: 20911 [2019-12-27 02:19:54,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:19:54,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20911 states. [2019-12-27 02:19:55,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20911 to 20911. [2019-12-27 02:19:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20911 states. [2019-12-27 02:19:55,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20911 states to 20911 states and 61888 transitions. [2019-12-27 02:19:55,166 INFO L78 Accepts]: Start accepts. Automaton has 20911 states and 61888 transitions. Word has length 28 [2019-12-27 02:19:55,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:55,166 INFO L462 AbstractCegarLoop]: Abstraction has 20911 states and 61888 transitions. [2019-12-27 02:19:55,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:19:55,166 INFO L276 IsEmpty]: Start isEmpty. Operand 20911 states and 61888 transitions. [2019-12-27 02:19:55,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 02:19:55,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:55,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:55,183 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:55,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:55,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1714199023, now seen corresponding path program 1 times [2019-12-27 02:19:55,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:55,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140728044] [2019-12-27 02:19:55,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:55,254 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 02:19:55,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140728044] [2019-12-27 02:19:55,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:55,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:19:55,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883219375] [2019-12-27 02:19:55,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:19:55,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:55,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:19:55,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:19:55,256 INFO L87 Difference]: Start difference. First operand 20911 states and 61888 transitions. Second operand 5 states. [2019-12-27 02:19:55,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:55,643 INFO L93 Difference]: Finished difference Result 24383 states and 71254 transitions. [2019-12-27 02:19:55,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:19:55,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 02:19:55,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:55,676 INFO L225 Difference]: With dead ends: 24383 [2019-12-27 02:19:55,676 INFO L226 Difference]: Without dead ends: 24383 [2019-12-27 02:19:55,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:19:55,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24383 states. [2019-12-27 02:19:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24383 to 21026. [2019-12-27 02:19:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21026 states. [2019-12-27 02:19:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21026 states to 21026 states and 62164 transitions. [2019-12-27 02:19:56,314 INFO L78 Accepts]: Start accepts. Automaton has 21026 states and 62164 transitions. Word has length 29 [2019-12-27 02:19:56,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:56,315 INFO L462 AbstractCegarLoop]: Abstraction has 21026 states and 62164 transitions. [2019-12-27 02:19:56,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:19:56,315 INFO L276 IsEmpty]: Start isEmpty. Operand 21026 states and 62164 transitions. [2019-12-27 02:19:56,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:19:56,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:56,334 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:56,335 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:56,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:56,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1459957021, now seen corresponding path program 1 times [2019-12-27 02:19:56,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:56,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32418391] [2019-12-27 02:19:56,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:56,428 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 02:19:56,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32418391] [2019-12-27 02:19:56,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:56,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:19:56,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133885604] [2019-12-27 02:19:56,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:19:56,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:56,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:19:56,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:19:56,430 INFO L87 Difference]: Start difference. First operand 21026 states and 62164 transitions. Second operand 6 states. [2019-12-27 02:19:57,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:57,188 INFO L93 Difference]: Finished difference Result 27860 states and 80966 transitions. [2019-12-27 02:19:57,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:19:57,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 02:19:57,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:57,227 INFO L225 Difference]: With dead ends: 27860 [2019-12-27 02:19:57,227 INFO L226 Difference]: Without dead ends: 27860 [2019-12-27 02:19:57,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:19:57,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27860 states. [2019-12-27 02:19:57,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27860 to 22078. [2019-12-27 02:19:57,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22078 states. [2019-12-27 02:19:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22078 states to 22078 states and 65194 transitions. [2019-12-27 02:19:57,599 INFO L78 Accepts]: Start accepts. Automaton has 22078 states and 65194 transitions. Word has length 33 [2019-12-27 02:19:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:57,599 INFO L462 AbstractCegarLoop]: Abstraction has 22078 states and 65194 transitions. [2019-12-27 02:19:57,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:19:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 22078 states and 65194 transitions. [2019-12-27 02:19:57,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 02:19:57,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:57,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:57,619 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:57,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:57,619 INFO L82 PathProgramCache]: Analyzing trace with hash -617380767, now seen corresponding path program 1 times [2019-12-27 02:19:57,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:57,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83311655] [2019-12-27 02:19:57,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:57,711 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 02:19:57,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83311655] [2019-12-27 02:19:57,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:57,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:19:57,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569812807] [2019-12-27 02:19:57,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:19:57,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:57,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:19:57,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:19:57,713 INFO L87 Difference]: Start difference. First operand 22078 states and 65194 transitions. Second operand 6 states. [2019-12-27 02:19:58,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:58,525 INFO L93 Difference]: Finished difference Result 27029 states and 78779 transitions. [2019-12-27 02:19:58,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:19:58,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-27 02:19:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:58,583 INFO L225 Difference]: With dead ends: 27029 [2019-12-27 02:19:58,583 INFO L226 Difference]: Without dead ends: 27029 [2019-12-27 02:19:58,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:19:58,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27029 states. [2019-12-27 02:19:58,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27029 to 19090. [2019-12-27 02:19:58,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19090 states. [2019-12-27 02:19:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19090 states to 19090 states and 56687 transitions. [2019-12-27 02:19:59,000 INFO L78 Accepts]: Start accepts. Automaton has 19090 states and 56687 transitions. Word has length 35 [2019-12-27 02:19:59,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:59,001 INFO L462 AbstractCegarLoop]: Abstraction has 19090 states and 56687 transitions. [2019-12-27 02:19:59,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:19:59,001 INFO L276 IsEmpty]: Start isEmpty. Operand 19090 states and 56687 transitions. [2019-12-27 02:19:59,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:19:59,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:59,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:59,018 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:59,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:59,019 INFO L82 PathProgramCache]: Analyzing trace with hash -282480739, now seen corresponding path program 1 times [2019-12-27 02:19:59,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:59,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230041793] [2019-12-27 02:19:59,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:59,069 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 02:19:59,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230041793] [2019-12-27 02:19:59,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:59,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:19:59,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853535590] [2019-12-27 02:19:59,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:19:59,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:59,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:19:59,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:19:59,071 INFO L87 Difference]: Start difference. First operand 19090 states and 56687 transitions. Second operand 3 states. [2019-12-27 02:19:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:59,149 INFO L93 Difference]: Finished difference Result 19089 states and 56685 transitions. [2019-12-27 02:19:59,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:19:59,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 02:19:59,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:59,179 INFO L225 Difference]: With dead ends: 19089 [2019-12-27 02:19:59,179 INFO L226 Difference]: Without dead ends: 19089 [2019-12-27 02:19:59,180 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 02:19:59,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19089 states. [2019-12-27 02:19:59,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19089 to 19089. [2019-12-27 02:19:59,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19089 states. [2019-12-27 02:19:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19089 states to 19089 states and 56685 transitions. [2019-12-27 02:19:59,463 INFO L78 Accepts]: Start accepts. Automaton has 19089 states and 56685 transitions. Word has length 39 [2019-12-27 02:19:59,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:59,463 INFO L462 AbstractCegarLoop]: Abstraction has 19089 states and 56685 transitions. [2019-12-27 02:19:59,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:19:59,463 INFO L276 IsEmpty]: Start isEmpty. Operand 19089 states and 56685 transitions. [2019-12-27 02:19:59,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:19:59,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:59,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:59,486 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:59,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:59,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1129418560, now seen corresponding path program 1 times [2019-12-27 02:19:59,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:59,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510491670] [2019-12-27 02:19:59,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:59,553 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 02:19:59,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510491670] [2019-12-27 02:19:59,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:59,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:19:59,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224993920] [2019-12-27 02:19:59,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:19:59,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:59,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:19:59,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:19:59,555 INFO L87 Difference]: Start difference. First operand 19089 states and 56685 transitions. Second operand 5 states. [2019-12-27 02:20:00,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:00,400 INFO L93 Difference]: Finished difference Result 27483 states and 80802 transitions. [2019-12-27 02:20:00,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:20:00,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 02:20:00,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:00,439 INFO L225 Difference]: With dead ends: 27483 [2019-12-27 02:20:00,439 INFO L226 Difference]: Without dead ends: 27483 [2019-12-27 02:20:00,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:20:00,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27483 states. [2019-12-27 02:20:00,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27483 to 25378. [2019-12-27 02:20:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25378 states. [2019-12-27 02:20:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25378 states to 25378 states and 75084 transitions. [2019-12-27 02:20:00,857 INFO L78 Accepts]: Start accepts. Automaton has 25378 states and 75084 transitions. Word has length 40 [2019-12-27 02:20:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:00,857 INFO L462 AbstractCegarLoop]: Abstraction has 25378 states and 75084 transitions. [2019-12-27 02:20:00,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:20:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 25378 states and 75084 transitions. [2019-12-27 02:20:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:20:00,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:00,882 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:00,882 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:00,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:00,882 INFO L82 PathProgramCache]: Analyzing trace with hash -554035702, now seen corresponding path program 2 times [2019-12-27 02:20:00,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:00,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036373277] [2019-12-27 02:20:00,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:00,964 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 02:20:00,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036373277] [2019-12-27 02:20:00,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:00,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:20:00,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428459290] [2019-12-27 02:20:00,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:20:00,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:00,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:20:00,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:00,966 INFO L87 Difference]: Start difference. First operand 25378 states and 75084 transitions. Second operand 3 states. [2019-12-27 02:20:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:01,074 INFO L93 Difference]: Finished difference Result 25378 states and 75005 transitions. [2019-12-27 02:20:01,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:20:01,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 02:20:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:01,113 INFO L225 Difference]: With dead ends: 25378 [2019-12-27 02:20:01,113 INFO L226 Difference]: Without dead ends: 25378 [2019-12-27 02:20:01,113 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 02:20:01,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25378 states. [2019-12-27 02:20:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25378 to 21127. [2019-12-27 02:20:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21127 states. [2019-12-27 02:20:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21127 states to 21127 states and 63266 transitions. [2019-12-27 02:20:01,468 INFO L78 Accepts]: Start accepts. Automaton has 21127 states and 63266 transitions. Word has length 40 [2019-12-27 02:20:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:01,468 INFO L462 AbstractCegarLoop]: Abstraction has 21127 states and 63266 transitions. [2019-12-27 02:20:01,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:20:01,468 INFO L276 IsEmpty]: Start isEmpty. Operand 21127 states and 63266 transitions. [2019-12-27 02:20:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 02:20:01,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:01,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:01,488 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:01,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:01,488 INFO L82 PathProgramCache]: Analyzing trace with hash -559165763, now seen corresponding path program 1 times [2019-12-27 02:20:01,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:01,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380087373] [2019-12-27 02:20:01,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:01,534 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 02:20:01,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380087373] [2019-12-27 02:20:01,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:01,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:20:01,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100170584] [2019-12-27 02:20:01,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:20:01,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:01,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:20:01,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:20:01,536 INFO L87 Difference]: Start difference. First operand 21127 states and 63266 transitions. Second operand 5 states. [2019-12-27 02:20:01,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:01,635 INFO L93 Difference]: Finished difference Result 19886 states and 60599 transitions. [2019-12-27 02:20:01,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:20:01,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 02:20:01,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:01,674 INFO L225 Difference]: With dead ends: 19886 [2019-12-27 02:20:01,675 INFO L226 Difference]: Without dead ends: 19886 [2019-12-27 02:20:01,675 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 02:20:01,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19886 states. [2019-12-27 02:20:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19886 to 19886. [2019-12-27 02:20:02,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19886 states. [2019-12-27 02:20:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19886 states to 19886 states and 60599 transitions. [2019-12-27 02:20:02,168 INFO L78 Accepts]: Start accepts. Automaton has 19886 states and 60599 transitions. Word has length 41 [2019-12-27 02:20:02,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:02,169 INFO L462 AbstractCegarLoop]: Abstraction has 19886 states and 60599 transitions. [2019-12-27 02:20:02,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:20:02,169 INFO L276 IsEmpty]: Start isEmpty. Operand 19886 states and 60599 transitions. [2019-12-27 02:20:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:20:02,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:02,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:02,197 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:02,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:02,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1104102808, now seen corresponding path program 1 times [2019-12-27 02:20:02,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:02,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53368186] [2019-12-27 02:20:02,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:02,296 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 02:20:02,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53368186] [2019-12-27 02:20:02,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:02,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:20:02,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223793653] [2019-12-27 02:20:02,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:20:02,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:02,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:20:02,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:20:02,299 INFO L87 Difference]: Start difference. First operand 19886 states and 60599 transitions. Second operand 7 states. [2019-12-27 02:20:02,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:02,794 INFO L93 Difference]: Finished difference Result 56173 states and 169762 transitions. [2019-12-27 02:20:02,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 02:20:02,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 02:20:02,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:02,854 INFO L225 Difference]: With dead ends: 56173 [2019-12-27 02:20:02,854 INFO L226 Difference]: Without dead ends: 43296 [2019-12-27 02:20:02,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:20:02,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43296 states. [2019-12-27 02:20:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43296 to 23308. [2019-12-27 02:20:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23308 states. [2019-12-27 02:20:03,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23308 states to 23308 states and 71016 transitions. [2019-12-27 02:20:03,718 INFO L78 Accepts]: Start accepts. Automaton has 23308 states and 71016 transitions. Word has length 65 [2019-12-27 02:20:03,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:03,719 INFO L462 AbstractCegarLoop]: Abstraction has 23308 states and 71016 transitions. [2019-12-27 02:20:03,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:20:03,719 INFO L276 IsEmpty]: Start isEmpty. Operand 23308 states and 71016 transitions. [2019-12-27 02:20:03,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:20:03,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:03,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:03,746 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:03,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:03,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1989977016, now seen corresponding path program 2 times [2019-12-27 02:20:03,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:03,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399761632] [2019-12-27 02:20:03,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:03,835 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 02:20:03,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399761632] [2019-12-27 02:20:03,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:03,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:20:03,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573129444] [2019-12-27 02:20:03,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:20:03,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:03,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:20:03,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:20:03,837 INFO L87 Difference]: Start difference. First operand 23308 states and 71016 transitions. Second operand 7 states. [2019-12-27 02:20:04,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:04,403 INFO L93 Difference]: Finished difference Result 62282 states and 186068 transitions. [2019-12-27 02:20:04,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:20:04,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 02:20:04,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:04,468 INFO L225 Difference]: With dead ends: 62282 [2019-12-27 02:20:04,468 INFO L226 Difference]: Without dead ends: 44545 [2019-12-27 02:20:04,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 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 02:20:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44545 states. [2019-12-27 02:20:04,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44545 to 27350. [2019-12-27 02:20:04,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27350 states. [2019-12-27 02:20:05,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27350 states to 27350 states and 82398 transitions. [2019-12-27 02:20:05,043 INFO L78 Accepts]: Start accepts. Automaton has 27350 states and 82398 transitions. Word has length 65 [2019-12-27 02:20:05,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:05,044 INFO L462 AbstractCegarLoop]: Abstraction has 27350 states and 82398 transitions. [2019-12-27 02:20:05,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:20:05,044 INFO L276 IsEmpty]: Start isEmpty. Operand 27350 states and 82398 transitions. [2019-12-27 02:20:05,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:20:05,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:05,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:05,071 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:05,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:05,071 INFO L82 PathProgramCache]: Analyzing trace with hash 982875086, now seen corresponding path program 3 times [2019-12-27 02:20:05,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:05,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129226265] [2019-12-27 02:20:05,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:05,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129226265] [2019-12-27 02:20:05,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:05,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:20:05,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045842379] [2019-12-27 02:20:05,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:20:05,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:05,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:20:05,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:20:05,145 INFO L87 Difference]: Start difference. First operand 27350 states and 82398 transitions. Second operand 7 states. [2019-12-27 02:20:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:05,582 INFO L93 Difference]: Finished difference Result 54026 states and 160947 transitions. [2019-12-27 02:20:05,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:20:05,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 02:20:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:05,651 INFO L225 Difference]: With dead ends: 54026 [2019-12-27 02:20:05,651 INFO L226 Difference]: Without dead ends: 47313 [2019-12-27 02:20:05,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 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 02:20:05,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47313 states. [2019-12-27 02:20:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47313 to 27658. [2019-12-27 02:20:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27658 states. [2019-12-27 02:20:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27658 states to 27658 states and 83349 transitions. [2019-12-27 02:20:06,327 INFO L78 Accepts]: Start accepts. Automaton has 27658 states and 83349 transitions. Word has length 65 [2019-12-27 02:20:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:06,328 INFO L462 AbstractCegarLoop]: Abstraction has 27658 states and 83349 transitions. [2019-12-27 02:20:06,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:20:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 27658 states and 83349 transitions. [2019-12-27 02:20:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:20:06,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:06,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:06,361 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:06,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:06,362 INFO L82 PathProgramCache]: Analyzing trace with hash -156874998, now seen corresponding path program 4 times [2019-12-27 02:20:06,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:06,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575577242] [2019-12-27 02:20:06,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:06,787 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 02:20:06,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575577242] [2019-12-27 02:20:06,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:06,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:20:06,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593126429] [2019-12-27 02:20:06,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:20:06,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:06,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:20:06,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:06,789 INFO L87 Difference]: Start difference. First operand 27658 states and 83349 transitions. Second operand 3 states. [2019-12-27 02:20:06,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:06,933 INFO L93 Difference]: Finished difference Result 30812 states and 92747 transitions. [2019-12-27 02:20:06,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:20:06,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:20:06,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:06,981 INFO L225 Difference]: With dead ends: 30812 [2019-12-27 02:20:06,981 INFO L226 Difference]: Without dead ends: 30812 [2019-12-27 02:20:06,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:07,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30812 states. [2019-12-27 02:20:07,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30812 to 25037. [2019-12-27 02:20:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25037 states. [2019-12-27 02:20:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25037 states to 25037 states and 76106 transitions. [2019-12-27 02:20:07,405 INFO L78 Accepts]: Start accepts. Automaton has 25037 states and 76106 transitions. Word has length 65 [2019-12-27 02:20:07,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:07,405 INFO L462 AbstractCegarLoop]: Abstraction has 25037 states and 76106 transitions. [2019-12-27 02:20:07,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:20:07,405 INFO L276 IsEmpty]: Start isEmpty. Operand 25037 states and 76106 transitions. [2019-12-27 02:20:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:20:07,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:07,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:07,430 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:07,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:07,430 INFO L82 PathProgramCache]: Analyzing trace with hash 771503262, now seen corresponding path program 1 times [2019-12-27 02:20:07,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:07,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887581310] [2019-12-27 02:20:07,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:07,492 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 02:20:07,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887581310] [2019-12-27 02:20:07,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:07,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:20:07,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188316406] [2019-12-27 02:20:07,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:20:07,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:07,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:20:07,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:07,494 INFO L87 Difference]: Start difference. First operand 25037 states and 76106 transitions. Second operand 3 states. [2019-12-27 02:20:07,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:07,596 INFO L93 Difference]: Finished difference Result 20969 states and 62663 transitions. [2019-12-27 02:20:07,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:20:07,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 02:20:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:07,644 INFO L225 Difference]: With dead ends: 20969 [2019-12-27 02:20:07,644 INFO L226 Difference]: Without dead ends: 20969 [2019-12-27 02:20:07,645 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 02:20:07,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20969 states. [2019-12-27 02:20:08,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20969 to 19009. [2019-12-27 02:20:08,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19009 states. [2019-12-27 02:20:08,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19009 states to 19009 states and 56843 transitions. [2019-12-27 02:20:08,074 INFO L78 Accepts]: Start accepts. Automaton has 19009 states and 56843 transitions. Word has length 66 [2019-12-27 02:20:08,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:08,075 INFO L462 AbstractCegarLoop]: Abstraction has 19009 states and 56843 transitions. [2019-12-27 02:20:08,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:20:08,075 INFO L276 IsEmpty]: Start isEmpty. Operand 19009 states and 56843 transitions. [2019-12-27 02:20:08,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:20:08,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:08,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:08,093 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:08,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:08,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1509100091, now seen corresponding path program 1 times [2019-12-27 02:20:08,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:08,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731008996] [2019-12-27 02:20:08,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:08,255 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 02:20:08,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731008996] [2019-12-27 02:20:08,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:08,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:20:08,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873566478] [2019-12-27 02:20:08,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:20:08,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:08,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:20:08,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:20:08,257 INFO L87 Difference]: Start difference. First operand 19009 states and 56843 transitions. Second operand 11 states. [2019-12-27 02:20:09,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:09,513 INFO L93 Difference]: Finished difference Result 43638 states and 129396 transitions. [2019-12-27 02:20:09,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 02:20:09,514 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:20:09,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:09,561 INFO L225 Difference]: With dead ends: 43638 [2019-12-27 02:20:09,562 INFO L226 Difference]: Without dead ends: 32919 [2019-12-27 02:20:09,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=912, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 02:20:09,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32919 states. [2019-12-27 02:20:09,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32919 to 18279. [2019-12-27 02:20:09,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18279 states. [2019-12-27 02:20:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18279 states to 18279 states and 54342 transitions. [2019-12-27 02:20:09,941 INFO L78 Accepts]: Start accepts. Automaton has 18279 states and 54342 transitions. Word has length 67 [2019-12-27 02:20:09,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:09,941 INFO L462 AbstractCegarLoop]: Abstraction has 18279 states and 54342 transitions. [2019-12-27 02:20:09,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:20:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 18279 states and 54342 transitions. [2019-12-27 02:20:09,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:20:09,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:09,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:09,960 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:09,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:09,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1209104993, now seen corresponding path program 2 times [2019-12-27 02:20:09,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:09,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536378876] [2019-12-27 02:20:09,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:20:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:20:10,080 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:20:10,080 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:20:10,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= v_~a$w_buff0~0_303 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~__unbuffered_p2_EBX~0_46 0) (= v_~z~0_13 0) (= |v_#NULL.offset_7| 0) (= v_~a~0_199 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd2~0_205) (= v_~a$r_buff0_thd3~0_412 0) (= v_~weak$$choice2~0_126 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t913~0.base_30|)) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= v_~y~0_30 0) (= v_~a$r_buff1_thd3~0_326 0) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_cnt~0_83) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~a$w_buff1_used~0_450) (= (store .cse0 |v_ULTIMATE.start_main_~#t913~0.base_30| 1) |v_#valid_67|) (= 0 |v_ULTIMATE.start_main_~#t913~0.offset_22|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t913~0.base_30|) (= 0 v_~__unbuffered_p0_EAX~0_159) (= v_~a$flush_delayed~0_27 0) (= 0 v_~a$r_buff1_thd2~0_197) (= v_~a$mem_tmp~0_16 0) (= v_~main$tmp_guard1~0_32 0) (= 0 |v_#NULL.base_7|) (= 0 v_~a$r_buff1_thd1~0_190) (= v_~a$r_buff1_thd0~0_208 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t913~0.base_30| 4)) (= 0 v_~x~0_153) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t913~0.base_30| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t913~0.base_30|) |v_ULTIMATE.start_main_~#t913~0.offset_22| 0)) |v_#memory_int_19|) (= 0 v_~a$w_buff1~0_206) (= 0 v_~a$r_buff0_thd1~0_334) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~a$r_buff0_thd0~0_214 0) (= 0 v_~weak$$choice0~0_13) (= 0 v_~a$w_buff0_used~0_788))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_197, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_53|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_53|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_214, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ~a~0=v_~a~0_199, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_46, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_326, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_788, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_334, ULTIMATE.start_main_~#t914~0.base=|v_ULTIMATE.start_main_~#t914~0.base_23|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_303, ULTIMATE.start_main_~#t913~0.base=|v_ULTIMATE.start_main_~#t913~0.base_30|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~x~0=v_~x~0_153, ~a$read_delayed~0=v_~a$read_delayed~0_7, ULTIMATE.start_main_~#t915~0.base=|v_ULTIMATE.start_main_~#t915~0.base_15|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_79|, ULTIMATE.start_main_~#t915~0.offset=|v_ULTIMATE.start_main_~#t915~0.offset_13|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_206, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_190, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_412, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ULTIMATE.start_main_~#t913~0.offset=|v_ULTIMATE.start_main_~#t913~0.offset_22|, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t914~0.offset=|v_ULTIMATE.start_main_~#t914~0.offset_17|, ~z~0=v_~z~0_13, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_450, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t914~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ULTIMATE.start_main_~#t913~0.base, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ULTIMATE.start_main_~#t915~0.base, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t915~0.offset, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t913~0.offset, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t914~0.offset, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 02:20:10,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L750: Formula: (and (= ~__unbuffered_p0_EAX~0_Out-1658890258 ~x~0_In-1658890258) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1658890258)) (= ~a$r_buff0_thd3~0_In-1658890258 ~a$r_buff1_thd3~0_Out-1658890258) (= 1 ~a$r_buff0_thd1~0_Out-1658890258) (= ~a$r_buff1_thd1~0_Out-1658890258 ~a$r_buff0_thd1~0_In-1658890258) (= ~a$r_buff0_thd0~0_In-1658890258 ~a$r_buff1_thd0~0_Out-1658890258) (= ~a$r_buff1_thd2~0_Out-1658890258 ~a$r_buff0_thd2~0_In-1658890258)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1658890258, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1658890258, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1658890258, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1658890258, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1658890258, ~x~0=~x~0_In-1658890258} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1658890258, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-1658890258, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-1658890258, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-1658890258, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1658890258, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-1658890258, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1658890258, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1658890258, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1658890258, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1658890258, ~x~0=~x~0_In-1658890258} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:20:10,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L832-1-->L834: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t914~0.offset_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t914~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t914~0.base_11|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t914~0.base_11| 1)) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t914~0.base_11|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t914~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t914~0.base_11|) |v_ULTIMATE.start_main_~#t914~0.offset_10| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t914~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t914~0.offset=|v_ULTIMATE.start_main_~#t914~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t914~0.base=|v_ULTIMATE.start_main_~#t914~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t914~0.offset, #length, ULTIMATE.start_main_~#t914~0.base] because there is no mapped edge [2019-12-27 02:20:10,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L834-1-->L836: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t915~0.offset_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t915~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t915~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t915~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t915~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t915~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t915~0.base_11|) |v_ULTIMATE.start_main_~#t915~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t915~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t915~0.base=|v_ULTIMATE.start_main_~#t915~0.base_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t915~0.offset=|v_ULTIMATE.start_main_~#t915~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t915~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t915~0.offset] because there is no mapped edge [2019-12-27 02:20:10,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1119017421 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1119017421 256)))) (or (and (= ~a~0_In-1119017421 |P1Thread1of1ForFork2_#t~ite9_Out-1119017421|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~a$w_buff1~0_In-1119017421 |P1Thread1of1ForFork2_#t~ite9_Out-1119017421|)))) InVars {~a~0=~a~0_In-1119017421, ~a$w_buff1~0=~a$w_buff1~0_In-1119017421, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1119017421, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1119017421} OutVars{~a~0=~a~0_In-1119017421, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1119017421|, ~a$w_buff1~0=~a$w_buff1~0_In-1119017421, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1119017421, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1119017421} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 02:20:10,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_30| v_~a~0_66) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_30|} OutVars{~a~0=v_~a~0_66, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_29|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_43|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 02:20:10,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In540395139 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In540395139 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In540395139 |P1Thread1of1ForFork2_#t~ite11_Out540395139|)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out540395139| 0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In540395139, ~a$w_buff0_used~0=~a$w_buff0_used~0_In540395139} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In540395139, ~a$w_buff0_used~0=~a$w_buff0_used~0_In540395139, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out540395139|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 02:20:10,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-595710816 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-595710816 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-595710816 256))) (.cse3 (= (mod ~a$r_buff1_thd2~0_In-595710816 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-595710816|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-595710816 |P1Thread1of1ForFork2_#t~ite12_Out-595710816|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-595710816, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-595710816, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-595710816, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-595710816} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-595710816, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-595710816, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-595710816, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-595710816|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-595710816} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 02:20:10,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1559937953 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1559937953 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-1559937953| ~a$r_buff0_thd2~0_In-1559937953)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-1559937953| 0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1559937953, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1559937953} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1559937953, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1559937953, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1559937953|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 02:20:10,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-198469842 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-198469842 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-198469842 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-198469842 256)))) (or (and (= ~a$r_buff1_thd2~0_In-198469842 |P1Thread1of1ForFork2_#t~ite14_Out-198469842|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-198469842|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-198469842, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-198469842, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-198469842, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-198469842} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-198469842, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-198469842, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-198469842, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-198469842, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-198469842|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 02:20:10,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_24| v_~a$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_24|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_23|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 02:20:10,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1552593398 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1552593398 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1552593398|) (not .cse1)) (and (= ~a$w_buff0_used~0_In-1552593398 |P0Thread1of1ForFork1_#t~ite5_Out-1552593398|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1552593398, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1552593398} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1552593398|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1552593398, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1552593398} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 02:20:10,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In1260590867 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1260590867 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In1260590867 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1260590867 256)))) (or (and (= ~a$w_buff1_used~0_In1260590867 |P0Thread1of1ForFork1_#t~ite6_Out1260590867|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1260590867|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1260590867, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1260590867, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1260590867, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1260590867} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1260590867|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1260590867, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1260590867, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1260590867, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1260590867} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 02:20:10,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1056641265 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1056641265 256) 0))) (or (and (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out1056641265) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In1056641265 ~a$r_buff0_thd1~0_Out1056641265)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1056641265, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1056641265} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1056641265|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1056641265, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1056641265} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:20:10,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In674660640 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In674660640 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In674660640 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In674660640 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out674660640| ~a$r_buff1_thd1~0_In674660640) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out674660640| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In674660640, ~a$w_buff0_used~0=~a$w_buff0_used~0_In674660640, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In674660640, ~a$w_buff1_used~0=~a$w_buff1_used~0_In674660640} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out674660640|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In674660640, ~a$w_buff0_used~0=~a$w_buff0_used~0_In674660640, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In674660640, ~a$w_buff1_used~0=~a$w_buff1_used~0_In674660640} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 02:20:10,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L754-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~a$r_buff1_thd1~0_87 |v_P0Thread1of1ForFork1_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_37|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_87, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 02:20:10,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-904771745 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite30_Out-904771745| |P2Thread1of1ForFork0_#t~ite29_Out-904771745|) (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-904771745 256) 0))) (or (and (= (mod ~a$w_buff1_used~0_In-904771745 256) 0) .cse0) (= (mod ~a$w_buff0_used~0_In-904771745 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In-904771745 256)) .cse0))) .cse1 (= ~a$w_buff1_used~0_In-904771745 |P2Thread1of1ForFork0_#t~ite29_Out-904771745|)) (and (= |P2Thread1of1ForFork0_#t~ite29_In-904771745| |P2Thread1of1ForFork0_#t~ite29_Out-904771745|) (not .cse1) (= ~a$w_buff1_used~0_In-904771745 |P2Thread1of1ForFork0_#t~ite30_Out-904771745|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-904771745, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-904771745, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-904771745, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-904771745, ~weak$$choice2~0=~weak$$choice2~0_In-904771745, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-904771745|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-904771745, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-904771745, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-904771745, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-904771745, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-904771745|, ~weak$$choice2~0=~weak$$choice2~0_In-904771745, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-904771745|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 02:20:10,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~a$r_buff0_thd3~0_66 v_~a$r_buff0_thd3~0_65)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 02:20:10,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (= v_~a$flush_delayed~0_11 0) (= v_~a~0_48 v_~a$mem_tmp~0_5) (not (= (mod v_~a$flush_delayed~0_12 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_11} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 02:20:10,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In281676947 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In281676947 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out281676947| ~a$w_buff1~0_In281676947) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out281676947| ~a~0_In281676947)))) InVars {~a~0=~a~0_In281676947, ~a$w_buff1~0=~a$w_buff1~0_In281676947, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In281676947, ~a$w_buff1_used~0=~a$w_buff1_used~0_In281676947} OutVars{~a~0=~a~0_In281676947, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out281676947|, ~a$w_buff1~0=~a$w_buff1~0_In281676947, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In281676947, ~a$w_buff1_used~0=~a$w_buff1_used~0_In281676947} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 02:20:10,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_37 |v_P2Thread1of1ForFork0_#t~ite38_14|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_14|} OutVars{~a~0=v_~a~0_37, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_13|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 02:20:10,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In286733783 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In286733783 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out286733783|)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In286733783 |P2Thread1of1ForFork0_#t~ite40_Out286733783|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In286733783, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In286733783} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out286733783|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In286733783, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In286733783} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 02:20:10,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd3~0_In-692216665 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-692216665 256))) (.cse0 (= (mod ~a$r_buff1_thd3~0_In-692216665 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-692216665 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-692216665| 0)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-692216665| ~a$w_buff1_used~0_In-692216665) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-692216665, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-692216665, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-692216665, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-692216665} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-692216665, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-692216665, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-692216665, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-692216665, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-692216665|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 02:20:10,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1751636263 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-1751636263 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1751636263| ~a$r_buff0_thd3~0_In-1751636263)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1751636263| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1751636263, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1751636263} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1751636263, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1751636263, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1751636263|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 02:20:10,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-737982094 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In-737982094 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-737982094 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In-737982094 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-737982094|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd3~0_In-737982094 |P2Thread1of1ForFork0_#t~ite43_Out-737982094|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-737982094, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-737982094, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-737982094, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-737982094} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-737982094|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-737982094, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-737982094, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-737982094, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-737982094} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 02:20:10,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 02:20:10,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:20:10,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out524886884| |ULTIMATE.start_main_#t~ite47_Out524886884|)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In524886884 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In524886884 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out524886884| ~a~0_In524886884) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite47_Out524886884| ~a$w_buff1~0_In524886884)))) InVars {~a~0=~a~0_In524886884, ~a$w_buff1~0=~a$w_buff1~0_In524886884, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In524886884, ~a$w_buff1_used~0=~a$w_buff1_used~0_In524886884} OutVars{~a~0=~a~0_In524886884, ~a$w_buff1~0=~a$w_buff1~0_In524886884, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out524886884|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In524886884, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out524886884|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In524886884} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 02:20:10,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1506355036 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1506355036 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1506355036| ~a$w_buff0_used~0_In-1506355036)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1506355036| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1506355036, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1506355036} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1506355036, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1506355036|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1506355036} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 02:20:10,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-708357099 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-708357099 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-708357099 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-708357099 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-708357099|)) (and (= ~a$w_buff1_used~0_In-708357099 |ULTIMATE.start_main_#t~ite50_Out-708357099|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-708357099, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-708357099, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-708357099, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-708357099} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-708357099|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-708357099, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-708357099, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-708357099, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-708357099} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 02:20:10,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In388891402 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In388891402 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out388891402|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite51_Out388891402| ~a$r_buff0_thd0~0_In388891402)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In388891402, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In388891402} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out388891402|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In388891402, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In388891402} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 02:20:10,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1884286864 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In-1884286864 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-1884286864 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd0~0_In-1884286864 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1884286864| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite52_Out-1884286864| ~a$r_buff1_thd0~0_In-1884286864)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1884286864, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1884286864, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1884286864, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1884286864} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1884286864|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1884286864, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1884286864, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1884286864, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1884286864} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 02:20:10,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= v_~main$tmp_guard1~0_17 0) (= v_~__unbuffered_p2_EBX~0_32 0) (= 1 v_~__unbuffered_p2_EAX~0_21) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~a$r_buff1_thd0~0_170 |v_ULTIMATE.start_main_#t~ite52_39|) (= 0 v_~__unbuffered_p0_EAX~0_128)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:20:10,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:20:10 BasicIcfg [2019-12-27 02:20:10,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:20:10,227 INFO L168 Benchmark]: Toolchain (without parser) took 91477.00 ms. Allocated memory was 145.2 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 101.3 MB in the beginning and 1.0 GB in the end (delta: -904.2 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-27 02:20:10,228 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 02:20:10,228 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.63 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.9 MB in the beginning and 154.5 MB in the end (delta: -53.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:20:10,229 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.43 ms. Allocated memory is still 202.9 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:20:10,229 INFO L168 Benchmark]: Boogie Preprocessor took 39.98 ms. Allocated memory is still 202.9 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:20:10,230 INFO L168 Benchmark]: RCFGBuilder took 883.50 ms. Allocated memory is still 202.9 MB. Free memory was 149.1 MB in the beginning and 98.6 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 02:20:10,230 INFO L168 Benchmark]: TraceAbstraction took 89724.20 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 98.0 MB in the beginning and 1.0 GB in the end (delta: -907.5 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-27 02:20:10,233 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.48 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.63 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.9 MB in the beginning and 154.5 MB in the end (delta: -53.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.43 ms. Allocated memory is still 202.9 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.98 ms. Allocated memory is still 202.9 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 883.50 ms. Allocated memory is still 202.9 MB. Free memory was 149.1 MB in the beginning and 98.6 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89724.20 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 98.0 MB in the beginning and 1.0 GB in the end (delta: -907.5 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 31 ChoiceCompositions, 7408 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 42 SemBasedMoverChecksPositive, 283 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 83880 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t913, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t914, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L772] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L773] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L836] FCALL, FORK 0 pthread_create(&t915, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 3 y = 1 [L787] 3 z = 1 [L790] 3 __unbuffered_p2_EAX = z [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 a$flush_delayed = weak$$choice2 [L796] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L798] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L798] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L799] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L800] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L800] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L801] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L803] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L809] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L810] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L811] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L812] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L842] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L842] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L843] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L844] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L845] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 89.3s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5301 SDtfs, 5052 SDslu, 13485 SDs, 0 SdLazy, 4937 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 38 SyntacticMatches, 10 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155174occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 40.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 184051 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 943 NumberOfCodeBlocks, 943 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 851 ConstructedInterpolants, 0 QuantifiedInterpolants, 139385 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...