/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:11:35,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:11:35,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:11:35,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:11:35,635 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:11:35,636 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:11:35,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:11:35,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:11:35,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:11:35,642 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:11:35,643 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:11:35,644 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:11:35,644 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:11:35,645 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:11:35,646 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:11:35,647 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:11:35,648 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:11:35,649 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:11:35,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:11:35,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:11:35,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:11:35,656 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:11:35,657 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:11:35,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:11:35,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:11:35,660 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:11:35,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:11:35,661 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:11:35,662 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:11:35,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:11:35,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:11:35,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:11:35,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:11:35,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:11:35,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:11:35,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:11:35,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:11:35,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:11:35,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:11:35,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:11:35,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:11:35,681 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.epf [2019-12-18 21:11:35,704 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:11:35,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:11:35,705 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:11:35,705 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:11:35,706 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:11:35,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:11:35,706 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:11:35,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:11:35,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:11:35,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:11:35,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:11:35,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:11:35,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:11:35,707 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:11:35,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:11:35,708 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:11:35,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:11:35,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:11:35,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:11:35,709 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:11:35,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:11:35,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:11:35,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:11:35,709 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:11:35,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:11:35,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:11:35,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:11:35,710 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:11:35,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:11:35,711 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:11:35,959 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:11:35,974 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:11:35,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:11:35,979 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:11:35,979 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:11:35,980 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt.i [2019-12-18 21:11:36,040 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8bc5a0b5/d2c331e1c7d14e8bb1db450f9c74d32d/FLAGbd5eaa2dc [2019-12-18 21:11:36,612 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:11:36,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_pso.opt.i [2019-12-18 21:11:36,637 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8bc5a0b5/d2c331e1c7d14e8bb1db450f9c74d32d/FLAGbd5eaa2dc [2019-12-18 21:11:36,878 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8bc5a0b5/d2c331e1c7d14e8bb1db450f9c74d32d [2019-12-18 21:11:36,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:11:36,888 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:11:36,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:11:36,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:11:36,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:11:36,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:11:36" (1/1) ... [2019-12-18 21:11:36,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a341f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:36, skipping insertion in model container [2019-12-18 21:11:36,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:11:36" (1/1) ... [2019-12-18 21:11:36,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:11:36,964 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:11:37,510 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:11:37,525 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:11:37,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:11:37,743 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:11:37,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:37 WrapperNode [2019-12-18 21:11:37,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:11:37,744 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:11:37,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:11:37,745 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:11:37,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:37" (1/1) ... [2019-12-18 21:11:37,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:37" (1/1) ... [2019-12-18 21:11:37,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:11:37,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:11:37,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:11:37,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:11:37,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:37" (1/1) ... [2019-12-18 21:11:37,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:37" (1/1) ... [2019-12-18 21:11:37,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:37" (1/1) ... [2019-12-18 21:11:37,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:37" (1/1) ... [2019-12-18 21:11:37,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:37" (1/1) ... [2019-12-18 21:11:37,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:37" (1/1) ... [2019-12-18 21:11:37,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:37" (1/1) ... [2019-12-18 21:11:37,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:11:37,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:11:37,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:11:37,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:11:37,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:37" (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-18 21:11:37,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:11:37,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:11:37,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:11:37,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:11:37,999 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:11:38,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:11:38,000 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:11:38,001 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:11:38,001 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:11:38,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:11:38,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:11:38,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:11:38,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:11:38,005 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:11:38,718 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:11:38,719 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:11:38,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:11:38 BoogieIcfgContainer [2019-12-18 21:11:38,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:11:38,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:11:38,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:11:38,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:11:38,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:11:36" (1/3) ... [2019-12-18 21:11:38,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf051c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:11:38, skipping insertion in model container [2019-12-18 21:11:38,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:37" (2/3) ... [2019-12-18 21:11:38,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf051c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:11:38, skipping insertion in model container [2019-12-18 21:11:38,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:11:38" (3/3) ... [2019-12-18 21:11:38,732 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt.i [2019-12-18 21:11:38,744 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:11:38,744 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:11:38,762 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:11:38,763 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:11:38,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,805 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,806 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,809 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,809 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,832 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,833 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,833 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,833 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,834 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,844 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,845 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,869 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,871 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,875 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,875 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,876 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:38,895 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:11:38,915 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:11:38,915 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:11:38,916 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:11:38,916 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:11:38,916 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:11:38,916 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:11:38,916 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:11:38,916 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:11:38,939 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 179 transitions [2019-12-18 21:11:38,942 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 154 places, 179 transitions [2019-12-18 21:11:39,026 INFO L126 PetriNetUnfolder]: 35/176 cut-off events. [2019-12-18 21:11:39,026 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:11:39,040 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 35/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 358 event pairs. 9/148 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 21:11:39,061 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 154 places, 179 transitions [2019-12-18 21:11:39,101 INFO L126 PetriNetUnfolder]: 35/176 cut-off events. [2019-12-18 21:11:39,101 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:11:39,109 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 35/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 358 event pairs. 9/148 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 21:11:39,124 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-18 21:11:39,126 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:11:42,253 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 21:11:42,709 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 21:11:42,852 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 21:11:42,886 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47747 [2019-12-18 21:11:42,887 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 21:11:42,892 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 82 transitions [2019-12-18 21:11:43,704 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13626 states. [2019-12-18 21:11:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 13626 states. [2019-12-18 21:11:43,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 21:11:43,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:43,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:43,713 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:43,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:43,719 INFO L82 PathProgramCache]: Analyzing trace with hash 689231800, now seen corresponding path program 1 times [2019-12-18 21:11:43,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:43,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122058591] [2019-12-18 21:11:43,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:43,951 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-18 21:11:43,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122058591] [2019-12-18 21:11:43,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:43,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:11:43,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081238287] [2019-12-18 21:11:43,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:43,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:43,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:43,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:43,979 INFO L87 Difference]: Start difference. First operand 13626 states. Second operand 3 states. [2019-12-18 21:11:44,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:44,318 INFO L93 Difference]: Finished difference Result 13066 states and 50272 transitions. [2019-12-18 21:11:44,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:44,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 21:11:44,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:44,504 INFO L225 Difference]: With dead ends: 13066 [2019-12-18 21:11:44,505 INFO L226 Difference]: Without dead ends: 12286 [2019-12-18 21:11:44,506 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-18 21:11:44,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12286 states. [2019-12-18 21:11:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12286 to 12286. [2019-12-18 21:11:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12286 states. [2019-12-18 21:11:45,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12286 states to 12286 states and 47196 transitions. [2019-12-18 21:11:45,251 INFO L78 Accepts]: Start accepts. Automaton has 12286 states and 47196 transitions. Word has length 7 [2019-12-18 21:11:45,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:45,252 INFO L462 AbstractCegarLoop]: Abstraction has 12286 states and 47196 transitions. [2019-12-18 21:11:45,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:45,253 INFO L276 IsEmpty]: Start isEmpty. Operand 12286 states and 47196 transitions. [2019-12-18 21:11:45,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:11:45,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:45,259 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:45,259 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:45,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:45,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1045144998, now seen corresponding path program 1 times [2019-12-18 21:11:45,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:45,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464471029] [2019-12-18 21:11:45,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:45,343 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-18 21:11:45,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464471029] [2019-12-18 21:11:45,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:45,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:11:45,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418245964] [2019-12-18 21:11:45,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:45,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:45,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:45,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:45,346 INFO L87 Difference]: Start difference. First operand 12286 states and 47196 transitions. Second operand 3 states. [2019-12-18 21:11:45,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:45,475 INFO L93 Difference]: Finished difference Result 7367 states and 24767 transitions. [2019-12-18 21:11:45,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:45,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:11:45,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:45,507 INFO L225 Difference]: With dead ends: 7367 [2019-12-18 21:11:45,507 INFO L226 Difference]: Without dead ends: 7367 [2019-12-18 21:11:45,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:45,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7367 states. [2019-12-18 21:11:46,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7367 to 7367. [2019-12-18 21:11:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7367 states. [2019-12-18 21:11:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7367 states to 7367 states and 24767 transitions. [2019-12-18 21:11:46,532 INFO L78 Accepts]: Start accepts. Automaton has 7367 states and 24767 transitions. Word has length 13 [2019-12-18 21:11:46,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:46,532 INFO L462 AbstractCegarLoop]: Abstraction has 7367 states and 24767 transitions. [2019-12-18 21:11:46,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:46,532 INFO L276 IsEmpty]: Start isEmpty. Operand 7367 states and 24767 transitions. [2019-12-18 21:11:46,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:11:46,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:46,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:46,535 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:46,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:46,536 INFO L82 PathProgramCache]: Analyzing trace with hash -663053564, now seen corresponding path program 1 times [2019-12-18 21:11:46,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:46,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369838543] [2019-12-18 21:11:46,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:46,642 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-18 21:11:46,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369838543] [2019-12-18 21:11:46,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:46,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:11:46,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833687890] [2019-12-18 21:11:46,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:11:46,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:46,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:11:46,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:46,645 INFO L87 Difference]: Start difference. First operand 7367 states and 24767 transitions. Second operand 4 states. [2019-12-18 21:11:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:46,697 INFO L93 Difference]: Finished difference Result 1716 states and 4641 transitions. [2019-12-18 21:11:46,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:11:46,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:11:46,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:46,704 INFO L225 Difference]: With dead ends: 1716 [2019-12-18 21:11:46,704 INFO L226 Difference]: Without dead ends: 1716 [2019-12-18 21:11:46,704 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-18 21:11:46,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2019-12-18 21:11:46,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1716. [2019-12-18 21:11:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1716 states. [2019-12-18 21:11:46,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 4641 transitions. [2019-12-18 21:11:46,757 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 4641 transitions. Word has length 14 [2019-12-18 21:11:46,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:46,758 INFO L462 AbstractCegarLoop]: Abstraction has 1716 states and 4641 transitions. [2019-12-18 21:11:46,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:11:46,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 4641 transitions. [2019-12-18 21:11:46,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:11:46,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:46,759 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:46,759 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:46,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:46,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2094035962, now seen corresponding path program 1 times [2019-12-18 21:11:46,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:46,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460201728] [2019-12-18 21:11:46,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:46,804 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-18 21:11:46,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460201728] [2019-12-18 21:11:46,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:46,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:11:46,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889046612] [2019-12-18 21:11:46,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:46,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:46,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:46,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:46,806 INFO L87 Difference]: Start difference. First operand 1716 states and 4641 transitions. Second operand 3 states. [2019-12-18 21:11:46,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:46,919 INFO L93 Difference]: Finished difference Result 2529 states and 6678 transitions. [2019-12-18 21:11:46,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:46,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 21:11:46,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:46,931 INFO L225 Difference]: With dead ends: 2529 [2019-12-18 21:11:46,931 INFO L226 Difference]: Without dead ends: 2529 [2019-12-18 21:11:46,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:46,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2019-12-18 21:11:47,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 1900. [2019-12-18 21:11:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1900 states. [2019-12-18 21:11:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 5079 transitions. [2019-12-18 21:11:47,018 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 5079 transitions. Word has length 16 [2019-12-18 21:11:47,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:47,019 INFO L462 AbstractCegarLoop]: Abstraction has 1900 states and 5079 transitions. [2019-12-18 21:11:47,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:47,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 5079 transitions. [2019-12-18 21:11:47,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:11:47,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:47,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:47,021 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:47,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:47,023 INFO L82 PathProgramCache]: Analyzing trace with hash 2093901577, now seen corresponding path program 1 times [2019-12-18 21:11:47,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:47,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78136368] [2019-12-18 21:11:47,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:47,138 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-18 21:11:47,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78136368] [2019-12-18 21:11:47,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:47,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:11:47,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753534404] [2019-12-18 21:11:47,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:11:47,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:47,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:11:47,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:47,141 INFO L87 Difference]: Start difference. First operand 1900 states and 5079 transitions. Second operand 4 states. [2019-12-18 21:11:47,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:47,334 INFO L93 Difference]: Finished difference Result 2444 states and 6383 transitions. [2019-12-18 21:11:47,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:11:47,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:11:47,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:47,342 INFO L225 Difference]: With dead ends: 2444 [2019-12-18 21:11:47,342 INFO L226 Difference]: Without dead ends: 2444 [2019-12-18 21:11:47,343 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-18 21:11:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2019-12-18 21:11:47,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 2244. [2019-12-18 21:11:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2019-12-18 21:11:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 5953 transitions. [2019-12-18 21:11:47,408 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 5953 transitions. Word has length 16 [2019-12-18 21:11:47,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:47,408 INFO L462 AbstractCegarLoop]: Abstraction has 2244 states and 5953 transitions. [2019-12-18 21:11:47,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:11:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 5953 transitions. [2019-12-18 21:11:47,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:11:47,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:47,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:47,410 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:47,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:47,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2077745549, now seen corresponding path program 1 times [2019-12-18 21:11:47,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:47,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216723197] [2019-12-18 21:11:47,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:47,461 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-18 21:11:47,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216723197] [2019-12-18 21:11:47,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:47,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:11:47,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857890943] [2019-12-18 21:11:47,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:11:47,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:47,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:11:47,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:47,464 INFO L87 Difference]: Start difference. First operand 2244 states and 5953 transitions. Second operand 4 states. [2019-12-18 21:11:47,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:47,672 INFO L93 Difference]: Finished difference Result 2774 states and 7212 transitions. [2019-12-18 21:11:47,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:11:47,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:11:47,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:47,682 INFO L225 Difference]: With dead ends: 2774 [2019-12-18 21:11:47,683 INFO L226 Difference]: Without dead ends: 2774 [2019-12-18 21:11:47,683 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-18 21:11:47,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2019-12-18 21:11:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2293. [2019-12-18 21:11:47,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2019-12-18 21:11:47,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 6056 transitions. [2019-12-18 21:11:47,840 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 6056 transitions. Word has length 16 [2019-12-18 21:11:47,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:47,841 INFO L462 AbstractCegarLoop]: Abstraction has 2293 states and 6056 transitions. [2019-12-18 21:11:47,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:11:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 6056 transitions. [2019-12-18 21:11:47,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:11:47,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:47,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:47,846 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:47,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:47,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1637849064, now seen corresponding path program 1 times [2019-12-18 21:11:47,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:47,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374441896] [2019-12-18 21:11:47,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:47,909 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-18 21:11:47,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374441896] [2019-12-18 21:11:47,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:47,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:11:47,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031057266] [2019-12-18 21:11:47,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:11:47,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:47,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:11:47,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:11:47,911 INFO L87 Difference]: Start difference. First operand 2293 states and 6056 transitions. Second operand 5 states. [2019-12-18 21:11:47,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:47,962 INFO L93 Difference]: Finished difference Result 1390 states and 3752 transitions. [2019-12-18 21:11:47,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:11:47,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 21:11:47,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:47,967 INFO L225 Difference]: With dead ends: 1390 [2019-12-18 21:11:47,967 INFO L226 Difference]: Without dead ends: 1390 [2019-12-18 21:11:47,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:11:47,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-12-18 21:11:47,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1306. [2019-12-18 21:11:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1306 states. [2019-12-18 21:11:48,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 3544 transitions. [2019-12-18 21:11:48,009 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 3544 transitions. Word has length 29 [2019-12-18 21:11:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:48,010 INFO L462 AbstractCegarLoop]: Abstraction has 1306 states and 3544 transitions. [2019-12-18 21:11:48,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:11:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 3544 transitions. [2019-12-18 21:11:48,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:11:48,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:48,017 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] [2019-12-18 21:11:48,018 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:48,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:48,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1456634485, now seen corresponding path program 1 times [2019-12-18 21:11:48,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:48,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137367374] [2019-12-18 21:11:48,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:48,174 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-18 21:11:48,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137367374] [2019-12-18 21:11:48,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:48,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:11:48,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794308476] [2019-12-18 21:11:48,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:11:48,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:48,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:11:48,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:48,177 INFO L87 Difference]: Start difference. First operand 1306 states and 3544 transitions. Second operand 4 states. [2019-12-18 21:11:48,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:48,227 INFO L93 Difference]: Finished difference Result 1953 states and 4984 transitions. [2019-12-18 21:11:48,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:11:48,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-18 21:11:48,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:48,230 INFO L225 Difference]: With dead ends: 1953 [2019-12-18 21:11:48,230 INFO L226 Difference]: Without dead ends: 685 [2019-12-18 21:11:48,231 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-18 21:11:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-12-18 21:11:48,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2019-12-18 21:11:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-12-18 21:11:48,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1511 transitions. [2019-12-18 21:11:48,254 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1511 transitions. Word has length 44 [2019-12-18 21:11:48,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:48,255 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 1511 transitions. [2019-12-18 21:11:48,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:11:48,255 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1511 transitions. [2019-12-18 21:11:48,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:11:48,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:48,257 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] [2019-12-18 21:11:48,258 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:48,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:48,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1242411397, now seen corresponding path program 2 times [2019-12-18 21:11:48,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:48,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823477937] [2019-12-18 21:11:48,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:48,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:11:48,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823477937] [2019-12-18 21:11:48,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:48,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:11:48,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628709852] [2019-12-18 21:11:48,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:11:48,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:48,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:11:48,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:48,328 INFO L87 Difference]: Start difference. First operand 685 states and 1511 transitions. Second operand 4 states. [2019-12-18 21:11:48,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:48,351 INFO L93 Difference]: Finished difference Result 1083 states and 2418 transitions. [2019-12-18 21:11:48,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:11:48,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-18 21:11:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:48,353 INFO L225 Difference]: With dead ends: 1083 [2019-12-18 21:11:48,354 INFO L226 Difference]: Without dead ends: 419 [2019-12-18 21:11:48,354 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-18 21:11:48,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-12-18 21:11:48,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2019-12-18 21:11:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-12-18 21:11:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 940 transitions. [2019-12-18 21:11:48,369 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 940 transitions. Word has length 44 [2019-12-18 21:11:48,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:48,369 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 940 transitions. [2019-12-18 21:11:48,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:11:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 940 transitions. [2019-12-18 21:11:48,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:11:48,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:48,372 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] [2019-12-18 21:11:48,372 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:48,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:48,372 INFO L82 PathProgramCache]: Analyzing trace with hash -89699875, now seen corresponding path program 3 times [2019-12-18 21:11:48,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:48,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31303962] [2019-12-18 21:11:48,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:48,531 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-18 21:11:48,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31303962] [2019-12-18 21:11:48,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:48,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:11:48,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539206492] [2019-12-18 21:11:48,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:11:48,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:48,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:11:48,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:11:48,533 INFO L87 Difference]: Start difference. First operand 419 states and 940 transitions. Second operand 7 states. [2019-12-18 21:11:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:48,943 INFO L93 Difference]: Finished difference Result 671 states and 1369 transitions. [2019-12-18 21:11:48,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:11:48,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-18 21:11:48,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:48,945 INFO L225 Difference]: With dead ends: 671 [2019-12-18 21:11:48,946 INFO L226 Difference]: Without dead ends: 671 [2019-12-18 21:11:48,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:11:48,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-12-18 21:11:48,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 538. [2019-12-18 21:11:48,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-12-18 21:11:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1131 transitions. [2019-12-18 21:11:48,961 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1131 transitions. Word has length 44 [2019-12-18 21:11:48,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:48,961 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 1131 transitions. [2019-12-18 21:11:48,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:11:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1131 transitions. [2019-12-18 21:11:48,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:11:48,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:48,966 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] [2019-12-18 21:11:48,967 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:48,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:48,967 INFO L82 PathProgramCache]: Analyzing trace with hash -887680537, now seen corresponding path program 4 times [2019-12-18 21:11:48,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:48,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000008856] [2019-12-18 21:11:48,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:49,095 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-18 21:11:49,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000008856] [2019-12-18 21:11:49,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:49,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:11:49,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709312595] [2019-12-18 21:11:49,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:11:49,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:49,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:11:49,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:11:49,098 INFO L87 Difference]: Start difference. First operand 538 states and 1131 transitions. Second operand 6 states. [2019-12-18 21:11:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:49,244 INFO L93 Difference]: Finished difference Result 1024 states and 2130 transitions. [2019-12-18 21:11:49,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:11:49,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-12-18 21:11:49,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:49,246 INFO L225 Difference]: With dead ends: 1024 [2019-12-18 21:11:49,248 INFO L226 Difference]: Without dead ends: 646 [2019-12-18 21:11:49,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:11:49,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-12-18 21:11:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 564. [2019-12-18 21:11:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-12-18 21:11:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1163 transitions. [2019-12-18 21:11:49,262 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1163 transitions. Word has length 44 [2019-12-18 21:11:49,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:49,263 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 1163 transitions. [2019-12-18 21:11:49,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:11:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1163 transitions. [2019-12-18 21:11:49,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:11:49,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:49,265 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] [2019-12-18 21:11:49,265 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:49,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:49,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1957803006, now seen corresponding path program 1 times [2019-12-18 21:11:49,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:49,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179040364] [2019-12-18 21:11:49,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:49,342 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-18 21:11:49,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179040364] [2019-12-18 21:11:49,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:49,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:11:49,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280581446] [2019-12-18 21:11:49,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:49,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:49,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:49,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:49,344 INFO L87 Difference]: Start difference. First operand 564 states and 1163 transitions. Second operand 3 states. [2019-12-18 21:11:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:49,380 INFO L93 Difference]: Finished difference Result 666 states and 1298 transitions. [2019-12-18 21:11:49,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:49,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 21:11:49,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:49,382 INFO L225 Difference]: With dead ends: 666 [2019-12-18 21:11:49,382 INFO L226 Difference]: Without dead ends: 666 [2019-12-18 21:11:49,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-12-18 21:11:49,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 567. [2019-12-18 21:11:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-12-18 21:11:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1121 transitions. [2019-12-18 21:11:49,394 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1121 transitions. Word has length 44 [2019-12-18 21:11:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:49,395 INFO L462 AbstractCegarLoop]: Abstraction has 567 states and 1121 transitions. [2019-12-18 21:11:49,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1121 transitions. [2019-12-18 21:11:49,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:11:49,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:49,397 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] [2019-12-18 21:11:49,397 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:49,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:49,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1530022087, now seen corresponding path program 5 times [2019-12-18 21:11:49,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:49,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378100969] [2019-12-18 21:11:49,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:49,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:11:49,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378100969] [2019-12-18 21:11:49,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:49,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:11:49,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089409832] [2019-12-18 21:11:49,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 21:11:49,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:49,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 21:11:49,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:11:49,493 INFO L87 Difference]: Start difference. First operand 567 states and 1121 transitions. Second operand 8 states. [2019-12-18 21:11:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:49,921 INFO L93 Difference]: Finished difference Result 936 states and 1799 transitions. [2019-12-18 21:11:49,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:11:49,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-12-18 21:11:49,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:49,924 INFO L225 Difference]: With dead ends: 936 [2019-12-18 21:11:49,925 INFO L226 Difference]: Without dead ends: 760 [2019-12-18 21:11:49,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:11:49,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-12-18 21:11:49,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 567. [2019-12-18 21:11:49,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-12-18 21:11:49,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1121 transitions. [2019-12-18 21:11:49,939 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1121 transitions. Word has length 44 [2019-12-18 21:11:49,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:49,939 INFO L462 AbstractCegarLoop]: Abstraction has 567 states and 1121 transitions. [2019-12-18 21:11:49,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 21:11:49,939 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1121 transitions. [2019-12-18 21:11:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:11:49,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:49,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:49,941 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:49,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:49,942 INFO L82 PathProgramCache]: Analyzing trace with hash -800324087, now seen corresponding path program 6 times [2019-12-18 21:11:49,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:49,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790289161] [2019-12-18 21:11:49,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:50,070 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-18 21:11:50,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790289161] [2019-12-18 21:11:50,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:50,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:11:50,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983490516] [2019-12-18 21:11:50,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:11:50,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:50,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:11:50,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:11:50,073 INFO L87 Difference]: Start difference. First operand 567 states and 1121 transitions. Second operand 9 states. [2019-12-18 21:11:50,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:50,674 INFO L93 Difference]: Finished difference Result 1122 states and 2172 transitions. [2019-12-18 21:11:50,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:11:50,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-12-18 21:11:50,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:50,679 INFO L225 Difference]: With dead ends: 1122 [2019-12-18 21:11:50,679 INFO L226 Difference]: Without dead ends: 946 [2019-12-18 21:11:50,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:11:50,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2019-12-18 21:11:50,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 559. [2019-12-18 21:11:50,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-12-18 21:11:50,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1105 transitions. [2019-12-18 21:11:50,694 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1105 transitions. Word has length 44 [2019-12-18 21:11:50,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:50,695 INFO L462 AbstractCegarLoop]: Abstraction has 559 states and 1105 transitions. [2019-12-18 21:11:50,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:11:50,695 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1105 transitions. [2019-12-18 21:11:50,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:11:50,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:50,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:50,697 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:50,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:50,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1924123265, now seen corresponding path program 7 times [2019-12-18 21:11:50,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:50,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549783880] [2019-12-18 21:11:50,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:50,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-18 21:11:50,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549783880] [2019-12-18 21:11:50,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:50,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:11:50,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875358198] [2019-12-18 21:11:50,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:11:50,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:50,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:11:50,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:11:50,831 INFO L87 Difference]: Start difference. First operand 559 states and 1105 transitions. Second operand 9 states. [2019-12-18 21:11:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:51,636 INFO L93 Difference]: Finished difference Result 1241 states and 2425 transitions. [2019-12-18 21:11:51,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 21:11:51,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-12-18 21:11:51,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:51,640 INFO L225 Difference]: With dead ends: 1241 [2019-12-18 21:11:51,641 INFO L226 Difference]: Without dead ends: 1065 [2019-12-18 21:11:51,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:11:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2019-12-18 21:11:51,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 559. [2019-12-18 21:11:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-12-18 21:11:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1105 transitions. [2019-12-18 21:11:51,654 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1105 transitions. Word has length 44 [2019-12-18 21:11:51,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:51,654 INFO L462 AbstractCegarLoop]: Abstraction has 559 states and 1105 transitions. [2019-12-18 21:11:51,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:11:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1105 transitions. [2019-12-18 21:11:51,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:11:51,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:51,656 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] [2019-12-18 21:11:51,657 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:51,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:51,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1809873729, now seen corresponding path program 8 times [2019-12-18 21:11:51,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:51,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511088552] [2019-12-18 21:11:51,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:51,752 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-18 21:11:51,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511088552] [2019-12-18 21:11:51,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:51,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:11:51,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637904149] [2019-12-18 21:11:51,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:11:51,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:51,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:11:51,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:11:51,755 INFO L87 Difference]: Start difference. First operand 559 states and 1105 transitions. Second operand 6 states. [2019-12-18 21:11:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:52,167 INFO L93 Difference]: Finished difference Result 798 states and 1558 transitions. [2019-12-18 21:11:52,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:11:52,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-12-18 21:11:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:52,171 INFO L225 Difference]: With dead ends: 798 [2019-12-18 21:11:52,171 INFO L226 Difference]: Without dead ends: 798 [2019-12-18 21:11:52,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:11:52,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-12-18 21:11:52,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 582. [2019-12-18 21:11:52,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-12-18 21:11:52,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1156 transitions. [2019-12-18 21:11:52,183 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1156 transitions. Word has length 44 [2019-12-18 21:11:52,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:52,184 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 1156 transitions. [2019-12-18 21:11:52,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:11:52,184 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1156 transitions. [2019-12-18 21:11:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:11:52,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:52,186 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] [2019-12-18 21:11:52,186 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:52,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:52,187 INFO L82 PathProgramCache]: Analyzing trace with hash 2067823167, now seen corresponding path program 9 times [2019-12-18 21:11:52,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:52,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976496504] [2019-12-18 21:11:52,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:52,247 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-18 21:11:52,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976496504] [2019-12-18 21:11:52,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:52,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:11:52,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701351685] [2019-12-18 21:11:52,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:52,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:52,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:52,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:52,250 INFO L87 Difference]: Start difference. First operand 582 states and 1156 transitions. Second operand 3 states. [2019-12-18 21:11:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:52,261 INFO L93 Difference]: Finished difference Result 580 states and 1151 transitions. [2019-12-18 21:11:52,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:52,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 21:11:52,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:52,263 INFO L225 Difference]: With dead ends: 580 [2019-12-18 21:11:52,264 INFO L226 Difference]: Without dead ends: 580 [2019-12-18 21:11:52,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-12-18 21:11:52,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 493. [2019-12-18 21:11:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-12-18 21:11:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 988 transitions. [2019-12-18 21:11:52,274 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 988 transitions. Word has length 44 [2019-12-18 21:11:52,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:52,274 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 988 transitions. [2019-12-18 21:11:52,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 988 transitions. [2019-12-18 21:11:52,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 21:11:52,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:52,276 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] [2019-12-18 21:11:52,276 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:52,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:52,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1176863449, now seen corresponding path program 1 times [2019-12-18 21:11:52,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:52,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207190746] [2019-12-18 21:11:52,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:11:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:11:52,385 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:11:52,386 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:11:52,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~x~0_11 0) (= 0 v_~y$r_buff1_thd2~0_41) (= v_~y~0_23 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~y$r_buff0_thd1~0_11 0) (= 0 v_~y$w_buff1~0_23) (= 0 v_~__unbuffered_p0_EAX~0_15) (= v_~y$read_delayed~0_7 0) (= v_~z~0_10 0) (= 0 v_~__unbuffered_cnt~0_21) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t922~0.base_25| 4)) (= (select .cse0 |v_ULTIMATE.start_main_~#t922~0.base_25|) 0) (= 0 v_~y$flush_delayed~0_14) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_32) (= (store .cse0 |v_ULTIMATE.start_main_~#t922~0.base_25| 1) |v_#valid_62|) (= v_~y$r_buff0_thd2~0_70 0) (= v_~a~0_14 0) (= 0 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_28 0) (= 0 v_~y$r_buff1_thd0~0_24) (= v_~y$w_buff1_used~0_57 0) (= v_~y$r_buff0_thd0~0_22 0) (= v_~y$mem_tmp~0_11 0) (= v_~__unbuffered_p2_EBX~0_18 0) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice0~0_7) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t922~0.base_25|) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t922~0.base_25| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t922~0.base_25|) |v_ULTIMATE.start_main_~#t922~0.offset_18| 0)) |v_#memory_int_19|) (= 0 v_~y$w_buff0_used~0_94) (= 0 v_~y$w_buff0~0_25) (= |v_#NULL.offset_4| 0) (= 0 |v_ULTIMATE.start_main_~#t922~0.offset_18|) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~y$r_buff1_thd3~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_20|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, #NULL.offset=|v_#NULL.offset_4|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_14, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_18, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_11|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|, ~y$w_buff1~0=v_~y$w_buff1~0_23, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_70, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_11, ULTIMATE.start_main_~#t924~0.base=|v_ULTIMATE.start_main_~#t924~0.base_22|, ~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_94, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ULTIMATE.start_main_~#t922~0.offset=|v_ULTIMATE.start_main_~#t922~0.offset_18|, ~y~0=v_~y~0_23, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_~#t923~0.offset=|v_ULTIMATE.start_main_~#t923~0.offset_19|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ULTIMATE.start_main_~#t923~0.base=|v_ULTIMATE.start_main_~#t923~0.base_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t924~0.offset=|v_ULTIMATE.start_main_~#t924~0.offset_16|, ULTIMATE.start_main_~#t922~0.base=|v_ULTIMATE.start_main_~#t922~0.base_25|, ~z~0=v_~z~0_10, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, #NULL.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t924~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t922~0.offset, ~y~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t923~0.offset, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t923~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t924~0.offset, ULTIMATE.start_main_~#t922~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:11:52,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L822-1-->L824: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t923~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t923~0.base_13|) |v_ULTIMATE.start_main_~#t923~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t923~0.base_13| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t923~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t923~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t923~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t923~0.offset_11|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t923~0.base_13| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t923~0.offset=|v_ULTIMATE.start_main_~#t923~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t923~0.base=|v_ULTIMATE.start_main_~#t923~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t923~0.offset, #length, ULTIMATE.start_main_~#t923~0.base] because there is no mapped edge [2019-12-18 21:11:52,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L824-1-->L826: Formula: (and (not (= |v_ULTIMATE.start_main_~#t924~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t924~0.offset_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t924~0.base_12| 4) |v_#length_15|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t924~0.base_12| 1) |v_#valid_34|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t924~0.base_12|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t924~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t924~0.base_12|) |v_ULTIMATE.start_main_~#t924~0.offset_10| 2))) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t924~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t924~0.base=|v_ULTIMATE.start_main_~#t924~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t924~0.offset=|v_ULTIMATE.start_main_~#t924~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t924~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t924~0.offset, #length] because there is no mapped edge [2019-12-18 21:11:52,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [606] [606] L4-->L799: Formula: (and (= v_~y$r_buff0_thd0~0_14 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff0_thd3~0_16 v_~y$r_buff1_thd3~0_10) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6)) (= v_~y$r_buff0_thd2~0_35 v_~y$r_buff1_thd2~0_21) (= v_~__unbuffered_p2_EBX~0_4 v_~a~0_4) (= 1 v_~z~0_3) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_3) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_3) (= v_~y$r_buff0_thd3~0_15 1)) InVars {~a~0=v_~a~0_4, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_16, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_14, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_35, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ~a~0=v_~a~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_10, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_14, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_35, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_3, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 21:11:52,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 1 v_~a~0_9) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~x~0_6) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_6} OutVars{~a~0=v_~a~0_9, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_6, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:11:52,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L758-->L758-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In973373325 256) 0))) (or (and (= ~y$w_buff0~0_In973373325 |P1Thread1of1ForFork1_#t~ite8_Out973373325|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In973373325 256) 0))) (or (= (mod ~y$w_buff0_used~0_In973373325 256) 0) (and (= (mod ~y$w_buff1_used~0_In973373325 256) 0) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In973373325 256) 0) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out973373325| |P1Thread1of1ForFork1_#t~ite8_Out973373325|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite8_In973373325| |P1Thread1of1ForFork1_#t~ite8_Out973373325|) (= ~y$w_buff0~0_In973373325 |P1Thread1of1ForFork1_#t~ite9_Out973373325|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In973373325, ~y$w_buff0_used~0=~y$w_buff0_used~0_In973373325, ~y$w_buff0~0=~y$w_buff0~0_In973373325, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In973373325, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In973373325|, ~weak$$choice2~0=~weak$$choice2~0_In973373325, ~y$w_buff1_used~0=~y$w_buff1_used~0_In973373325} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In973373325, ~y$w_buff0_used~0=~y$w_buff0_used~0_In973373325, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out973373325|, ~y$w_buff0~0=~y$w_buff0~0_In973373325, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In973373325, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out973373325|, ~weak$$choice2~0=~weak$$choice2~0_In973373325, ~y$w_buff1_used~0=~y$w_buff1_used~0_In973373325} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 21:11:52,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_49 v_~y$r_buff0_thd2~0_48)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_10|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_12|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_48, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 21:11:52,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1030254915 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_In1030254915| |P1Thread1of1ForFork1_#t~ite23_Out1030254915|) (not .cse0) (= ~y$r_buff1_thd2~0_In1030254915 |P1Thread1of1ForFork1_#t~ite24_Out1030254915|)) (and .cse0 (= ~y$r_buff1_thd2~0_In1030254915 |P1Thread1of1ForFork1_#t~ite23_Out1030254915|) (= |P1Thread1of1ForFork1_#t~ite23_Out1030254915| |P1Thread1of1ForFork1_#t~ite24_Out1030254915|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1030254915 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1030254915 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1030254915 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1030254915 256)))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1030254915, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1030254915, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1030254915, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1030254915|, ~weak$$choice2~0=~weak$$choice2~0_In1030254915, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1030254915} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1030254915, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1030254915, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1030254915, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1030254915|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1030254915|, ~weak$$choice2~0=~weak$$choice2~0_In1030254915, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1030254915} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-18 21:11:52,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [615] [615] L765-->L773: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_12 v_~y$mem_tmp~0_4) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~y~0=v_~y~0_12, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 21:11:52,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-722996388 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-722996388 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite28_Out-722996388| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-722996388 |P2Thread1of1ForFork2_#t~ite28_Out-722996388|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-722996388, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-722996388} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-722996388, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-722996388, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-722996388|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 21:11:52,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In-938107039 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-938107039 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-938107039 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-938107039 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out-938107039| ~y$w_buff1_used~0_In-938107039) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-938107039|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-938107039, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-938107039, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-938107039, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-938107039} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-938107039, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-938107039, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-938107039, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-938107039|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-938107039} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 21:11:52,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L802-->L803: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In903579670 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In903579670 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In903579670 ~y$r_buff0_thd3~0_Out903579670)) (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out903579670)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In903579670, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In903579670} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In903579670, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out903579670|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out903579670} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 21:11:52,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L803-->L803-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1704229047 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-1704229047 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1704229047 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1704229047 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-1704229047 |P2Thread1of1ForFork2_#t~ite31_Out-1704229047|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-1704229047|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1704229047, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1704229047, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1704229047, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1704229047} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1704229047, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1704229047, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-1704229047|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1704229047, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1704229047} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 21:11:52,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_8| v_~y$r_buff1_thd3~0_15) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 21:11:52,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L826-1-->L832: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:11:52,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L832-2-->L832-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1498340906 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1498340906 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out-1498340906| ~y~0_In-1498340906) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out-1498340906| ~y$w_buff1~0_In-1498340906) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1498340906, ~y~0=~y~0_In-1498340906, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1498340906, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1498340906} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1498340906, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1498340906|, ~y~0=~y~0_In-1498340906, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1498340906, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1498340906} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-18 21:11:52,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L832-4-->L833: Formula: (= v_~y~0_16 |v_ULTIMATE.start_main_#t~ite35_8|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_8|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-18 21:11:52,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-995246792 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-995246792 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-995246792|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-995246792 |ULTIMATE.start_main_#t~ite37_Out-995246792|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-995246792, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-995246792} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-995246792, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-995246792, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-995246792|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 21:11:52,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In230009866 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In230009866 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In230009866 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In230009866 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In230009866 |ULTIMATE.start_main_#t~ite38_Out230009866|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite38_Out230009866|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In230009866, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In230009866, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In230009866, ~y$w_buff1_used~0=~y$w_buff1_used~0_In230009866} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In230009866, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In230009866, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out230009866|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In230009866, ~y$w_buff1_used~0=~y$w_buff1_used~0_In230009866} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:11:52,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1187972423 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1187972423 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1187972423| ~y$r_buff0_thd0~0_In-1187972423) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1187972423| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1187972423, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1187972423} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1187972423, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1187972423|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1187972423} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:11:52,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L836-->L836-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In1335145100 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1335145100 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1335145100 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1335145100 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1335145100| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite40_Out1335145100| ~y$r_buff1_thd0~0_In1335145100) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1335145100, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1335145100, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1335145100, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1335145100} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1335145100|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1335145100, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1335145100, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1335145100, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1335145100} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:11:52,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_8 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_11) (= 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_ULTIMATE.start_main_#t~ite40_13| v_~y$r_buff1_thd0~0_16) (= 1 v_~__unbuffered_p2_EAX~0_11)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:11:52,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:11:52 BasicIcfg [2019-12-18 21:11:52,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:11:52,537 INFO L168 Benchmark]: Toolchain (without parser) took 15647.31 ms. Allocated memory was 138.9 MB in the beginning and 597.7 MB in the end (delta: 458.8 MB). Free memory was 102.3 MB in the beginning and 305.8 MB in the end (delta: -203.5 MB). Peak memory consumption was 255.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:52,538 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 21:11:52,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 853.72 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 157.6 MB in the end (delta: -55.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:52,539 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.80 ms. Allocated memory is still 203.4 MB. Free memory was 157.6 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:52,539 INFO L168 Benchmark]: Boogie Preprocessor took 72.97 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 153.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:52,543 INFO L168 Benchmark]: RCFGBuilder took 805.91 ms. Allocated memory is still 203.4 MB. Free memory was 153.0 MB in the beginning and 109.2 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:52,544 INFO L168 Benchmark]: TraceAbstraction took 13811.18 ms. Allocated memory was 203.4 MB in the beginning and 597.7 MB in the end (delta: 394.3 MB). Free memory was 108.6 MB in the beginning and 305.8 MB in the end (delta: -197.3 MB). Peak memory consumption was 197.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:52,553 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.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 853.72 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 157.6 MB in the end (delta: -55.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 96.80 ms. Allocated memory is still 203.4 MB. Free memory was 157.6 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.97 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 153.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 805.91 ms. Allocated memory is still 203.4 MB. Free memory was 153.0 MB in the beginning and 109.2 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13811.18 ms. Allocated memory was 203.4 MB in the beginning and 597.7 MB in the end (delta: 394.3 MB). Free memory was 108.6 MB in the beginning and 305.8 MB in the end (delta: -197.3 MB). Peak memory consumption was 197.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 154 ProgramPointsBefore, 73 ProgramPointsAfterwards, 179 TransitionsBefore, 82 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 20 ChoiceCompositions, 4645 VarBasedMoverChecksPositive, 134 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 47747 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 1 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L750] 2 x = 1 [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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [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, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [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) [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [!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)=1, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? 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))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? 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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [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] EXPR 2 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? 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))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? 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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L832] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 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 [L835] 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 4 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1946 SDtfs, 2535 SDslu, 3815 SDs, 0 SdLazy, 2043 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13626occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 3097 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 596 NumberOfCodeBlocks, 596 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 534 ConstructedInterpolants, 0 QuantifiedInterpolants, 62607 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...