/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:39:14,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:39:14,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:39:14,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:39:14,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:39:14,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:39:14,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:39:14,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:39:14,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:39:14,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:39:14,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:39:14,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:39:14,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:39:14,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:39:14,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:39:14,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:39:14,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:39:14,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:39:14,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:39:14,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:39:14,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:39:14,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:39:14,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:39:14,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:39:14,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:39:14,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:39:14,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:39:14,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:39:14,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:39:14,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:39:14,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:39:14,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:39:14,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:39:14,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:39:14,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:39:14,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:39:14,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:39:14,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:39:14,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:39:14,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:39:14,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:39:14,550 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:39:14,574 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:39:14,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:39:14,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:39:14,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:39:14,580 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:39:14,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:39:14,580 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:39:14,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:39:14,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:39:14,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:39:14,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:39:14,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:39:14,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:39:14,582 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:39:14,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:39:14,582 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:39:14,582 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:39:14,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:39:14,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:39:14,584 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:39:14,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:39:14,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:39:14,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:39:14,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:39:14,586 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:39:14,586 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:39:14,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:39:14,587 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:39:14,587 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:39:14,587 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:39:14,588 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:39:14,588 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:39:14,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:39:14,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:39:14,871 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:39:14,873 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:39:14,873 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:39:14,874 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.oepc.i [2019-12-27 21:39:14,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebe4163f/9aee3604f3404bc8a720e1580867e7ed/FLAG8b9ac98a0 [2019-12-27 21:39:15,418 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:39:15,419 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_rmo.oepc.i [2019-12-27 21:39:15,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebe4163f/9aee3604f3404bc8a720e1580867e7ed/FLAG8b9ac98a0 [2019-12-27 21:39:15,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebe4163f/9aee3604f3404bc8a720e1580867e7ed [2019-12-27 21:39:15,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:39:15,770 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:39:15,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:39:15,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:39:15,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:39:15,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:39:15" (1/1) ... [2019-12-27 21:39:15,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74df8f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:15, skipping insertion in model container [2019-12-27 21:39:15,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:39:15" (1/1) ... [2019-12-27 21:39:15,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:39:15,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:39:16,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:39:16,419 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:39:16,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:39:16,615 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:39:16,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:16 WrapperNode [2019-12-27 21:39:16,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:39:16,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:39:16,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:39:16,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:39:16,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:16" (1/1) ... [2019-12-27 21:39:16,677 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:16" (1/1) ... [2019-12-27 21:39:16,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:39:16,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:39:16,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:39:16,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:39:16,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:16" (1/1) ... [2019-12-27 21:39:16,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:16" (1/1) ... [2019-12-27 21:39:16,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:16" (1/1) ... [2019-12-27 21:39:16,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:16" (1/1) ... [2019-12-27 21:39:16,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:16" (1/1) ... [2019-12-27 21:39:16,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:16" (1/1) ... [2019-12-27 21:39:16,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:16" (1/1) ... [2019-12-27 21:39:16,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:39:16,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:39:16,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:39:16,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:39:16,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:16" (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 21:39:16,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:39:16,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:39:16,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:39:16,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:39:16,873 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:39:16,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:39:16,874 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:39:16,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:39:16,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:39:16,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:39:16,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:39:16,877 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 21:39:17,541 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:39:17,541 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:39:17,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:39:17 BoogieIcfgContainer [2019-12-27 21:39:17,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:39:17,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:39:17,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:39:17,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:39:17,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:39:15" (1/3) ... [2019-12-27 21:39:17,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ef2c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:39:17, skipping insertion in model container [2019-12-27 21:39:17,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:16" (2/3) ... [2019-12-27 21:39:17,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ef2c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:39:17, skipping insertion in model container [2019-12-27 21:39:17,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:39:17" (3/3) ... [2019-12-27 21:39:17,552 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_rmo.oepc.i [2019-12-27 21:39:17,563 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:39:17,563 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:39:17,571 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:39:17,572 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:39:17,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,611 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,611 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,611 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,612 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,613 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,623 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,623 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,672 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,672 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,673 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,683 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,686 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:17,703 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:39:17,724 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:39:17,724 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:39:17,724 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:39:17,724 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:39:17,724 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:39:17,725 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:39:17,725 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:39:17,725 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:39:17,747 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 21:39:17,749 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 21:39:17,880 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 21:39:17,881 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:39:17,894 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:39:17,910 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 21:39:17,958 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 21:39:17,959 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:39:17,964 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:39:17,977 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 21:39:17,979 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:39:21,076 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 21:39:21,193 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54539 [2019-12-27 21:39:21,194 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 21:39:21,197 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 86 transitions [2019-12-27 21:39:21,659 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8432 states. [2019-12-27 21:39:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 8432 states. [2019-12-27 21:39:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:39:21,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:21,669 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:39:21,669 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:21,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:21,676 INFO L82 PathProgramCache]: Analyzing trace with hash 787368, now seen corresponding path program 1 times [2019-12-27 21:39:21,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:21,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804524773] [2019-12-27 21:39:21,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:21,912 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 21:39:21,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804524773] [2019-12-27 21:39:21,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:21,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:39:21,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [164659255] [2019-12-27 21:39:21,917 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:21,922 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:21,935 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:39:21,935 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:21,939 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:21,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:21,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:21,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:21,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:21,956 INFO L87 Difference]: Start difference. First operand 8432 states. Second operand 3 states. [2019-12-27 21:39:22,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:22,190 INFO L93 Difference]: Finished difference Result 8310 states and 27124 transitions. [2019-12-27 21:39:22,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:22,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:39:22,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:22,296 INFO L225 Difference]: With dead ends: 8310 [2019-12-27 21:39:22,297 INFO L226 Difference]: Without dead ends: 7790 [2019-12-27 21:39:22,303 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 21:39:22,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7790 states. [2019-12-27 21:39:22,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7790 to 7790. [2019-12-27 21:39:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7790 states. [2019-12-27 21:39:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7790 states to 7790 states and 25381 transitions. [2019-12-27 21:39:22,850 INFO L78 Accepts]: Start accepts. Automaton has 7790 states and 25381 transitions. Word has length 3 [2019-12-27 21:39:22,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:22,851 INFO L462 AbstractCegarLoop]: Abstraction has 7790 states and 25381 transitions. [2019-12-27 21:39:22,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 7790 states and 25381 transitions. [2019-12-27 21:39:22,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:39:22,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:22,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:22,858 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:22,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:22,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1148786608, now seen corresponding path program 1 times [2019-12-27 21:39:22,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:22,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105641930] [2019-12-27 21:39:22,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:22,983 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 21:39:22,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105641930] [2019-12-27 21:39:22,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:22,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:22,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [355983873] [2019-12-27 21:39:22,986 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:22,988 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:22,990 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:39:22,990 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:22,990 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:22,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:39:22,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:22,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:39:22,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:39:22,994 INFO L87 Difference]: Start difference. First operand 7790 states and 25381 transitions. Second operand 4 states. [2019-12-27 21:39:23,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:23,522 INFO L93 Difference]: Finished difference Result 12240 states and 38069 transitions. [2019-12-27 21:39:23,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:39:23,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:39:23,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:23,592 INFO L225 Difference]: With dead ends: 12240 [2019-12-27 21:39:23,592 INFO L226 Difference]: Without dead ends: 12233 [2019-12-27 21:39:23,593 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 21:39:23,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12233 states. [2019-12-27 21:39:23,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12233 to 11012. [2019-12-27 21:39:23,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11012 states. [2019-12-27 21:39:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11012 states to 11012 states and 34845 transitions. [2019-12-27 21:39:23,996 INFO L78 Accepts]: Start accepts. Automaton has 11012 states and 34845 transitions. Word has length 11 [2019-12-27 21:39:23,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:23,997 INFO L462 AbstractCegarLoop]: Abstraction has 11012 states and 34845 transitions. [2019-12-27 21:39:23,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:39:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 11012 states and 34845 transitions. [2019-12-27 21:39:24,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:39:24,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:24,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:24,002 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:24,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:24,004 INFO L82 PathProgramCache]: Analyzing trace with hash 440538846, now seen corresponding path program 1 times [2019-12-27 21:39:24,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:24,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759371572] [2019-12-27 21:39:24,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:24,222 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 21:39:24,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759371572] [2019-12-27 21:39:24,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:24,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:39:24,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [788475051] [2019-12-27 21:39:24,225 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:24,227 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:24,229 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:39:24,229 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:24,230 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:24,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:39:24,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:24,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:39:24,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:39:24,231 INFO L87 Difference]: Start difference. First operand 11012 states and 34845 transitions. Second operand 5 states. [2019-12-27 21:39:24,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:24,637 INFO L93 Difference]: Finished difference Result 15483 states and 48326 transitions. [2019-12-27 21:39:24,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:39:24,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 21:39:24,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:24,694 INFO L225 Difference]: With dead ends: 15483 [2019-12-27 21:39:24,694 INFO L226 Difference]: Without dead ends: 15483 [2019-12-27 21:39:24,694 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 21:39:24,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15483 states. [2019-12-27 21:39:25,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15483 to 12390. [2019-12-27 21:39:25,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12390 states. [2019-12-27 21:39:25,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12390 states to 12390 states and 39189 transitions. [2019-12-27 21:39:25,780 INFO L78 Accepts]: Start accepts. Automaton has 12390 states and 39189 transitions. Word has length 14 [2019-12-27 21:39:25,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:25,781 INFO L462 AbstractCegarLoop]: Abstraction has 12390 states and 39189 transitions. [2019-12-27 21:39:25,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:39:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 12390 states and 39189 transitions. [2019-12-27 21:39:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:39:25,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:25,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:25,786 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:25,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:25,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1898414351, now seen corresponding path program 1 times [2019-12-27 21:39:25,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:25,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113713655] [2019-12-27 21:39:25,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:25,900 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 21:39:25,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113713655] [2019-12-27 21:39:25,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:25,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:39:25,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [520156165] [2019-12-27 21:39:25,902 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:25,906 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:25,909 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 21:39:25,909 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:25,910 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:25,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:25,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:25,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:25,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:25,912 INFO L87 Difference]: Start difference. First operand 12390 states and 39189 transitions. Second operand 3 states. [2019-12-27 21:39:26,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:26,000 INFO L93 Difference]: Finished difference Result 12387 states and 39180 transitions. [2019-12-27 21:39:26,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:26,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 21:39:26,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:26,045 INFO L225 Difference]: With dead ends: 12387 [2019-12-27 21:39:26,046 INFO L226 Difference]: Without dead ends: 12387 [2019-12-27 21:39:26,046 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 21:39:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12387 states. [2019-12-27 21:39:26,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12387 to 12387. [2019-12-27 21:39:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12387 states. [2019-12-27 21:39:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12387 states to 12387 states and 39180 transitions. [2019-12-27 21:39:26,488 INFO L78 Accepts]: Start accepts. Automaton has 12387 states and 39180 transitions. Word has length 16 [2019-12-27 21:39:26,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:26,489 INFO L462 AbstractCegarLoop]: Abstraction has 12387 states and 39180 transitions. [2019-12-27 21:39:26,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 12387 states and 39180 transitions. [2019-12-27 21:39:26,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:39:26,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:26,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:26,494 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:26,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:26,494 INFO L82 PathProgramCache]: Analyzing trace with hash 242771609, now seen corresponding path program 1 times [2019-12-27 21:39:26,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:26,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840921783] [2019-12-27 21:39:26,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:26,565 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 21:39:26,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840921783] [2019-12-27 21:39:26,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:26,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:26,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1821524332] [2019-12-27 21:39:26,567 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:26,570 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:26,573 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:39:26,573 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:26,620 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:39:26,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:39:26,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:26,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:39:26,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:39:26,621 INFO L87 Difference]: Start difference. First operand 12387 states and 39180 transitions. Second operand 4 states. [2019-12-27 21:39:26,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:26,743 INFO L93 Difference]: Finished difference Result 20943 states and 65829 transitions. [2019-12-27 21:39:26,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:26,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 21:39:26,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:26,770 INFO L225 Difference]: With dead ends: 20943 [2019-12-27 21:39:26,770 INFO L226 Difference]: Without dead ends: 11612 [2019-12-27 21:39:26,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:39:26,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11612 states. [2019-12-27 21:39:27,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11612 to 10925. [2019-12-27 21:39:27,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10925 states. [2019-12-27 21:39:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10925 states to 10925 states and 33699 transitions. [2019-12-27 21:39:27,266 INFO L78 Accepts]: Start accepts. Automaton has 10925 states and 33699 transitions. Word has length 17 [2019-12-27 21:39:27,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:27,266 INFO L462 AbstractCegarLoop]: Abstraction has 10925 states and 33699 transitions. [2019-12-27 21:39:27,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:39:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 10925 states and 33699 transitions. [2019-12-27 21:39:27,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:39:27,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:27,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:27,274 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:27,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:27,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1332750577, now seen corresponding path program 1 times [2019-12-27 21:39:27,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:27,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724551633] [2019-12-27 21:39:27,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:27,376 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 21:39:27,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724551633] [2019-12-27 21:39:27,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:27,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:27,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [749662258] [2019-12-27 21:39:27,377 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:27,379 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:27,383 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 32 transitions. [2019-12-27 21:39:27,383 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:27,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:39:27,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:27,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:27,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:27,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:27,386 INFO L87 Difference]: Start difference. First operand 10925 states and 33699 transitions. Second operand 3 states. [2019-12-27 21:39:27,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:27,449 INFO L93 Difference]: Finished difference Result 10925 states and 33164 transitions. [2019-12-27 21:39:27,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:27,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 21:39:27,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:27,473 INFO L225 Difference]: With dead ends: 10925 [2019-12-27 21:39:27,473 INFO L226 Difference]: Without dead ends: 10925 [2019-12-27 21:39:27,474 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 21:39:27,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10925 states. [2019-12-27 21:39:27,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10925 to 10917. [2019-12-27 21:39:27,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10917 states. [2019-12-27 21:39:27,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10917 states to 10917 states and 33148 transitions. [2019-12-27 21:39:27,764 INFO L78 Accepts]: Start accepts. Automaton has 10917 states and 33148 transitions. Word has length 17 [2019-12-27 21:39:27,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:27,765 INFO L462 AbstractCegarLoop]: Abstraction has 10917 states and 33148 transitions. [2019-12-27 21:39:27,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:27,765 INFO L276 IsEmpty]: Start isEmpty. Operand 10917 states and 33148 transitions. [2019-12-27 21:39:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:39:27,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:27,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:27,770 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:27,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:27,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1842424808, now seen corresponding path program 1 times [2019-12-27 21:39:27,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:27,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515034408] [2019-12-27 21:39:27,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:27,828 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 21:39:27,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515034408] [2019-12-27 21:39:27,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:27,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:39:27,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [359825577] [2019-12-27 21:39:27,829 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:27,831 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:27,833 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 23 transitions. [2019-12-27 21:39:27,833 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:27,835 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:39:27,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:39:27,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:27,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:39:27,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:39:27,836 INFO L87 Difference]: Start difference. First operand 10917 states and 33148 transitions. Second operand 4 states. [2019-12-27 21:39:27,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:27,866 INFO L93 Difference]: Finished difference Result 1827 states and 4498 transitions. [2019-12-27 21:39:27,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:39:27,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 21:39:27,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:27,869 INFO L225 Difference]: With dead ends: 1827 [2019-12-27 21:39:27,869 INFO L226 Difference]: Without dead ends: 1295 [2019-12-27 21:39:27,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 21:39:27,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2019-12-27 21:39:27,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1295. [2019-12-27 21:39:27,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2019-12-27 21:39:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 2824 transitions. [2019-12-27 21:39:27,891 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 2824 transitions. Word has length 17 [2019-12-27 21:39:27,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:27,891 INFO L462 AbstractCegarLoop]: Abstraction has 1295 states and 2824 transitions. [2019-12-27 21:39:27,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:39:27,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 2824 transitions. [2019-12-27 21:39:27,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:39:27,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:27,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:27,894 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:27,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:27,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1197258380, now seen corresponding path program 1 times [2019-12-27 21:39:27,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:27,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921017797] [2019-12-27 21:39:27,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:27,976 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 21:39:27,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921017797] [2019-12-27 21:39:27,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:27,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:39:27,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [723977094] [2019-12-27 21:39:27,978 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:27,984 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:27,990 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:39:27,990 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:27,991 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:27,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:39:27,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:27,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:39:27,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:39:27,992 INFO L87 Difference]: Start difference. First operand 1295 states and 2824 transitions. Second operand 6 states. [2019-12-27 21:39:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:28,354 INFO L93 Difference]: Finished difference Result 1351 states and 2894 transitions. [2019-12-27 21:39:28,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:39:28,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 21:39:28,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:28,357 INFO L225 Difference]: With dead ends: 1351 [2019-12-27 21:39:28,357 INFO L226 Difference]: Without dead ends: 1300 [2019-12-27 21:39:28,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 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 21:39:28,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2019-12-27 21:39:28,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1241. [2019-12-27 21:39:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-12-27 21:39:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 2709 transitions. [2019-12-27 21:39:28,377 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 2709 transitions. Word has length 25 [2019-12-27 21:39:28,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:28,377 INFO L462 AbstractCegarLoop]: Abstraction has 1241 states and 2709 transitions. [2019-12-27 21:39:28,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:39:28,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 2709 transitions. [2019-12-27 21:39:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 21:39:28,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:28,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] [2019-12-27 21:39:28,380 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:28,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:28,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1913919297, now seen corresponding path program 1 times [2019-12-27 21:39:28,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:28,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105014271] [2019-12-27 21:39:28,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:28,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105014271] [2019-12-27 21:39:28,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:28,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:39:28,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [873821553] [2019-12-27 21:39:28,454 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:28,458 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:28,469 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 21:39:28,470 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:28,487 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:39:28,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:39:28,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:28,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:39:28,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:39:28,488 INFO L87 Difference]: Start difference. First operand 1241 states and 2709 transitions. Second operand 6 states. [2019-12-27 21:39:28,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:28,530 INFO L93 Difference]: Finished difference Result 662 states and 1418 transitions. [2019-12-27 21:39:28,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:39:28,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 21:39:28,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:28,532 INFO L225 Difference]: With dead ends: 662 [2019-12-27 21:39:28,532 INFO L226 Difference]: Without dead ends: 524 [2019-12-27 21:39:28,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:39:28,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-12-27 21:39:28,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2019-12-27 21:39:28,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-12-27 21:39:28,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1164 transitions. [2019-12-27 21:39:28,541 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1164 transitions. Word has length 28 [2019-12-27 21:39:28,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:28,541 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 1164 transitions. [2019-12-27 21:39:28,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:39:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1164 transitions. [2019-12-27 21:39:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:39:28,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:28,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:28,544 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:28,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:28,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2101668284, now seen corresponding path program 1 times [2019-12-27 21:39:28,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:28,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108109962] [2019-12-27 21:39:28,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:28,585 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 21:39:28,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108109962] [2019-12-27 21:39:28,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:28,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:39:28,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1034535629] [2019-12-27 21:39:28,586 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:28,600 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:28,674 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 184 transitions. [2019-12-27 21:39:28,674 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:28,686 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:39:28,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:28,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:28,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:28,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:28,687 INFO L87 Difference]: Start difference. First operand 524 states and 1164 transitions. Second operand 3 states. [2019-12-27 21:39:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:28,734 INFO L93 Difference]: Finished difference Result 776 states and 1668 transitions. [2019-12-27 21:39:28,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:28,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:39:28,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:28,736 INFO L225 Difference]: With dead ends: 776 [2019-12-27 21:39:28,737 INFO L226 Difference]: Without dead ends: 776 [2019-12-27 21:39:28,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 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 21:39:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2019-12-27 21:39:28,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 584. [2019-12-27 21:39:28,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-12-27 21:39:28,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1284 transitions. [2019-12-27 21:39:28,753 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1284 transitions. Word has length 52 [2019-12-27 21:39:28,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:28,753 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 1284 transitions. [2019-12-27 21:39:28,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:28,753 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1284 transitions. [2019-12-27 21:39:28,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:39:28,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:28,756 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] [2019-12-27 21:39:28,756 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:28,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:28,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1679965585, now seen corresponding path program 1 times [2019-12-27 21:39:28,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:28,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600624521] [2019-12-27 21:39:28,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:28,879 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 21:39:28,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600624521] [2019-12-27 21:39:28,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:28,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:39:28,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2075477924] [2019-12-27 21:39:28,881 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:28,903 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:28,996 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 184 transitions. [2019-12-27 21:39:28,996 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:29,132 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:39:29,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:39:29,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:29,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:39:29,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:39:29,133 INFO L87 Difference]: Start difference. First operand 584 states and 1284 transitions. Second operand 10 states. [2019-12-27 21:39:29,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:29,602 INFO L93 Difference]: Finished difference Result 1131 states and 2408 transitions. [2019-12-27 21:39:29,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:39:29,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-12-27 21:39:29,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:29,604 INFO L225 Difference]: With dead ends: 1131 [2019-12-27 21:39:29,604 INFO L226 Difference]: Without dead ends: 792 [2019-12-27 21:39:29,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:39:29,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-12-27 21:39:29,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 639. [2019-12-27 21:39:29,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-12-27 21:39:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1372 transitions. [2019-12-27 21:39:29,617 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1372 transitions. Word has length 52 [2019-12-27 21:39:29,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:29,617 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 1372 transitions. [2019-12-27 21:39:29,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:39:29,618 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1372 transitions. [2019-12-27 21:39:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:39:29,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:29,621 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] [2019-12-27 21:39:29,621 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:29,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:29,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1571745907, now seen corresponding path program 2 times [2019-12-27 21:39:29,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:29,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918974987] [2019-12-27 21:39:29,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:29,721 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 21:39:29,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918974987] [2019-12-27 21:39:29,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:29,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:29,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1206488407] [2019-12-27 21:39:29,723 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:29,738 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:29,780 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 92 transitions. [2019-12-27 21:39:29,780 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:29,782 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:29,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:29,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:29,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:29,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:29,783 INFO L87 Difference]: Start difference. First operand 639 states and 1372 transitions. Second operand 3 states. [2019-12-27 21:39:29,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:29,836 INFO L93 Difference]: Finished difference Result 784 states and 1673 transitions. [2019-12-27 21:39:29,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:29,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:39:29,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:29,839 INFO L225 Difference]: With dead ends: 784 [2019-12-27 21:39:29,839 INFO L226 Difference]: Without dead ends: 784 [2019-12-27 21:39:29,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 21:39:29,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-12-27 21:39:29,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 688. [2019-12-27 21:39:29,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-12-27 21:39:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1481 transitions. [2019-12-27 21:39:29,852 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1481 transitions. Word has length 52 [2019-12-27 21:39:29,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:29,852 INFO L462 AbstractCegarLoop]: Abstraction has 688 states and 1481 transitions. [2019-12-27 21:39:29,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:29,853 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1481 transitions. [2019-12-27 21:39:29,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:39:29,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:29,855 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] [2019-12-27 21:39:29,855 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:29,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:29,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1281220607, now seen corresponding path program 1 times [2019-12-27 21:39:29,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:29,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591175052] [2019-12-27 21:39:29,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:39:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:39:30,017 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:39:30,017 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:39:30,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#valid_44| (store .cse0 |v_ULTIMATE.start_main_~#t1449~0.base_22| 1)) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~y$w_buff1~0_24) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_53) (= |v_#NULL.offset_3| 0) (= v_~y$r_buff0_thd2~0_80 0) (= v_~main$tmp_guard0~0_8 0) (= v_~y$w_buff0_used~0_103 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1449~0.base_22| 4)) (= 0 v_~weak$$choice2~0_32) (= 0 v_~y$r_buff1_thd0~0_26) (= 0 v_~y$flush_delayed~0_13) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1449~0.base_22|)) (= 0 |v_ULTIMATE.start_main_~#t1449~0.offset_17|) (= v_~y$r_buff0_thd1~0_29 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1449~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1449~0.base_22|) |v_ULTIMATE.start_main_~#t1449~0.offset_17| 0)) |v_#memory_int_13|) (= v_~x~0_18 0) (= v_~y$w_buff1_used~0_65 0) (= 0 v_~weak$$choice0~0_7) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_23 0) (= 0 v_~y$r_buff1_thd1~0_19) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1449~0.base_22|) (= 0 |v_#NULL.base_3|) (= v_~y$mem_tmp~0_10 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1450~0.offset=|v_ULTIMATE.start_main_~#t1450~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_23|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t1449~0.base=|v_ULTIMATE.start_main_~#t1449~0.base_22|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_15|, ~y~0=v_~y~0_25, ULTIMATE.start_main_~#t1450~0.base=|v_ULTIMATE.start_main_~#t1450~0.base_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_23, #valid=|v_#valid_44|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_80, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ULTIMATE.start_main_~#t1449~0.offset=|v_ULTIMATE.start_main_~#t1449~0.offset_17|, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_26, ~x~0=v_~x~0_18, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1450~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ULTIMATE.start_main_~#t1449~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1450~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1449~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:39:30,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L792-1-->L794: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1450~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1450~0.offset_10| 0) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1450~0.base_11|) 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1450~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1450~0.base_11|) |v_ULTIMATE.start_main_~#t1450~0.offset_10| 1)) |v_#memory_int_7|) (not (= |v_ULTIMATE.start_main_~#t1450~0.base_11| 0)) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1450~0.base_11| 1) |v_#valid_23|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1450~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1450~0.offset=|v_ULTIMATE.start_main_~#t1450~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1450~0.base=|v_ULTIMATE.start_main_~#t1450~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1450~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1450~0.base] because there is no mapped edge [2019-12-27 21:39:30,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L4-->L736: Formula: (and (= ~y$r_buff1_thd1~0_Out-2097139772 ~y$r_buff0_thd1~0_In-2097139772) (= ~y$r_buff1_thd0~0_Out-2097139772 ~y$r_buff0_thd0~0_In-2097139772) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-2097139772 0)) (= 1 ~x~0_Out-2097139772) (= 1 ~y$r_buff0_thd1~0_Out-2097139772) (= ~y$r_buff1_thd2~0_Out-2097139772 ~y$r_buff0_thd2~0_In-2097139772)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2097139772, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2097139772, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2097139772, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-2097139772} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-2097139772, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-2097139772, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2097139772, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2097139772, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2097139772, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-2097139772, ~x~0=~x~0_Out-2097139772, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-2097139772} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 21:39:30,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1627324382 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1627324382 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1627324382 |P0Thread1of1ForFork0_#t~ite5_Out-1627324382|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1627324382|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1627324382, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1627324382} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1627324382|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1627324382, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1627324382} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:39:30,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2106071860 256)))) (or (and (= ~y$w_buff0~0_In-2106071860 |P1Thread1of1ForFork1_#t~ite15_Out-2106071860|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In-2106071860| |P1Thread1of1ForFork1_#t~ite14_Out-2106071860|)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out-2106071860| |P1Thread1of1ForFork1_#t~ite14_Out-2106071860|) (= ~y$w_buff0~0_In-2106071860 |P1Thread1of1ForFork1_#t~ite14_Out-2106071860|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2106071860 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-2106071860 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-2106071860 256)) (and (= (mod ~y$r_buff1_thd2~0_In-2106071860 256) 0) .cse1))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2106071860, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2106071860, ~y$w_buff0~0=~y$w_buff0~0_In-2106071860, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2106071860, ~weak$$choice2~0=~weak$$choice2~0_In-2106071860, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-2106071860|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2106071860} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2106071860, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2106071860, ~y$w_buff0~0=~y$w_buff0~0_In-2106071860, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2106071860, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-2106071860|, ~weak$$choice2~0=~weak$$choice2~0_In-2106071860, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2106071860|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2106071860} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:39:30,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L760-->L760-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1729571851 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In-1729571851| |P1Thread1of1ForFork1_#t~ite20_Out-1729571851|) (not .cse0) (= ~y$w_buff0_used~0_In-1729571851 |P1Thread1of1ForFork1_#t~ite21_Out-1729571851|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1729571851 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1729571851 256)) (and (= (mod ~y$w_buff1_used~0_In-1729571851 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1729571851 256))))) (= |P1Thread1of1ForFork1_#t~ite20_Out-1729571851| |P1Thread1of1ForFork1_#t~ite21_Out-1729571851|) (= |P1Thread1of1ForFork1_#t~ite20_Out-1729571851| ~y$w_buff0_used~0_In-1729571851)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1729571851, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1729571851, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1729571851|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1729571851, ~weak$$choice2~0=~weak$$choice2~0_In-1729571851, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1729571851} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1729571851, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1729571851, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1729571851|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1729571851, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1729571851|, ~weak$$choice2~0=~weak$$choice2~0_In-1729571851, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1729571851} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 21:39:30,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff0_thd2~0_48)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_16, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 21:39:30,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-794247082 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In-794247082| |P1Thread1of1ForFork1_#t~ite29_Out-794247082|) (= ~y$r_buff1_thd2~0_In-794247082 |P1Thread1of1ForFork1_#t~ite30_Out-794247082|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-794247082 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-794247082 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-794247082 256) 0)) (= (mod ~y$w_buff0_used~0_In-794247082 256) 0))) (= |P1Thread1of1ForFork1_#t~ite29_Out-794247082| |P1Thread1of1ForFork1_#t~ite30_Out-794247082|) (= |P1Thread1of1ForFork1_#t~ite29_Out-794247082| ~y$r_buff1_thd2~0_In-794247082) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-794247082, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-794247082|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-794247082, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-794247082, ~weak$$choice2~0=~weak$$choice2~0_In-794247082, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-794247082} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-794247082, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-794247082|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-794247082|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-794247082, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-794247082, ~weak$$choice2~0=~weak$$choice2~0_In-794247082, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-794247082} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 21:39:30,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= v_~y~0_15 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 21:39:30,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1097691698 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1097691698 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out1097691698| |P1Thread1of1ForFork1_#t~ite32_Out1097691698|))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In1097691698 |P1Thread1of1ForFork1_#t~ite32_Out1097691698|)) (and (not .cse1) (= ~y$w_buff1~0_In1097691698 |P1Thread1of1ForFork1_#t~ite32_Out1097691698|) (not .cse0) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1097691698, ~y$w_buff1~0=~y$w_buff1~0_In1097691698, ~y~0=~y~0_In1097691698, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1097691698} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1097691698, ~y$w_buff1~0=~y$w_buff1~0_In1097691698, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1097691698|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1097691698|, ~y~0=~y~0_In1097691698, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1097691698} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 21:39:30,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In870968814 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In870968814 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out870968814| ~y$w_buff0_used~0_In870968814)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out870968814| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In870968814, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In870968814} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In870968814, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In870968814, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out870968814|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 21:39:30,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In1266304170 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1266304170 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1266304170 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1266304170 256)))) (or (and (= ~y$w_buff1_used~0_In1266304170 |P1Thread1of1ForFork1_#t~ite35_Out1266304170|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1266304170|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1266304170, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1266304170, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1266304170, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1266304170} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1266304170, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1266304170, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1266304170, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1266304170|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1266304170} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 21:39:30,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-698731986 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-698731986 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-698731986| ~y$r_buff0_thd2~0_In-698731986)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-698731986| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-698731986, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-698731986} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-698731986, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-698731986, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-698731986|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 21:39:30,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In893487027 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In893487027 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In893487027 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In893487027 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In893487027 |P1Thread1of1ForFork1_#t~ite37_Out893487027|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out893487027|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In893487027, ~y$w_buff0_used~0=~y$w_buff0_used~0_In893487027, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In893487027, ~y$w_buff1_used~0=~y$w_buff1_used~0_In893487027} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In893487027, ~y$w_buff0_used~0=~y$w_buff0_used~0_In893487027, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In893487027, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out893487027|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In893487027} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:39:30,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_43 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:39:30,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-583085535 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-583085535 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-583085535 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-583085535 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-583085535|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-583085535 |P0Thread1of1ForFork0_#t~ite6_Out-583085535|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-583085535, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-583085535, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-583085535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-583085535} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-583085535|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-583085535, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-583085535, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-583085535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-583085535} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:39:30,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1970328274 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1970328274 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In1970328274 ~y$r_buff0_thd1~0_Out1970328274)) (and (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out1970328274) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1970328274, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1970328274} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1970328274, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1970328274|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1970328274} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:39:30,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1860847074 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1860847074 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1860847074 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1860847074 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1860847074| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-1860847074| ~y$r_buff1_thd1~0_In-1860847074) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1860847074, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1860847074, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1860847074, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1860847074} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1860847074, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1860847074, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1860847074|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1860847074, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1860847074} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:39:30,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_12, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 21:39:30,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_79 256) 0) (= (mod v_~y$r_buff0_thd0~0_15 256) 0)) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:39:30,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-108179840 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-108179840 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite40_Out-108179840| |ULTIMATE.start_main_#t~ite41_Out-108179840|))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-108179840| ~y$w_buff1~0_In-108179840) .cse2) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-108179840| ~y~0_In-108179840) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-108179840, ~y~0=~y~0_In-108179840, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-108179840, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-108179840} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-108179840|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-108179840|, ~y$w_buff1~0=~y$w_buff1~0_In-108179840, ~y~0=~y~0_In-108179840, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-108179840, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-108179840} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:39:30,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1296687898 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1296687898 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1296687898| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out-1296687898| ~y$w_buff0_used~0_In-1296687898) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1296687898, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1296687898} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1296687898, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1296687898, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1296687898|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:39:30,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1785976353 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1785976353 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1785976353 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1785976353 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1785976353| ~y$w_buff1_used~0_In-1785976353) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out-1785976353| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1785976353, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1785976353, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1785976353, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1785976353} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1785976353, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1785976353, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1785976353|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1785976353, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1785976353} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 21:39:30,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1314837155 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1314837155 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1314837155|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-1314837155 |ULTIMATE.start_main_#t~ite44_Out-1314837155|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1314837155, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1314837155} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1314837155, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1314837155, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1314837155|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:39:30,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-638198693 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-638198693 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-638198693 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-638198693 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-638198693| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-638198693| ~y$r_buff1_thd0~0_In-638198693) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-638198693, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-638198693, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-638198693, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-638198693} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-638198693, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-638198693, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-638198693, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-638198693|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-638198693} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:39:30,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= |v_ULTIMATE.start_main_#t~ite45_13| v_~y$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~x~0=v_~x~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:39:30,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:39:30 BasicIcfg [2019-12-27 21:39:30,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:39:30,100 INFO L168 Benchmark]: Toolchain (without parser) took 14330.76 ms. Allocated memory was 141.6 MB in the beginning and 666.4 MB in the end (delta: 524.8 MB). Free memory was 103.0 MB in the beginning and 462.5 MB in the end (delta: -359.5 MB). Peak memory consumption was 165.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:30,101 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 141.6 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:39:30,102 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.70 ms. Allocated memory was 141.6 MB in the beginning and 209.2 MB in the end (delta: 67.6 MB). Free memory was 102.6 MB in the beginning and 163.9 MB in the end (delta: -61.2 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:30,102 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.62 ms. Allocated memory is still 209.2 MB. Free memory was 163.9 MB in the beginning and 161.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:30,103 INFO L168 Benchmark]: Boogie Preprocessor took 50.56 ms. Allocated memory is still 209.2 MB. Free memory was 161.2 MB in the beginning and 158.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:30,104 INFO L168 Benchmark]: RCFGBuilder took 765.56 ms. Allocated memory is still 209.2 MB. Free memory was 158.6 MB in the beginning and 114.5 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:30,105 INFO L168 Benchmark]: TraceAbstraction took 12553.85 ms. Allocated memory was 209.2 MB in the beginning and 666.4 MB in the end (delta: 457.2 MB). Free memory was 113.9 MB in the beginning and 462.5 MB in the end (delta: -348.7 MB). Peak memory consumption was 108.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:30,108 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.20 ms. Allocated memory is still 141.6 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 845.70 ms. Allocated memory was 141.6 MB in the beginning and 209.2 MB in the end (delta: 67.6 MB). Free memory was 102.6 MB in the beginning and 163.9 MB in the end (delta: -61.2 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 109.62 ms. Allocated memory is still 209.2 MB. Free memory was 163.9 MB in the beginning and 161.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.56 ms. Allocated memory is still 209.2 MB. Free memory was 161.2 MB in the beginning and 158.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 765.56 ms. Allocated memory is still 209.2 MB. Free memory was 158.6 MB in the beginning and 114.5 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12553.85 ms. Allocated memory was 209.2 MB in the beginning and 666.4 MB in the end (delta: 457.2 MB). Free memory was 113.9 MB in the beginning and 462.5 MB in the end (delta: -348.7 MB). Peak memory consumption was 108.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 146 ProgramPointsBefore, 76 ProgramPointsAfterwards, 180 TransitionsBefore, 86 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 28 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 27 ChoiceCompositions, 4499 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54539 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L792] FCALL, FORK 0 pthread_create(&t1449, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1450, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.2s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1269 SDtfs, 1307 SDslu, 2209 SDs, 0 SdLazy, 893 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12390occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 5509 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 25812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...