/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix049_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:15:59,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:15:59,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:15:59,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:15:59,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:15:59,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:15:59,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:15:59,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:15:59,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:15:59,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:15:59,474 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:15:59,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:15:59,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:15:59,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:15:59,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:15:59,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:15:59,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:15:59,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:15:59,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:15:59,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:15:59,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:15:59,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:15:59,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:15:59,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:15:59,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:15:59,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:15:59,496 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:15:59,497 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:15:59,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:15:59,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:15:59,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:15:59,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:15:59,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:15:59,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:15:59,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:15:59,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:15:59,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:15:59,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:15:59,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:15:59,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:15:59,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:15:59,505 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-MCR.epf [2019-12-27 17:15:59,519 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:15:59,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:15:59,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:15:59,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:15:59,521 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:15:59,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:15:59,521 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:15:59,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:15:59,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:15:59,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:15:59,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:15:59,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:15:59,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:15:59,523 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:15:59,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:15:59,523 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:15:59,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:15:59,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:15:59,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:15:59,524 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:15:59,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:15:59,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:15:59,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:15:59,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:15:59,525 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:15:59,525 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:15:59,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:15:59,526 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:15:59,526 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:15:59,526 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:15:59,526 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:15:59,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:15:59,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:15:59,804 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:15:59,805 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:15:59,805 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:15:59,806 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_rmo.oepc.i [2019-12-27 17:15:59,875 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27aa2653e/ca0ee6b244cd4c55bd8649df38ede0a5/FLAGc32a008bb [2019-12-27 17:16:00,464 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:16:00,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_rmo.oepc.i [2019-12-27 17:16:00,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27aa2653e/ca0ee6b244cd4c55bd8649df38ede0a5/FLAGc32a008bb [2019-12-27 17:16:00,690 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27aa2653e/ca0ee6b244cd4c55bd8649df38ede0a5 [2019-12-27 17:16:00,701 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:16:00,703 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:16:00,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:16:00,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:16:00,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:16:00,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:16:00" (1/1) ... [2019-12-27 17:16:00,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1da86fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:16:00, skipping insertion in model container [2019-12-27 17:16:00,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:16:00" (1/1) ... [2019-12-27 17:16:00,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:16:00,774 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:16:01,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:16:01,316 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:16:01,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:16:01,463 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:16:01,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:16:01 WrapperNode [2019-12-27 17:16:01,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:16:01,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:16:01,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:16:01,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:16:01,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:16:01" (1/1) ... [2019-12-27 17:16:01,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:16:01" (1/1) ... [2019-12-27 17:16:01,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:16:01,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:16:01,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:16:01,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:16:01,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:16:01" (1/1) ... [2019-12-27 17:16:01,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:16:01" (1/1) ... [2019-12-27 17:16:01,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:16:01" (1/1) ... [2019-12-27 17:16:01,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:16:01" (1/1) ... [2019-12-27 17:16:01,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:16:01" (1/1) ... [2019-12-27 17:16:01,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:16:01" (1/1) ... [2019-12-27 17:16:01,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:16:01" (1/1) ... [2019-12-27 17:16:01,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:16:01,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:16:01,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:16:01,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:16:01,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:16:01" (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 17:16:01,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:16:01,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:16:01,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:16:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:16:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:16:01,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:16:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:16:01,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:16:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:16:01,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:16:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:16:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:16:01,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:16:01,654 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 17:16:02,465 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:16:02,465 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:16:02,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:16:02 BoogieIcfgContainer [2019-12-27 17:16:02,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:16:02,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:16:02,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:16:02,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:16:02,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:16:00" (1/3) ... [2019-12-27 17:16:02,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56101fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:16:02, skipping insertion in model container [2019-12-27 17:16:02,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:16:01" (2/3) ... [2019-12-27 17:16:02,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56101fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:16:02, skipping insertion in model container [2019-12-27 17:16:02,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:16:02" (3/3) ... [2019-12-27 17:16:02,476 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_rmo.oepc.i [2019-12-27 17:16:02,488 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:16:02,488 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:16:02,497 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:16:02,498 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:16:02,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,545 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,545 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,545 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,547 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,547 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,560 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,560 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,595 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,595 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,646 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,648 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,657 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,657 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,657 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,661 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,662 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:16:02,684 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:16:02,705 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:16:02,706 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:16:02,706 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:16:02,706 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:16:02,706 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:16:02,706 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:16:02,706 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:16:02,707 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:16:02,728 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 17:16:02,730 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 17:16:02,837 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 17:16:02,837 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:16:02,859 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:16:02,887 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 17:16:02,945 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 17:16:02,945 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:16:02,953 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:16:02,976 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 17:16:02,977 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:16:05,686 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-12-27 17:16:08,364 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 17:16:08,493 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 17:16:08,836 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-27 17:16:08,837 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 17:16:08,840 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-27 17:16:32,191 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-27 17:16:32,193 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-27 17:16:32,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:16:32,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:16:32,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:16:32,201 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 17:16:32,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:16:32,207 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-27 17:16:32,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:16:32,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500042953] [2019-12-27 17:16:32,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:16:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:16:32,482 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 17:16:32,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500042953] [2019-12-27 17:16:32,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:16:32,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:16:32,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2059917581] [2019-12-27 17:16:32,487 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:16:32,492 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:16:32,504 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:16:32,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:16:32,509 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:16:32,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:16:32,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:16:32,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:16:32,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:16:32,528 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-27 17:16:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:16:36,408 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-27 17:16:36,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:16:36,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:16:36,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:16:37,115 INFO L225 Difference]: With dead ends: 125570 [2019-12-27 17:16:37,115 INFO L226 Difference]: Without dead ends: 111010 [2019-12-27 17:16:37,117 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 17:16:44,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-27 17:16:46,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-27 17:16:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-27 17:16:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-27 17:16:47,006 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-27 17:16:47,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:16:47,007 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-27 17:16:47,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:16:47,007 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-27 17:16:47,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:16:47,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:16:47,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:16:47,012 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 17:16:47,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:16:47,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-27 17:16:47,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:16:47,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804969153] [2019-12-27 17:16:47,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:16:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:16:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:16:47,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804969153] [2019-12-27 17:16:47,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:16:47,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:16:47,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1883498570] [2019-12-27 17:16:47,129 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:16:47,130 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:16:47,133 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:16:47,134 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:16:47,134 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:16:47,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:16:47,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:16:47,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:16:47,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:16:47,136 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-27 17:16:52,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:16:52,281 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-27 17:16:52,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:16:52,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:16:52,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:16:53,083 INFO L225 Difference]: With dead ends: 172646 [2019-12-27 17:16:53,084 INFO L226 Difference]: Without dead ends: 172548 [2019-12-27 17:16:53,084 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 17:16:59,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-27 17:17:02,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-27 17:17:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-27 17:17:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-27 17:17:09,854 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-27 17:17:09,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:09,855 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-27 17:17:09,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:17:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-27 17:17:09,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:17:09,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:09,862 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:17:09,863 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 17:17:09,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:09,863 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-27 17:17:09,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:09,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450242852] [2019-12-27 17:17:09,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:17:09,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450242852] [2019-12-27 17:17:09,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:09,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:17:09,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1554865097] [2019-12-27 17:17:09,920 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:09,921 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:09,923 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 17:17:09,923 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:09,923 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:17:09,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:17:09,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:09,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:17:09,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:17:09,924 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-27 17:17:10,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:10,087 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-27 17:17:10,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:17:10,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 17:17:10,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:10,157 INFO L225 Difference]: With dead ends: 34208 [2019-12-27 17:17:10,157 INFO L226 Difference]: Without dead ends: 34208 [2019-12-27 17:17:10,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:17:10,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-27 17:17:10,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-27 17:17:10,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-27 17:17:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-27 17:17:10,894 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-27 17:17:10,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:10,895 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-27 17:17:10,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:17:10,895 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-27 17:17:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:17:10,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:10,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:17:10,899 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 17:17:10,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:10,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-27 17:17:10,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:10,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344137730] [2019-12-27 17:17:10,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:10,966 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 17:17:10,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344137730] [2019-12-27 17:17:10,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:10,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:17:10,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [391333530] [2019-12-27 17:17:10,968 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:10,970 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:10,972 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:17:10,973 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:10,973 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:17:10,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:17:10,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:10,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:17:10,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:17:10,974 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-27 17:17:11,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:11,188 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-27 17:17:11,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:17:11,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 17:17:11,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:11,280 INFO L225 Difference]: With dead ends: 51809 [2019-12-27 17:17:11,280 INFO L226 Difference]: Without dead ends: 51809 [2019-12-27 17:17:11,281 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 17:17:13,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-27 17:17:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-27 17:17:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-27 17:17:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-27 17:17:13,618 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-27 17:17:13,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:13,619 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-27 17:17:13,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:17:13,619 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-27 17:17:13,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:17:13,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:13,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:17:13,622 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 17:17:13,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:13,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-27 17:17:13,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:13,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543944746] [2019-12-27 17:17:13,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:13,751 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 17:17:13,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543944746] [2019-12-27 17:17:13,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:13,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:17:13,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [567112230] [2019-12-27 17:17:13,753 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:13,755 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:13,758 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:17:13,758 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:13,758 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:17:13,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:17:13,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:13,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:17:13,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:17:13,759 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-27 17:17:14,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:14,353 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-27 17:17:14,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:17:14,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 17:17:14,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:14,439 INFO L225 Difference]: With dead ends: 53507 [2019-12-27 17:17:14,440 INFO L226 Difference]: Without dead ends: 53507 [2019-12-27 17:17:14,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:17:14,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-27 17:17:16,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-27 17:17:16,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-27 17:17:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-27 17:17:16,175 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-27 17:17:16,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:16,175 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-27 17:17:16,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:17:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-27 17:17:16,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 17:17:16,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:16,189 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 17:17:16,190 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 17:17:16,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:16,190 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-27 17:17:16,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:16,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973428414] [2019-12-27 17:17:16,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:16,326 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 17:17:16,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973428414] [2019-12-27 17:17:16,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:16,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:17:16,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1348362708] [2019-12-27 17:17:16,331 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:16,334 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:16,342 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 17:17:16,342 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:16,393 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:17:16,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:17:16,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:16,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:17:16,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:17:16,394 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 7 states. [2019-12-27 17:17:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:17,577 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-27 17:17:17,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:17:17,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 17:17:17,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:17,700 INFO L225 Difference]: With dead ends: 66834 [2019-12-27 17:17:17,700 INFO L226 Difference]: Without dead ends: 66820 [2019-12-27 17:17:17,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:17:17,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-27 17:17:21,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-27 17:17:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-27 17:17:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-27 17:17:21,326 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-27 17:17:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:21,327 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-27 17:17:21,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:17:21,327 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-27 17:17:21,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:17:21,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:21,345 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 17:17:21,345 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 17:17:21,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:21,346 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-27 17:17:21,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:21,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493445130] [2019-12-27 17:17:21,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:21,396 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 17:17:21,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493445130] [2019-12-27 17:17:21,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:21,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:17:21,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [901842299] [2019-12-27 17:17:21,397 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:21,403 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:21,413 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 17:17:21,414 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:21,429 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:17:21,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:17:21,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:21,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:17:21,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:17:21,430 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 5 states. [2019-12-27 17:17:21,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:21,541 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-27 17:17:21,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:17:21,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 17:17:21,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:21,575 INFO L225 Difference]: With dead ends: 18127 [2019-12-27 17:17:21,575 INFO L226 Difference]: Without dead ends: 18127 [2019-12-27 17:17:21,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:17:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-27 17:17:21,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-27 17:17:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-27 17:17:21,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-27 17:17:21,866 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-27 17:17:21,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:21,866 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-27 17:17:21,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:17:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-27 17:17:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:17:21,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:21,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:17:21,880 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 17:17:21,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:21,881 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-27 17:17:21,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:21,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182298256] [2019-12-27 17:17:21,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:17:21,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182298256] [2019-12-27 17:17:21,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:21,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:17:21,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1605178088] [2019-12-27 17:17:21,996 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:22,000 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:22,005 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:17:22,005 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:22,005 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:17:22,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:17:22,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:22,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:17:22,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:17:22,006 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-27 17:17:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:22,674 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-27 17:17:22,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:17:22,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 17:17:22,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:22,711 INFO L225 Difference]: With dead ends: 25206 [2019-12-27 17:17:22,711 INFO L226 Difference]: Without dead ends: 25206 [2019-12-27 17:17:22,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:17:22,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-27 17:17:23,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-27 17:17:23,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-27 17:17:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-27 17:17:23,459 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-27 17:17:23,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:23,459 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-27 17:17:23,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:17:23,459 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-27 17:17:23,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:17:23,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:23,481 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:17:23,481 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 17:17:23,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:23,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-27 17:17:23,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:23,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256134660] [2019-12-27 17:17:23,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:23,645 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 17:17:23,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256134660] [2019-12-27 17:17:23,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:23,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:17:23,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1984162725] [2019-12-27 17:17:23,646 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:23,651 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:23,663 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 17:17:23,663 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:23,690 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:17:23,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:17:23,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:23,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:17:23,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:17:23,692 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 8 states. [2019-12-27 17:17:25,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:25,098 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-27 17:17:25,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:17:25,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 17:17:25,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:25,139 INFO L225 Difference]: With dead ends: 28185 [2019-12-27 17:17:25,139 INFO L226 Difference]: Without dead ends: 28185 [2019-12-27 17:17:25,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-12-27 17:17:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-27 17:17:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-27 17:17:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-27 17:17:25,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-27 17:17:25,522 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-27 17:17:25,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:25,523 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-27 17:17:25,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:17:25,523 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-27 17:17:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 17:17:25,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:25,551 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 17:17:25,551 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 17:17:25,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:25,552 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-27 17:17:25,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:25,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121318148] [2019-12-27 17:17:25,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:25,651 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 17:17:25,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121318148] [2019-12-27 17:17:25,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:25,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:17:25,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1467496287] [2019-12-27 17:17:25,652 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:25,666 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:25,734 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 287 transitions. [2019-12-27 17:17:25,735 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:25,787 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:17:25,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:17:25,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:25,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:17:25,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:17:25,789 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 7 states. [2019-12-27 17:17:25,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:25,937 INFO L93 Difference]: Finished difference Result 18279 states and 57074 transitions. [2019-12-27 17:17:25,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:17:25,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-27 17:17:25,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:25,980 INFO L225 Difference]: With dead ends: 18279 [2019-12-27 17:17:25,980 INFO L226 Difference]: Without dead ends: 18279 [2019-12-27 17:17:25,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:17:26,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18279 states. [2019-12-27 17:17:26,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18279 to 17698. [2019-12-27 17:17:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17698 states. [2019-12-27 17:17:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17698 states to 17698 states and 55505 transitions. [2019-12-27 17:17:26,725 INFO L78 Accepts]: Start accepts. Automaton has 17698 states and 55505 transitions. Word has length 39 [2019-12-27 17:17:26,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:26,725 INFO L462 AbstractCegarLoop]: Abstraction has 17698 states and 55505 transitions. [2019-12-27 17:17:26,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:17:26,726 INFO L276 IsEmpty]: Start isEmpty. Operand 17698 states and 55505 transitions. [2019-12-27 17:17:26,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:17:26,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:26,749 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] [2019-12-27 17:17:26,750 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 17:17:26,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:26,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2116688157, now seen corresponding path program 1 times [2019-12-27 17:17:26,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:26,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117223403] [2019-12-27 17:17:26,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:26,868 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 17:17:26,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117223403] [2019-12-27 17:17:26,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:26,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:17:26,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1546086211] [2019-12-27 17:17:26,869 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:26,888 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:27,026 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 313 transitions. [2019-12-27 17:17:27,026 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:27,037 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:17:27,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:17:27,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:27,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:17:27,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:17:27,038 INFO L87 Difference]: Start difference. First operand 17698 states and 55505 transitions. Second operand 7 states. [2019-12-27 17:17:27,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:27,546 INFO L93 Difference]: Finished difference Result 48537 states and 151835 transitions. [2019-12-27 17:17:27,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:17:27,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 17:17:27,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:27,602 INFO L225 Difference]: With dead ends: 48537 [2019-12-27 17:17:27,602 INFO L226 Difference]: Without dead ends: 38006 [2019-12-27 17:17:27,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:17:27,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38006 states. [2019-12-27 17:17:28,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38006 to 21047. [2019-12-27 17:17:28,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21047 states. [2019-12-27 17:17:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21047 states to 21047 states and 66538 transitions. [2019-12-27 17:17:28,108 INFO L78 Accepts]: Start accepts. Automaton has 21047 states and 66538 transitions. Word has length 64 [2019-12-27 17:17:28,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:28,109 INFO L462 AbstractCegarLoop]: Abstraction has 21047 states and 66538 transitions. [2019-12-27 17:17:28,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:17:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 21047 states and 66538 transitions. [2019-12-27 17:17:28,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:17:28,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:28,135 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] [2019-12-27 17:17:28,135 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 17:17:28,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:28,135 INFO L82 PathProgramCache]: Analyzing trace with hash -978914267, now seen corresponding path program 2 times [2019-12-27 17:17:28,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:28,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969400271] [2019-12-27 17:17:28,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:28,245 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 17:17:28,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969400271] [2019-12-27 17:17:28,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:28,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:17:28,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [797854175] [2019-12-27 17:17:28,246 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:28,267 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:28,611 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 326 transitions. [2019-12-27 17:17:28,612 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:28,675 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:17:28,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:17:28,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:28,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:17:28,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:17:28,676 INFO L87 Difference]: Start difference. First operand 21047 states and 66538 transitions. Second operand 10 states. [2019-12-27 17:17:30,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:30,991 INFO L93 Difference]: Finished difference Result 67378 states and 209411 transitions. [2019-12-27 17:17:30,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 17:17:30,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 17:17:30,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:31,068 INFO L225 Difference]: With dead ends: 67378 [2019-12-27 17:17:31,069 INFO L226 Difference]: Without dead ends: 49917 [2019-12-27 17:17:31,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:17:31,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49917 states. [2019-12-27 17:17:31,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49917 to 24743. [2019-12-27 17:17:31,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24743 states. [2019-12-27 17:17:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24743 states to 24743 states and 78318 transitions. [2019-12-27 17:17:31,966 INFO L78 Accepts]: Start accepts. Automaton has 24743 states and 78318 transitions. Word has length 64 [2019-12-27 17:17:31,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:31,966 INFO L462 AbstractCegarLoop]: Abstraction has 24743 states and 78318 transitions. [2019-12-27 17:17:31,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:17:31,966 INFO L276 IsEmpty]: Start isEmpty. Operand 24743 states and 78318 transitions. [2019-12-27 17:17:32,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:17:32,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:32,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:17:32,004 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 17:17:32,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:32,005 INFO L82 PathProgramCache]: Analyzing trace with hash -423923923, now seen corresponding path program 3 times [2019-12-27 17:17:32,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:32,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337665399] [2019-12-27 17:17:32,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:32,090 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 17:17:32,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337665399] [2019-12-27 17:17:32,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:32,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:17:32,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1131957074] [2019-12-27 17:17:32,091 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:32,113 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:32,257 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 267 transitions. [2019-12-27 17:17:32,257 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:32,286 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:17:32,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:17:32,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:32,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:17:32,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:17:32,287 INFO L87 Difference]: Start difference. First operand 24743 states and 78318 transitions. Second operand 9 states. [2019-12-27 17:17:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:33,503 INFO L93 Difference]: Finished difference Result 83473 states and 258770 transitions. [2019-12-27 17:17:33,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 17:17:33,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 17:17:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:33,622 INFO L225 Difference]: With dead ends: 83473 [2019-12-27 17:17:33,622 INFO L226 Difference]: Without dead ends: 76594 [2019-12-27 17:17:33,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:17:33,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76594 states. [2019-12-27 17:17:34,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76594 to 24923. [2019-12-27 17:17:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24923 states. [2019-12-27 17:17:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24923 states to 24923 states and 79050 transitions. [2019-12-27 17:17:34,723 INFO L78 Accepts]: Start accepts. Automaton has 24923 states and 79050 transitions. Word has length 64 [2019-12-27 17:17:34,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:34,723 INFO L462 AbstractCegarLoop]: Abstraction has 24923 states and 79050 transitions. [2019-12-27 17:17:34,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:17:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand 24923 states and 79050 transitions. [2019-12-27 17:17:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:17:34,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:34,764 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] [2019-12-27 17:17:34,765 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 17:17:34,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:34,765 INFO L82 PathProgramCache]: Analyzing trace with hash -314768521, now seen corresponding path program 4 times [2019-12-27 17:17:34,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:34,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421616502] [2019-12-27 17:17:34,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:34,854 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 17:17:34,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421616502] [2019-12-27 17:17:34,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:34,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:17:34,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [527258757] [2019-12-27 17:17:34,856 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:34,901 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:35,221 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 277 states and 500 transitions. [2019-12-27 17:17:35,221 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:35,231 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:17:35,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:17:35,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:35,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:17:35,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:17:35,232 INFO L87 Difference]: Start difference. First operand 24923 states and 79050 transitions. Second operand 4 states. [2019-12-27 17:17:35,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:35,601 INFO L93 Difference]: Finished difference Result 29331 states and 90024 transitions. [2019-12-27 17:17:35,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:17:35,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 17:17:35,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:35,674 INFO L225 Difference]: With dead ends: 29331 [2019-12-27 17:17:35,674 INFO L226 Difference]: Without dead ends: 29331 [2019-12-27 17:17:35,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:17:35,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29331 states. [2019-12-27 17:17:36,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29331 to 19827. [2019-12-27 17:17:36,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-12-27 17:17:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 61272 transitions. [2019-12-27 17:17:36,435 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 61272 transitions. Word has length 64 [2019-12-27 17:17:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:36,435 INFO L462 AbstractCegarLoop]: Abstraction has 19827 states and 61272 transitions. [2019-12-27 17:17:36,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:17:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 61272 transitions. [2019-12-27 17:17:36,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:17:36,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:36,475 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 17:17:36,475 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 17:17:36,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:36,475 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-27 17:17:36,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:36,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344485128] [2019-12-27 17:17:36,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:36,639 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 17:17:36,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344485128] [2019-12-27 17:17:36,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:36,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:17:36,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [611764381] [2019-12-27 17:17:36,641 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:36,715 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:37,052 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 318 transitions. [2019-12-27 17:17:37,052 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:37,053 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:17:37,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:17:37,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:37,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:17:37,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:17:37,054 INFO L87 Difference]: Start difference. First operand 19827 states and 61272 transitions. Second operand 3 states. [2019-12-27 17:17:37,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:37,175 INFO L93 Difference]: Finished difference Result 24197 states and 74265 transitions. [2019-12-27 17:17:37,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:17:37,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 17:17:37,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:37,207 INFO L225 Difference]: With dead ends: 24197 [2019-12-27 17:17:37,207 INFO L226 Difference]: Without dead ends: 24197 [2019-12-27 17:17:37,207 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 17:17:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24197 states. [2019-12-27 17:17:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24197 to 21036. [2019-12-27 17:17:37,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21036 states. [2019-12-27 17:17:37,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 65069 transitions. [2019-12-27 17:17:37,562 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 65069 transitions. Word has length 65 [2019-12-27 17:17:37,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:37,562 INFO L462 AbstractCegarLoop]: Abstraction has 21036 states and 65069 transitions. [2019-12-27 17:17:37,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:17:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 65069 transitions. [2019-12-27 17:17:37,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:17:37,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:37,589 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 17:17:37,589 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 17:17:37,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:37,590 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-27 17:17:37,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:37,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085127619] [2019-12-27 17:17:37,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:37,674 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 17:17:37,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085127619] [2019-12-27 17:17:37,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:37,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:17:37,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1339246548] [2019-12-27 17:17:37,675 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:37,697 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:37,906 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 289 transitions. [2019-12-27 17:17:37,906 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:37,907 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:17:37,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:17:37,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:37,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:17:37,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:17:37,907 INFO L87 Difference]: Start difference. First operand 21036 states and 65069 transitions. Second operand 4 states. [2019-12-27 17:17:38,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:38,045 INFO L93 Difference]: Finished difference Result 24621 states and 75632 transitions. [2019-12-27 17:17:38,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:17:38,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 17:17:38,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:38,078 INFO L225 Difference]: With dead ends: 24621 [2019-12-27 17:17:38,079 INFO L226 Difference]: Without dead ends: 24621 [2019-12-27 17:17:38,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 17:17:38,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24621 states. [2019-12-27 17:17:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24621 to 21144. [2019-12-27 17:17:38,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21144 states. [2019-12-27 17:17:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21144 states to 21144 states and 65300 transitions. [2019-12-27 17:17:38,690 INFO L78 Accepts]: Start accepts. Automaton has 21144 states and 65300 transitions. Word has length 66 [2019-12-27 17:17:38,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:38,690 INFO L462 AbstractCegarLoop]: Abstraction has 21144 states and 65300 transitions. [2019-12-27 17:17:38,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:17:38,690 INFO L276 IsEmpty]: Start isEmpty. Operand 21144 states and 65300 transitions. [2019-12-27 17:17:38,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:17:38,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:38,713 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 17:17:38,713 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 17:17:38,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:38,713 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-27 17:17:38,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:38,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365911400] [2019-12-27 17:17:38,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:38,881 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 17:17:38,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365911400] [2019-12-27 17:17:38,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:38,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:17:38,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [152513144] [2019-12-27 17:17:38,882 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:38,901 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:39,069 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 321 transitions. [2019-12-27 17:17:39,069 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:39,197 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:17:39,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:17:39,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:39,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:17:39,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:17:39,199 INFO L87 Difference]: Start difference. First operand 21144 states and 65300 transitions. Second operand 14 states. [2019-12-27 17:17:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:43,876 INFO L93 Difference]: Finished difference Result 37551 states and 112691 transitions. [2019-12-27 17:17:43,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 17:17:43,876 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 17:17:43,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:43,927 INFO L225 Difference]: With dead ends: 37551 [2019-12-27 17:17:43,927 INFO L226 Difference]: Without dead ends: 37255 [2019-12-27 17:17:43,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=388, Invalid=1964, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 17:17:44,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37255 states. [2019-12-27 17:17:44,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37255 to 25619. [2019-12-27 17:17:44,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25619 states. [2019-12-27 17:17:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25619 states to 25619 states and 78886 transitions. [2019-12-27 17:17:44,552 INFO L78 Accepts]: Start accepts. Automaton has 25619 states and 78886 transitions. Word has length 66 [2019-12-27 17:17:44,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:44,552 INFO L462 AbstractCegarLoop]: Abstraction has 25619 states and 78886 transitions. [2019-12-27 17:17:44,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:17:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 25619 states and 78886 transitions. [2019-12-27 17:17:44,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:17:44,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:44,580 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 17:17:44,580 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 17:17:44,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:44,581 INFO L82 PathProgramCache]: Analyzing trace with hash -643939670, now seen corresponding path program 2 times [2019-12-27 17:17:44,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:44,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393941295] [2019-12-27 17:17:44,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:44,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 17:17:44,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393941295] [2019-12-27 17:17:44,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:44,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:17:44,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1033531369] [2019-12-27 17:17:44,653 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:44,675 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:44,872 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 492 transitions. [2019-12-27 17:17:44,873 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:44,873 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:17:44,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:17:44,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:44,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:17:44,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:17:44,874 INFO L87 Difference]: Start difference. First operand 25619 states and 78886 transitions. Second operand 3 states. [2019-12-27 17:17:44,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:44,952 INFO L93 Difference]: Finished difference Result 25619 states and 78885 transitions. [2019-12-27 17:17:44,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:17:44,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 17:17:44,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:44,987 INFO L225 Difference]: With dead ends: 25619 [2019-12-27 17:17:44,987 INFO L226 Difference]: Without dead ends: 25619 [2019-12-27 17:17:44,987 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 17:17:45,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25619 states. [2019-12-27 17:17:45,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25619 to 21352. [2019-12-27 17:17:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21352 states. [2019-12-27 17:17:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21352 states to 21352 states and 66560 transitions. [2019-12-27 17:17:45,356 INFO L78 Accepts]: Start accepts. Automaton has 21352 states and 66560 transitions. Word has length 66 [2019-12-27 17:17:45,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:45,357 INFO L462 AbstractCegarLoop]: Abstraction has 21352 states and 66560 transitions. [2019-12-27 17:17:45,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:17:45,357 INFO L276 IsEmpty]: Start isEmpty. Operand 21352 states and 66560 transitions. [2019-12-27 17:17:45,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:17:45,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:45,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:17:45,379 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 17:17:45,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:45,380 INFO L82 PathProgramCache]: Analyzing trace with hash 384042528, now seen corresponding path program 1 times [2019-12-27 17:17:45,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:45,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145627726] [2019-12-27 17:17:45,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:45,761 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 17:17:45,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145627726] [2019-12-27 17:17:45,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:45,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:17:45,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1408984546] [2019-12-27 17:17:45,762 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:45,782 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:46,261 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 322 transitions. [2019-12-27 17:17:46,262 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:46,518 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:17:46,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:17:46,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:46,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:17:46,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:17:46,519 INFO L87 Difference]: Start difference. First operand 21352 states and 66560 transitions. Second operand 14 states. [2019-12-27 17:17:48,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:48,225 INFO L93 Difference]: Finished difference Result 48907 states and 152232 transitions. [2019-12-27 17:17:48,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 17:17:48,226 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-27 17:17:48,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:48,302 INFO L225 Difference]: With dead ends: 48907 [2019-12-27 17:17:48,302 INFO L226 Difference]: Without dead ends: 46455 [2019-12-27 17:17:48,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=228, Invalid=962, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 17:17:48,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46455 states. [2019-12-27 17:17:48,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46455 to 26691. [2019-12-27 17:17:48,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26691 states. [2019-12-27 17:17:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26691 states to 26691 states and 83106 transitions. [2019-12-27 17:17:48,887 INFO L78 Accepts]: Start accepts. Automaton has 26691 states and 83106 transitions. Word has length 67 [2019-12-27 17:17:48,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:48,887 INFO L462 AbstractCegarLoop]: Abstraction has 26691 states and 83106 transitions. [2019-12-27 17:17:48,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:17:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 26691 states and 83106 transitions. [2019-12-27 17:17:48,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:17:48,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:48,916 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 17:17:48,916 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 17:17:48,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:48,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2126135770, now seen corresponding path program 2 times [2019-12-27 17:17:48,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:48,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493713365] [2019-12-27 17:17:48,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:49,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 17:17:49,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493713365] [2019-12-27 17:17:49,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:49,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:17:49,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [995121170] [2019-12-27 17:17:49,256 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:49,270 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:49,842 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 283 states and 563 transitions. [2019-12-27 17:17:49,842 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:50,201 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 17:17:50,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 17:17:50,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:50,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 17:17:50,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:17:50,203 INFO L87 Difference]: Start difference. First operand 26691 states and 83106 transitions. Second operand 15 states. [2019-12-27 17:17:52,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:52,657 INFO L93 Difference]: Finished difference Result 58250 states and 179763 transitions. [2019-12-27 17:17:52,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 17:17:52,658 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 17:17:52,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:52,734 INFO L225 Difference]: With dead ends: 58250 [2019-12-27 17:17:52,734 INFO L226 Difference]: Without dead ends: 47562 [2019-12-27 17:17:52,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=302, Invalid=1258, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 17:17:52,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47562 states. [2019-12-27 17:17:53,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47562 to 21107. [2019-12-27 17:17:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21107 states. [2019-12-27 17:17:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21107 states to 21107 states and 65096 transitions. [2019-12-27 17:17:53,308 INFO L78 Accepts]: Start accepts. Automaton has 21107 states and 65096 transitions. Word has length 67 [2019-12-27 17:17:53,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:53,308 INFO L462 AbstractCegarLoop]: Abstraction has 21107 states and 65096 transitions. [2019-12-27 17:17:53,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 17:17:53,308 INFO L276 IsEmpty]: Start isEmpty. Operand 21107 states and 65096 transitions. [2019-12-27 17:17:53,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:17:53,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:53,329 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 17:17:53,330 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 17:17:53,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:53,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1316797024, now seen corresponding path program 3 times [2019-12-27 17:17:53,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:53,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157221275] [2019-12-27 17:17:53,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:53,661 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 17:17:53,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157221275] [2019-12-27 17:17:53,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:53,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:17:53,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2227685] [2019-12-27 17:17:53,662 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:53,676 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:54,119 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 305 states and 623 transitions. [2019-12-27 17:17:54,120 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:54,417 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 17:17:54,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 17:17:54,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:54,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 17:17:54,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:17:54,419 INFO L87 Difference]: Start difference. First operand 21107 states and 65096 transitions. Second operand 15 states. [2019-12-27 17:17:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:55,744 INFO L93 Difference]: Finished difference Result 37211 states and 114263 transitions. [2019-12-27 17:17:55,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 17:17:55,745 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 17:17:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:55,797 INFO L225 Difference]: With dead ends: 37211 [2019-12-27 17:17:55,797 INFO L226 Difference]: Without dead ends: 36153 [2019-12-27 17:17:55,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2019-12-27 17:17:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36153 states. [2019-12-27 17:17:56,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36153 to 20439. [2019-12-27 17:17:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20439 states. [2019-12-27 17:17:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20439 states to 20439 states and 63257 transitions. [2019-12-27 17:17:56,277 INFO L78 Accepts]: Start accepts. Automaton has 20439 states and 63257 transitions. Word has length 67 [2019-12-27 17:17:56,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:56,277 INFO L462 AbstractCegarLoop]: Abstraction has 20439 states and 63257 transitions. [2019-12-27 17:17:56,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 17:17:56,278 INFO L276 IsEmpty]: Start isEmpty. Operand 20439 states and 63257 transitions. [2019-12-27 17:17:56,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:17:56,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:56,301 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 17:17:56,301 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 17:17:56,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:56,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 4 times [2019-12-27 17:17:56,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:56,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541429685] [2019-12-27 17:17:56,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:17:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:17:56,421 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:17:56,421 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:17:56,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= v_~main$tmp_guard1~0_48 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1309~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1309~0.base_23|) |v_ULTIMATE.start_main_~#t1309~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~z$r_buff0_thd3~0_416) (= (store .cse0 |v_ULTIMATE.start_main_~#t1309~0.base_23| 1) |v_#valid_60|) (= |v_ULTIMATE.start_main_~#t1309~0.offset_17| 0) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1309~0.base_23|)) (= v_~z$w_buff0_used~0_900 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1309~0.base_23|) (= 0 v_~__unbuffered_p0_EAX~0_137) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1309~0.base_23| 4) |v_#length_21|) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_~#t1311~0.offset=|v_ULTIMATE.start_main_~#t1311~0.offset_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ULTIMATE.start_main_~#t1311~0.base=|v_ULTIMATE.start_main_~#t1311~0.base_17|, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~x~0=v_~x~0_129, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_~#t1310~0.offset=|v_ULTIMATE.start_main_~#t1310~0.offset_12|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_~#t1309~0.offset=|v_ULTIMATE.start_main_~#t1309~0.offset_17|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t1310~0.base=|v_ULTIMATE.start_main_~#t1310~0.base_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274, ULTIMATE.start_main_~#t1309~0.base=|v_ULTIMATE.start_main_~#t1309~0.base_23|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1311~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1311~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1310~0.offset, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1309~0.offset, #NULL.base, ULTIMATE.start_main_~#t1310~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1309~0.base] because there is no mapped edge [2019-12-27 17:17:56,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1310~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1310~0.base_11| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1310~0.base_11| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1310~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1310~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1310~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1310~0.base_11|) |v_ULTIMATE.start_main_~#t1310~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1310~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1310~0.base=|v_ULTIMATE.start_main_~#t1310~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1310~0.offset=|v_ULTIMATE.start_main_~#t1310~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1310~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1310~0.offset] because there is no mapped edge [2019-12-27 17:17:56,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20 0)) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:17:56,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1663860176 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1663860176 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1663860176| ~z~0_In1663860176) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1663860176| ~z$w_buff1~0_In1663860176)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1663860176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1663860176, ~z$w_buff1~0=~z$w_buff1~0_In1663860176, ~z~0=~z~0_In1663860176} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1663860176|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1663860176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1663860176, ~z$w_buff1~0=~z$w_buff1~0_In1663860176, ~z~0=~z~0_In1663860176} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 17:17:56,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 17:17:56,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1311~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1311~0.base_13|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1311~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1311~0.base_13|) |v_ULTIMATE.start_main_~#t1311~0.offset_11| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1311~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1311~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1311~0.offset_11| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1311~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1311~0.base=|v_ULTIMATE.start_main_~#t1311~0.base_13|, ULTIMATE.start_main_~#t1311~0.offset=|v_ULTIMATE.start_main_~#t1311~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1311~0.base, ULTIMATE.start_main_~#t1311~0.offset] because there is no mapped edge [2019-12-27 17:17:56,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-33560930 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-33560930 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-33560930| ~z$w_buff0_used~0_In-33560930) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-33560930| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-33560930, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-33560930} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-33560930, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-33560930|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-33560930} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 17:17:56,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-2068831924 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2068831924 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-2068831924 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-2068831924 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-2068831924| ~z$w_buff1_used~0_In-2068831924) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork2_#t~ite12_Out-2068831924| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2068831924, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2068831924, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2068831924, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2068831924} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2068831924, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2068831924, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2068831924, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-2068831924|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2068831924} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 17:17:56,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In87584844 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In87584844 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In87584844 |P1Thread1of1ForFork2_#t~ite13_Out87584844|)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out87584844| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In87584844, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In87584844} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In87584844, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out87584844|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In87584844} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 17:17:56,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-603976258 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out-603976258| |P2Thread1of1ForFork0_#t~ite27_Out-603976258|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-603976258 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-603976258 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-603976258 256)) (and (= 0 (mod ~z$w_buff1_used~0_In-603976258 256)) .cse1))) (= ~z$w_buff0_used~0_In-603976258 |P2Thread1of1ForFork0_#t~ite26_Out-603976258|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In-603976258| |P2Thread1of1ForFork0_#t~ite26_Out-603976258|) (= ~z$w_buff0_used~0_In-603976258 |P2Thread1of1ForFork0_#t~ite27_Out-603976258|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-603976258|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-603976258, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-603976258, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-603976258, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-603976258, ~weak$$choice2~0=~weak$$choice2~0_In-603976258} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-603976258|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-603976258|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-603976258, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-603976258, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-603976258, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-603976258, ~weak$$choice2~0=~weak$$choice2~0_In-603976258} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 17:17:56,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 17:17:56,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In933806911 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In933806911 256)))) (or (and (= ~z$w_buff0_used~0_In933806911 |P0Thread1of1ForFork1_#t~ite5_Out933806911|) (or .cse0 .cse1)) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out933806911| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In933806911, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In933806911} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out933806911|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In933806911, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In933806911} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 17:17:56,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 17:17:56,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In861574684 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In861574684 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out861574684| |P2Thread1of1ForFork0_#t~ite39_Out861574684|))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out861574684| ~z~0_In861574684) .cse2) (and (= |P2Thread1of1ForFork0_#t~ite38_Out861574684| ~z$w_buff1~0_In861574684) (not .cse0) (not .cse1) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In861574684, ~z$w_buff1_used~0=~z$w_buff1_used~0_In861574684, ~z$w_buff1~0=~z$w_buff1~0_In861574684, ~z~0=~z~0_In861574684} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out861574684|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out861574684|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In861574684, ~z$w_buff1_used~0=~z$w_buff1_used~0_In861574684, ~z$w_buff1~0=~z$w_buff1~0_In861574684, ~z~0=~z~0_In861574684} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 17:17:56,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-2115090384 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-2115090384 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out-2115090384| ~z$w_buff0_used~0_In-2115090384) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-2115090384| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2115090384, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2115090384} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2115090384, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-2115090384|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2115090384} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 17:17:56,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-2070063156 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-2070063156 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-2070063156 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-2070063156 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-2070063156| 0)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-2070063156| ~z$w_buff1_used~0_In-2070063156) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2070063156, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2070063156, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2070063156, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2070063156} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2070063156, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2070063156, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2070063156, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2070063156, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-2070063156|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 17:17:56,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1602454818 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1602454818 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1602454818|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1602454818| ~z$r_buff0_thd3~0_In1602454818)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1602454818, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1602454818} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1602454818, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1602454818, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1602454818|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 17:17:56,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1626744042 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-1626744042 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1626744042 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1626744042 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1626744042|)) (and (or .cse3 .cse2) (= ~z$r_buff1_thd3~0_In-1626744042 |P2Thread1of1ForFork0_#t~ite43_Out-1626744042|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1626744042, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1626744042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1626744042, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1626744042} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1626744042|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1626744042, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1626744042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1626744042, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1626744042} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 17:17:56,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_30|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 17:17:56,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd1~0_In424686139 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In424686139 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In424686139 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In424686139 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In424686139 |P0Thread1of1ForFork1_#t~ite6_Out424686139|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite6_Out424686139| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In424686139, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In424686139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In424686139, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In424686139} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In424686139, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out424686139|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In424686139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In424686139, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In424686139} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 17:17:56,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1510490370 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1510490370 256)))) (or (and (= ~z$r_buff0_thd1~0_Out-1510490370 ~z$r_buff0_thd1~0_In-1510490370) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out-1510490370 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1510490370, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1510490370} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1510490370, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1510490370|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1510490370} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:17:56,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-151376607 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-151376607 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-151376607 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-151376607 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In-151376607 |P0Thread1of1ForFork1_#t~ite8_Out-151376607|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-151376607|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-151376607, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-151376607, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-151376607, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-151376607} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-151376607|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-151376607, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-151376607, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-151376607, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-151376607} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 17:17:56,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_44|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_43|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 17:17:56,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-1989106534 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1989106534 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1989106534 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1989106534 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-1989106534| 0)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1989106534| ~z$r_buff1_thd2~0_In-1989106534) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1989106534, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1989106534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1989106534, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1989106534} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1989106534, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1989106534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1989106534, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1989106534|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1989106534} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 17:17:56,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_34|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_34|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_33|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 17:17:56,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: 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 17:17:56,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1606246009 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1606246009 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite47_Out1606246009| |ULTIMATE.start_main_#t~ite48_Out1606246009|))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1606246009| ~z$w_buff1~0_In1606246009) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out1606246009| ~z~0_In1606246009) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1606246009, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1606246009, ~z$w_buff1~0=~z$w_buff1~0_In1606246009, ~z~0=~z~0_In1606246009} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1606246009, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1606246009|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1606246009, ~z$w_buff1~0=~z$w_buff1~0_In1606246009, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1606246009|, ~z~0=~z~0_In1606246009} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 17:17:56,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1816884098 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1816884098 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1816884098|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1816884098 |ULTIMATE.start_main_#t~ite49_Out-1816884098|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1816884098, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1816884098} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1816884098, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1816884098, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1816884098|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 17:17:56,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-66441638 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-66441638 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-66441638 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-66441638 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-66441638 |ULTIMATE.start_main_#t~ite50_Out-66441638|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-66441638|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-66441638, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-66441638, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-66441638, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-66441638} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-66441638|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-66441638, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-66441638, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-66441638, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-66441638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 17:17:56,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1365800527 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1365800527 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out1365800527|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In1365800527 |ULTIMATE.start_main_#t~ite51_Out1365800527|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1365800527, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1365800527} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1365800527, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1365800527|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1365800527} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 17:17:56,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In1687231959 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1687231959 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1687231959 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1687231959 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In1687231959 |ULTIMATE.start_main_#t~ite52_Out1687231959|)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out1687231959|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1687231959, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1687231959, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1687231959, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1687231959} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1687231959|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1687231959, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1687231959, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1687231959, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1687231959} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 17:17:56,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:17:56,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:17:56 BasicIcfg [2019-12-27 17:17:56,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:17:56,572 INFO L168 Benchmark]: Toolchain (without parser) took 115869.67 ms. Allocated memory was 137.9 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 100.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 17:17:56,573 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 17:17:56,573 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.38 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 100.0 MB in the beginning and 156.7 MB in the end (delta: -56.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:17:56,574 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.14 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:17:56,574 INFO L168 Benchmark]: Boogie Preprocessor took 40.32 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:17:56,575 INFO L168 Benchmark]: RCFGBuilder took 892.38 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 101.3 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:17:56,576 INFO L168 Benchmark]: TraceAbstraction took 114101.92 ms. Allocated memory was 203.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 101.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 17:17:56,581 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.13 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 760.38 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 100.0 MB in the beginning and 156.7 MB in the end (delta: -56.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.14 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.32 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 892.38 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 101.3 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 114101.92 ms. Allocated memory was 203.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 101.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1309, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1310, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1311, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 113.7s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 31.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5740 SDtfs, 8946 SDslu, 23095 SDs, 0 SdLazy, 12263 SolverSat, 362 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 391 GetRequests, 85 SyntacticMatches, 35 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158936occurred 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: 44.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 259967 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 992 NumberOfCodeBlocks, 992 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 230078 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...