/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:56:06,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:56:06,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:56:06,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:56:06,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:56:06,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:56:06,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:56:06,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:56:06,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:56:06,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:56:06,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:56:06,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:56:06,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:56:06,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:56:06,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:56:06,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:56:06,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:56:06,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:56:06,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:56:06,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:56:06,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:56:06,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:56:06,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:56:06,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:56:06,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:56:06,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:56:06,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:56:06,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:56:06,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:56:06,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:56:06,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:56:06,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:56:06,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:56:06,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:56:06,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:56:06,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:56:06,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:56:06,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:56:06,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:56:06,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:56:06,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:56:06,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:56:06,649 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:56:06,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:56:06,650 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:56:06,651 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:56:06,651 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:56:06,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:56:06,651 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:56:06,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:56:06,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:56:06,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:56:06,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:56:06,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:56:06,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:56:06,656 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:56:06,656 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:56:06,657 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:56:06,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:56:06,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:56:06,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:56:06,657 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:56:06,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:56:06,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:56:06,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:56:06,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:56:06,658 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:56:06,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:56:06,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:56:06,659 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:56:06,659 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:56:06,659 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:56:06,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:56:06,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:56:06,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:56:06,962 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:56:06,962 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:56:06,964 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.oepc.i [2019-12-18 13:56:07,042 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d60819eb9/a52962037aa14226bd201724607d6906/FLAG0ebe57fa8 [2019-12-18 13:56:07,614 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:56:07,615 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.oepc.i [2019-12-18 13:56:07,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d60819eb9/a52962037aa14226bd201724607d6906/FLAG0ebe57fa8 [2019-12-18 13:56:07,921 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d60819eb9/a52962037aa14226bd201724607d6906 [2019-12-18 13:56:07,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:56:07,932 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:56:07,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:56:07,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:56:07,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:56:07,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:56:07" (1/1) ... [2019-12-18 13:56:07,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49494e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:07, skipping insertion in model container [2019-12-18 13:56:07,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:56:07" (1/1) ... [2019-12-18 13:56:07,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:56:07,992 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:56:08,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:56:08,540 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:56:08,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:56:08,694 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:56:08,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:08 WrapperNode [2019-12-18 13:56:08,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:56:08,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:56:08,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:56:08,695 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:56:08,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:08" (1/1) ... [2019-12-18 13:56:08,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:08" (1/1) ... [2019-12-18 13:56:08,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:56:08,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:56:08,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:56:08,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:56:08,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:08" (1/1) ... [2019-12-18 13:56:08,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:08" (1/1) ... [2019-12-18 13:56:08,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:08" (1/1) ... [2019-12-18 13:56:08,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:08" (1/1) ... [2019-12-18 13:56:08,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:08" (1/1) ... [2019-12-18 13:56:08,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:08" (1/1) ... [2019-12-18 13:56:08,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:08" (1/1) ... [2019-12-18 13:56:08,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:56:08,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:56:08,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:56:08,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:56:08,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:08" (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 13:56:08,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:56:08,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:56:08,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:56:08,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:56:08,878 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:56:08,878 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:56:08,878 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:56:08,878 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:56:08,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:56:08,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:56:08,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:56:08,881 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 13:56:09,631 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:56:09,631 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:56:09,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:56:09 BoogieIcfgContainer [2019-12-18 13:56:09,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:56:09,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:56:09,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:56:09,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:56:09,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:56:07" (1/3) ... [2019-12-18 13:56:09,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9a077d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:56:09, skipping insertion in model container [2019-12-18 13:56:09,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:08" (2/3) ... [2019-12-18 13:56:09,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9a077d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:56:09, skipping insertion in model container [2019-12-18 13:56:09,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:56:09" (3/3) ... [2019-12-18 13:56:09,648 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_pso.oepc.i [2019-12-18 13:56:09,657 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:56:09,657 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:56:09,664 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:56:09,665 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:56:09,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,703 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,703 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,703 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,704 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,704 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,713 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,714 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,747 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,763 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,764 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,772 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,775 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:09,793 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 13:56:09,816 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:56:09,816 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:56:09,817 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:56:09,817 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:56:09,817 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:56:09,817 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:56:09,817 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:56:09,817 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:56:09,839 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-18 13:56:09,842 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 13:56:09,937 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 13:56:09,937 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:56:09,952 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:56:09,973 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 13:56:10,011 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 13:56:10,011 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:56:10,017 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:56:10,032 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 13:56:10,033 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:56:14,873 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-18 13:56:14,995 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-18 13:56:15,338 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74785 [2019-12-18 13:56:15,338 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 13:56:15,342 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-12-18 13:56:15,819 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8582 states. [2019-12-18 13:56:15,821 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states. [2019-12-18 13:56:15,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:56:15,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:15,829 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:56:15,829 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:15,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:15,836 INFO L82 PathProgramCache]: Analyzing trace with hash 791214, now seen corresponding path program 1 times [2019-12-18 13:56:15,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:15,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948900506] [2019-12-18 13:56:15,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:16,039 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 13:56:16,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948900506] [2019-12-18 13:56:16,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:16,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:56:16,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934141352] [2019-12-18 13:56:16,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:16,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:16,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:16,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:16,067 INFO L87 Difference]: Start difference. First operand 8582 states. Second operand 3 states. [2019-12-18 13:56:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:16,377 INFO L93 Difference]: Finished difference Result 8460 states and 27514 transitions. [2019-12-18 13:56:16,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:16,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:56:16,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:16,457 INFO L225 Difference]: With dead ends: 8460 [2019-12-18 13:56:16,457 INFO L226 Difference]: Without dead ends: 7472 [2019-12-18 13:56:16,459 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 13:56:16,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states. [2019-12-18 13:56:16,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 7472. [2019-12-18 13:56:16,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7472 states. [2019-12-18 13:56:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 24214 transitions. [2019-12-18 13:56:16,833 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 24214 transitions. Word has length 3 [2019-12-18 13:56:16,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:16,834 INFO L462 AbstractCegarLoop]: Abstraction has 7472 states and 24214 transitions. [2019-12-18 13:56:16,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:16,834 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 24214 transitions. [2019-12-18 13:56:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:56:16,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:16,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:16,838 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:16,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:16,838 INFO L82 PathProgramCache]: Analyzing trace with hash 743461303, now seen corresponding path program 1 times [2019-12-18 13:56:16,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:16,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505687573] [2019-12-18 13:56:16,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:16,963 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 13:56:16,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505687573] [2019-12-18 13:56:16,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:16,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:56:16,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048793752] [2019-12-18 13:56:16,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:56:16,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:16,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:56:16,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:56:16,968 INFO L87 Difference]: Start difference. First operand 7472 states and 24214 transitions. Second operand 4 states. [2019-12-18 13:56:17,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:17,287 INFO L93 Difference]: Finished difference Result 11704 states and 36249 transitions. [2019-12-18 13:56:17,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:56:17,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:56:17,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:17,378 INFO L225 Difference]: With dead ends: 11704 [2019-12-18 13:56:17,378 INFO L226 Difference]: Without dead ends: 11690 [2019-12-18 13:56:17,379 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 13:56:17,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11690 states. [2019-12-18 13:56:17,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11690 to 10458. [2019-12-18 13:56:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10458 states. [2019-12-18 13:56:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10458 states to 10458 states and 32991 transitions. [2019-12-18 13:56:17,830 INFO L78 Accepts]: Start accepts. Automaton has 10458 states and 32991 transitions. Word has length 11 [2019-12-18 13:56:17,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:17,831 INFO L462 AbstractCegarLoop]: Abstraction has 10458 states and 32991 transitions. [2019-12-18 13:56:17,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:56:17,831 INFO L276 IsEmpty]: Start isEmpty. Operand 10458 states and 32991 transitions. [2019-12-18 13:56:17,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:56:17,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:17,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:17,837 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:17,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:17,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1209900993, now seen corresponding path program 1 times [2019-12-18 13:56:17,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:17,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450180850] [2019-12-18 13:56:17,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:17,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450180850] [2019-12-18 13:56:17,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:17,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:56:17,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024450495] [2019-12-18 13:56:17,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:56:17,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:17,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:56:17,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:56:17,967 INFO L87 Difference]: Start difference. First operand 10458 states and 32991 transitions. Second operand 5 states. [2019-12-18 13:56:18,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:18,374 INFO L93 Difference]: Finished difference Result 15000 states and 46671 transitions. [2019-12-18 13:56:18,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:56:18,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 13:56:18,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:18,425 INFO L225 Difference]: With dead ends: 15000 [2019-12-18 13:56:18,425 INFO L226 Difference]: Without dead ends: 15000 [2019-12-18 13:56:18,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:56:18,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15000 states. [2019-12-18 13:56:19,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15000 to 11886. [2019-12-18 13:56:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11886 states. [2019-12-18 13:56:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11886 states to 11886 states and 37489 transitions. [2019-12-18 13:56:19,496 INFO L78 Accepts]: Start accepts. Automaton has 11886 states and 37489 transitions. Word has length 14 [2019-12-18 13:56:19,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:19,497 INFO L462 AbstractCegarLoop]: Abstraction has 11886 states and 37489 transitions. [2019-12-18 13:56:19,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:56:19,497 INFO L276 IsEmpty]: Start isEmpty. Operand 11886 states and 37489 transitions. [2019-12-18 13:56:19,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:56:19,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:19,501 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:19,502 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:19,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:19,502 INFO L82 PathProgramCache]: Analyzing trace with hash 529414606, now seen corresponding path program 1 times [2019-12-18 13:56:19,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:19,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379963544] [2019-12-18 13:56:19,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:19,590 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 13:56:19,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379963544] [2019-12-18 13:56:19,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:19,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:56:19,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277869426] [2019-12-18 13:56:19,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:19,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:19,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:19,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:19,595 INFO L87 Difference]: Start difference. First operand 11886 states and 37489 transitions. Second operand 3 states. [2019-12-18 13:56:19,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:19,652 INFO L93 Difference]: Finished difference Result 11883 states and 37480 transitions. [2019-12-18 13:56:19,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:19,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 13:56:19,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:19,684 INFO L225 Difference]: With dead ends: 11883 [2019-12-18 13:56:19,685 INFO L226 Difference]: Without dead ends: 11883 [2019-12-18 13:56:19,685 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 13:56:19,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11883 states. [2019-12-18 13:56:20,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11883 to 11883. [2019-12-18 13:56:20,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11883 states. [2019-12-18 13:56:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 37480 transitions. [2019-12-18 13:56:20,104 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 37480 transitions. Word has length 16 [2019-12-18 13:56:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:20,105 INFO L462 AbstractCegarLoop]: Abstraction has 11883 states and 37480 transitions. [2019-12-18 13:56:20,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:20,105 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 37480 transitions. [2019-12-18 13:56:20,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 13:56:20,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:20,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:20,110 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:20,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:20,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1491434984, now seen corresponding path program 1 times [2019-12-18 13:56:20,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:20,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470592031] [2019-12-18 13:56:20,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:20,157 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 13:56:20,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470592031] [2019-12-18 13:56:20,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:20,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:56:20,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337743338] [2019-12-18 13:56:20,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:20,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:20,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:20,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:20,160 INFO L87 Difference]: Start difference. First operand 11883 states and 37480 transitions. Second operand 3 states. [2019-12-18 13:56:20,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:20,227 INFO L93 Difference]: Finished difference Result 19949 states and 62561 transitions. [2019-12-18 13:56:20,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:20,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 13:56:20,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:20,249 INFO L225 Difference]: With dead ends: 19949 [2019-12-18 13:56:20,249 INFO L226 Difference]: Without dead ends: 11074 [2019-12-18 13:56:20,250 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 13:56:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11074 states. [2019-12-18 13:56:20,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11074 to 10421. [2019-12-18 13:56:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10421 states. [2019-12-18 13:56:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10421 states to 10421 states and 32037 transitions. [2019-12-18 13:56:20,573 INFO L78 Accepts]: Start accepts. Automaton has 10421 states and 32037 transitions. Word has length 17 [2019-12-18 13:56:20,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:20,574 INFO L462 AbstractCegarLoop]: Abstraction has 10421 states and 32037 transitions. [2019-12-18 13:56:20,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:20,574 INFO L276 IsEmpty]: Start isEmpty. Operand 10421 states and 32037 transitions. [2019-12-18 13:56:20,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 13:56:20,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:20,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:20,580 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:20,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:20,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1843431322, now seen corresponding path program 1 times [2019-12-18 13:56:20,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:20,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949680095] [2019-12-18 13:56:20,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:20,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:20,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949680095] [2019-12-18 13:56:20,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:20,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:56:20,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274294182] [2019-12-18 13:56:20,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:20,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:20,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:20,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:20,670 INFO L87 Difference]: Start difference. First operand 10421 states and 32037 transitions. Second operand 3 states. [2019-12-18 13:56:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:20,738 INFO L93 Difference]: Finished difference Result 10421 states and 31528 transitions. [2019-12-18 13:56:20,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:20,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 13:56:20,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:20,759 INFO L225 Difference]: With dead ends: 10421 [2019-12-18 13:56:20,760 INFO L226 Difference]: Without dead ends: 10421 [2019-12-18 13:56:20,760 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 13:56:20,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10421 states. [2019-12-18 13:56:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10421 to 10413. [2019-12-18 13:56:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10413 states. [2019-12-18 13:56:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10413 states to 10413 states and 31512 transitions. [2019-12-18 13:56:21,141 INFO L78 Accepts]: Start accepts. Automaton has 10413 states and 31512 transitions. Word has length 17 [2019-12-18 13:56:21,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:21,141 INFO L462 AbstractCegarLoop]: Abstraction has 10413 states and 31512 transitions. [2019-12-18 13:56:21,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 10413 states and 31512 transitions. [2019-12-18 13:56:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 13:56:21,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:21,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:21,146 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:21,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:21,146 INFO L82 PathProgramCache]: Analyzing trace with hash 783398497, now seen corresponding path program 1 times [2019-12-18 13:56:21,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:21,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750364064] [2019-12-18 13:56:21,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:21,216 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 13:56:21,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750364064] [2019-12-18 13:56:21,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:21,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:56:21,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990767130] [2019-12-18 13:56:21,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:56:21,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:21,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:56:21,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:56:21,218 INFO L87 Difference]: Start difference. First operand 10413 states and 31512 transitions. Second operand 4 states. [2019-12-18 13:56:21,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:21,247 INFO L93 Difference]: Finished difference Result 1753 states and 4291 transitions. [2019-12-18 13:56:21,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:56:21,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 13:56:21,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:21,250 INFO L225 Difference]: With dead ends: 1753 [2019-12-18 13:56:21,250 INFO L226 Difference]: Without dead ends: 1247 [2019-12-18 13:56:21,250 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 13:56:21,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2019-12-18 13:56:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1247. [2019-12-18 13:56:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1247 states. [2019-12-18 13:56:21,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 2704 transitions. [2019-12-18 13:56:21,265 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 2704 transitions. Word has length 17 [2019-12-18 13:56:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:21,265 INFO L462 AbstractCegarLoop]: Abstraction has 1247 states and 2704 transitions. [2019-12-18 13:56:21,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:56:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 2704 transitions. [2019-12-18 13:56:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:56:21,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:21,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:21,267 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:21,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:21,268 INFO L82 PathProgramCache]: Analyzing trace with hash 702739982, now seen corresponding path program 1 times [2019-12-18 13:56:21,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:21,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907302026] [2019-12-18 13:56:21,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:21,371 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 13:56:21,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907302026] [2019-12-18 13:56:21,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:21,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:56:21,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77107039] [2019-12-18 13:56:21,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:56:21,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:21,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:56:21,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:56:21,374 INFO L87 Difference]: Start difference. First operand 1247 states and 2704 transitions. Second operand 6 states. [2019-12-18 13:56:21,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:21,603 INFO L93 Difference]: Finished difference Result 1303 states and 2774 transitions. [2019-12-18 13:56:21,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:56:21,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 13:56:21,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:21,606 INFO L225 Difference]: With dead ends: 1303 [2019-12-18 13:56:21,606 INFO L226 Difference]: Without dead ends: 1252 [2019-12-18 13:56:21,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:56:21,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2019-12-18 13:56:21,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1193. [2019-12-18 13:56:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2019-12-18 13:56:21,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 2589 transitions. [2019-12-18 13:56:21,624 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 2589 transitions. Word has length 25 [2019-12-18 13:56:21,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:21,625 INFO L462 AbstractCegarLoop]: Abstraction has 1193 states and 2589 transitions. [2019-12-18 13:56:21,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:56:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 2589 transitions. [2019-12-18 13:56:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:56:21,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:21,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:21,628 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:21,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:21,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1134333202, now seen corresponding path program 1 times [2019-12-18 13:56:21,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:21,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366607560] [2019-12-18 13:56:21,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:21,718 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 13:56:21,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366607560] [2019-12-18 13:56:21,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:21,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:56:21,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784889960] [2019-12-18 13:56:21,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:56:21,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:21,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:56:21,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:56:21,721 INFO L87 Difference]: Start difference. First operand 1193 states and 2589 transitions. Second operand 5 states. [2019-12-18 13:56:21,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:21,766 INFO L93 Difference]: Finished difference Result 634 states and 1350 transitions. [2019-12-18 13:56:21,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:56:21,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 13:56:21,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:21,767 INFO L225 Difference]: With dead ends: 634 [2019-12-18 13:56:21,767 INFO L226 Difference]: Without dead ends: 500 [2019-12-18 13:56:21,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:56:21,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-12-18 13:56:21,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2019-12-18 13:56:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-18 13:56:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1104 transitions. [2019-12-18 13:56:21,775 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1104 transitions. Word has length 28 [2019-12-18 13:56:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:21,775 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 1104 transitions. [2019-12-18 13:56:21,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:56:21,776 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1104 transitions. [2019-12-18 13:56:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:56:21,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:21,778 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:21,778 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:21,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:21,779 INFO L82 PathProgramCache]: Analyzing trace with hash 2108814601, now seen corresponding path program 1 times [2019-12-18 13:56:21,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:21,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013011925] [2019-12-18 13:56:21,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:21,823 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 13:56:21,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013011925] [2019-12-18 13:56:21,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:21,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:56:21,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413801997] [2019-12-18 13:56:21,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:21,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:21,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:21,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:21,825 INFO L87 Difference]: Start difference. First operand 500 states and 1104 transitions. Second operand 3 states. [2019-12-18 13:56:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:21,864 INFO L93 Difference]: Finished difference Result 752 states and 1608 transitions. [2019-12-18 13:56:21,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:21,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 13:56:21,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:21,866 INFO L225 Difference]: With dead ends: 752 [2019-12-18 13:56:21,866 INFO L226 Difference]: Without dead ends: 752 [2019-12-18 13:56:21,867 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 13:56:21,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-12-18 13:56:21,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 560. [2019-12-18 13:56:21,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-12-18 13:56:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1224 transitions. [2019-12-18 13:56:21,878 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1224 transitions. Word has length 52 [2019-12-18 13:56:21,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:21,878 INFO L462 AbstractCegarLoop]: Abstraction has 560 states and 1224 transitions. [2019-12-18 13:56:21,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1224 transitions. [2019-12-18 13:56:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:56:21,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:21,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:56:21,881 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:21,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:21,881 INFO L82 PathProgramCache]: Analyzing trace with hash -525709791, now seen corresponding path program 1 times [2019-12-18 13:56:21,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:21,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423334973] [2019-12-18 13:56:21,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:21,974 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 13:56:21,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423334973] [2019-12-18 13:56:21,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:21,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:56:21,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786071388] [2019-12-18 13:56:21,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:56:21,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:21,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:56:21,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:56:21,977 INFO L87 Difference]: Start difference. First operand 560 states and 1224 transitions. Second operand 7 states. [2019-12-18 13:56:22,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:22,151 INFO L93 Difference]: Finished difference Result 1089 states and 2305 transitions. [2019-12-18 13:56:22,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:56:22,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 13:56:22,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:22,153 INFO L225 Difference]: With dead ends: 1089 [2019-12-18 13:56:22,153 INFO L226 Difference]: Without dead ends: 766 [2019-12-18 13:56:22,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:56:22,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-12-18 13:56:22,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 613. [2019-12-18 13:56:22,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-12-18 13:56:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1309 transitions. [2019-12-18 13:56:22,163 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1309 transitions. Word has length 52 [2019-12-18 13:56:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:22,163 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 1309 transitions. [2019-12-18 13:56:22,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:56:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1309 transitions. [2019-12-18 13:56:22,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:56:22,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:22,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:22,166 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:22,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:22,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1253874511, now seen corresponding path program 2 times [2019-12-18 13:56:22,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:22,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77746614] [2019-12-18 13:56:22,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:22,238 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 13:56:22,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77746614] [2019-12-18 13:56:22,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:22,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:56:22,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690878263] [2019-12-18 13:56:22,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:22,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:22,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:22,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:22,241 INFO L87 Difference]: Start difference. First operand 613 states and 1309 transitions. Second operand 3 states. [2019-12-18 13:56:22,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:22,306 INFO L93 Difference]: Finished difference Result 758 states and 1610 transitions. [2019-12-18 13:56:22,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:22,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 13:56:22,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:22,308 INFO L225 Difference]: With dead ends: 758 [2019-12-18 13:56:22,309 INFO L226 Difference]: Without dead ends: 758 [2019-12-18 13:56:22,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:22,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-12-18 13:56:22,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 662. [2019-12-18 13:56:22,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-12-18 13:56:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1418 transitions. [2019-12-18 13:56:22,323 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1418 transitions. Word has length 52 [2019-12-18 13:56:22,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:22,323 INFO L462 AbstractCegarLoop]: Abstraction has 662 states and 1418 transitions. [2019-12-18 13:56:22,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:22,324 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1418 transitions. [2019-12-18 13:56:22,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 13:56:22,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:22,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:22,327 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:22,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:22,328 INFO L82 PathProgramCache]: Analyzing trace with hash -288059161, now seen corresponding path program 1 times [2019-12-18 13:56:22,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:22,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645456702] [2019-12-18 13:56:22,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:56:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:56:22,451 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:56:22,452 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:56:22,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd2~0_239) (= 0 v_~y$flush_delayed~0_31) (= v_~main$tmp_guard0~0_30 0) (= v_~x~0_98 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1445~0.base_35|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1445~0.base_35|) 0) (= v_~y~0_135 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1445~0.base_35| 4)) (= |v_#NULL.offset_3| 0) (= v_~y$mem_tmp~0_22 0) (= v_~y$r_buff1_thd1~0_110 0) (= v_~y$r_buff0_thd1~0_187 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~y$w_buff0_used~0_704 0) (= v_~main$tmp_guard1~0_45 0) (= v_~y$r_buff0_thd0~0_135 0) (= v_~y$r_buff1_thd0~0_153 0) (= v_~y$read_delayed~0_6 0) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1445~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1445~0.base_35|) |v_ULTIMATE.start_main_~#t1445~0.offset_27| 0))) (= 0 v_~__unbuffered_cnt~0_51) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~y$r_buff0_thd2~0_327) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t1445~0.base_35| 1)) (= 0 v_~weak$$choice0~0_20) (= v_~y$w_buff1_used~0_445 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_107 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff1~0_286 0) (= |v_ULTIMATE.start_main_~#t1445~0.offset_27| 0) (= 0 v_~y$w_buff0~0_484))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_704, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_78|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_47|, ULTIMATE.start_main_~#t1446~0.base=|v_ULTIMATE.start_main_~#t1446~0.base_17|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_110, ~y$mem_tmp~0=v_~y$mem_tmp~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_484, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_187, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, #length=|v_#length_17|, ~y~0=v_~y~0_135, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_~#t1446~0.offset=|v_ULTIMATE.start_main_~#t1446~0.offset_15|, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_102|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #valid=|v_#valid_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_327, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ULTIMATE.start_main_~#t1445~0.base=|v_ULTIMATE.start_main_~#t1445~0.base_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ULTIMATE.start_main_~#t1445~0.offset=|v_ULTIMATE.start_main_~#t1445~0.offset_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~x~0=v_~x~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1446~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1446~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1445~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1445~0.offset, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 13:56:22,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L4-->L736: Formula: (and (= ~x~0_Out163635240 1) (= 1 ~y$r_buff0_thd1~0_Out163635240) (= ~y$r_buff0_thd1~0_In163635240 ~y$r_buff1_thd1~0_Out163635240) (= ~y$r_buff0_thd2~0_In163635240 ~y$r_buff1_thd2~0_Out163635240) (= ~y$r_buff0_thd0~0_In163635240 ~y$r_buff1_thd0~0_Out163635240) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In163635240 0))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In163635240, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In163635240, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In163635240, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In163635240} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out163635240, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out163635240, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In163635240, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out163635240, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In163635240, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In163635240, ~x~0=~x~0_Out163635240, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out163635240} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 13:56:22,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L792-1-->L794: Formula: (and (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1446~0.base_11| 1) |v_#valid_23|) (= |v_ULTIMATE.start_main_~#t1446~0.offset_10| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1446~0.base_11| 4) |v_#length_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1446~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1446~0.base_11|) |v_ULTIMATE.start_main_~#t1446~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1446~0.base_11|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1446~0.base_11|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1446~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1446~0.base=|v_ULTIMATE.start_main_~#t1446~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1446~0.offset=|v_ULTIMATE.start_main_~#t1446~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1446~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1446~0.offset] because there is no mapped edge [2019-12-18 13:56:22,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1706979013 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1706979013 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1706979013| ~y$w_buff0_used~0_In1706979013) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1706979013|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1706979013, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1706979013} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1706979013|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1706979013, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1706979013} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:56:22,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-440783990 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In-440783990| |P1Thread1of1ForFork1_#t~ite14_Out-440783990|) (= |P1Thread1of1ForFork1_#t~ite15_Out-440783990| ~y$w_buff0~0_In-440783990)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out-440783990| |P1Thread1of1ForFork1_#t~ite14_Out-440783990|) (= ~y$w_buff0~0_In-440783990 |P1Thread1of1ForFork1_#t~ite14_Out-440783990|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-440783990 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-440783990 256))) (= 0 (mod ~y$w_buff0_used~0_In-440783990 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-440783990 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-440783990, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-440783990, ~y$w_buff0~0=~y$w_buff0~0_In-440783990, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-440783990, ~weak$$choice2~0=~weak$$choice2~0_In-440783990, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-440783990|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-440783990} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-440783990, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-440783990, ~y$w_buff0~0=~y$w_buff0~0_In-440783990, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-440783990, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-440783990|, ~weak$$choice2~0=~weak$$choice2~0_In-440783990, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-440783990|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-440783990} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 13:56:22,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L760-->L760-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In163909120 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In163909120 256) 0))) (or (and (= (mod ~y$r_buff1_thd2~0_In163909120 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In163909120 256)) (and (= (mod ~y$w_buff1_used~0_In163909120 256) 0) .cse0))) (= |P1Thread1of1ForFork1_#t~ite20_Out163909120| ~y$w_buff0_used~0_In163909120) (= |P1Thread1of1ForFork1_#t~ite21_Out163909120| |P1Thread1of1ForFork1_#t~ite20_Out163909120|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite20_In163909120| |P1Thread1of1ForFork1_#t~ite20_Out163909120|) (= |P1Thread1of1ForFork1_#t~ite21_Out163909120| ~y$w_buff0_used~0_In163909120) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In163909120, ~y$w_buff0_used~0=~y$w_buff0_used~0_In163909120, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In163909120|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In163909120, ~weak$$choice2~0=~weak$$choice2~0_In163909120, ~y$w_buff1_used~0=~y$w_buff1_used~0_In163909120} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In163909120, ~y$w_buff0_used~0=~y$w_buff0_used~0_In163909120, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out163909120|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In163909120, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out163909120|, ~weak$$choice2~0=~weak$$choice2~0_In163909120, ~y$w_buff1_used~0=~y$w_buff1_used~0_In163909120} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 13:56:22,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff0_thd2~0_67)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_18, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 13:56:22,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1503367082 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out-1503367082| ~y$r_buff1_thd2~0_In-1503367082) (= |P1Thread1of1ForFork1_#t~ite29_In-1503367082| |P1Thread1of1ForFork1_#t~ite29_Out-1503367082|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1503367082 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1503367082 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-1503367082 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1503367082 256)) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out-1503367082| |P1Thread1of1ForFork1_#t~ite29_Out-1503367082|) (= |P1Thread1of1ForFork1_#t~ite29_Out-1503367082| ~y$r_buff1_thd2~0_In-1503367082)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1503367082, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1503367082|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1503367082, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1503367082, ~weak$$choice2~0=~weak$$choice2~0_In-1503367082, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1503367082} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1503367082, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1503367082|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1503367082|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1503367082, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1503367082, ~weak$$choice2~0=~weak$$choice2~0_In-1503367082, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1503367082} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 13:56:22,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_24 v_~y$mem_tmp~0_6) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 13:56:22,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out76057848| |P1Thread1of1ForFork1_#t~ite32_Out76057848|)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In76057848 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In76057848 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff1~0_In76057848 |P1Thread1of1ForFork1_#t~ite32_Out76057848|)) (and .cse0 (or .cse1 .cse2) (= ~y~0_In76057848 |P1Thread1of1ForFork1_#t~ite32_Out76057848|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In76057848, ~y$w_buff1~0=~y$w_buff1~0_In76057848, ~y~0=~y~0_In76057848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In76057848} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In76057848, ~y$w_buff1~0=~y$w_buff1~0_In76057848, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out76057848|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out76057848|, ~y~0=~y~0_In76057848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In76057848} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 13:56:22,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2140521136 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2140521136 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-2140521136| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-2140521136 |P1Thread1of1ForFork1_#t~ite34_Out-2140521136|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2140521136, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2140521136} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2140521136, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2140521136, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2140521136|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 13:56:22,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2082745401 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-2082745401 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-2082745401 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2082745401 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-2082745401 |P1Thread1of1ForFork1_#t~ite35_Out-2082745401|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-2082745401|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2082745401, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2082745401, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2082745401, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2082745401} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2082745401, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2082745401, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2082745401, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-2082745401|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2082745401} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 13:56:22,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1733323878 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1733323878 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out1733323878| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out1733323878| ~y$r_buff0_thd2~0_In1733323878) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1733323878, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1733323878} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1733323878, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1733323878, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1733323878|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 13:56:22,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-1824141665 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1824141665 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1824141665 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1824141665 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out-1824141665| ~y$r_buff1_thd2~0_In-1824141665) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1824141665| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1824141665, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1824141665, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1824141665, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1824141665} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1824141665, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1824141665, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1824141665, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1824141665|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1824141665} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 13:56:22,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_151 |v_P1Thread1of1ForFork1_#t~ite37_32|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 13:56:22,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd1~0_In-23434848 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-23434848 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-23434848 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-23434848 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-23434848| ~y$w_buff1_used~0_In-23434848)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-23434848| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-23434848, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-23434848, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-23434848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-23434848} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-23434848|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-23434848, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-23434848, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-23434848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-23434848} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:56:22,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In740759412 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In740759412 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out740759412)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out740759412 ~y$r_buff0_thd1~0_In740759412)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In740759412, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In740759412} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In740759412, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out740759412|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out740759412} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:56:22,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd1~0_In-723151944 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-723151944 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-723151944 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-723151944 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-723151944| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-723151944| ~y$r_buff1_thd1~0_In-723151944)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-723151944, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-723151944, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-723151944, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-723151944} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-723151944, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-723151944, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-723151944|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-723151944, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-723151944} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:56:22,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:56:22,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$w_buff0_used~0_276 256)) (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 13:56:22,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1391175749 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out1391175749| |ULTIMATE.start_main_#t~ite40_Out1391175749|)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1391175749 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1391175749| ~y~0_In1391175749) (or .cse0 .cse1) .cse2) (and (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite40_Out1391175749| ~y$w_buff1~0_In1391175749) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1391175749, ~y~0=~y~0_In1391175749, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1391175749, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1391175749} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1391175749|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1391175749|, ~y$w_buff1~0=~y$w_buff1~0_In1391175749, ~y~0=~y~0_In1391175749, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1391175749, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1391175749} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 13:56:22,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1983488093 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1983488093 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1983488093 |ULTIMATE.start_main_#t~ite42_Out1983488093|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out1983488093|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1983488093, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1983488093} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1983488093, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1983488093, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1983488093|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:56:22,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1232875647 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1232875647 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1232875647 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1232875647 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1232875647| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite43_Out1232875647| ~y$w_buff1_used~0_In1232875647) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1232875647, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1232875647, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1232875647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1232875647} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1232875647, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1232875647, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1232875647|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1232875647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1232875647} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 13:56:22,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1321597222 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1321597222 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1321597222 |ULTIMATE.start_main_#t~ite44_Out-1321597222|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1321597222|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1321597222, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1321597222} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1321597222, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1321597222, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1321597222|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 13:56:22,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1295065463 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1295065463 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1295065463 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1295065463 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1295065463| ~y$r_buff1_thd0~0_In1295065463) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1295065463|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1295065463, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1295065463, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1295065463, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1295065463} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1295065463, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1295065463, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1295065463, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1295065463|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1295065463} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:56:22,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite45_33|) (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~x~0_61 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x~0=v_~x~0_61, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x~0=v_~x~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:56:22,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:56:22 BasicIcfg [2019-12-18 13:56:22,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:56:22,578 INFO L168 Benchmark]: Toolchain (without parser) took 14646.63 ms. Allocated memory was 137.9 MB in the beginning and 599.8 MB in the end (delta: 461.9 MB). Free memory was 101.0 MB in the beginning and 105.0 MB in the end (delta: -4.0 MB). Peak memory consumption was 457.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:22,579 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 13:56:22,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.28 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.6 MB in the beginning and 156.0 MB in the end (delta: -55.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:22,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.53 ms. Allocated memory is still 201.3 MB. Free memory was 156.0 MB in the beginning and 153.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:22,581 INFO L168 Benchmark]: Boogie Preprocessor took 47.80 ms. Allocated memory is still 201.3 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:22,583 INFO L168 Benchmark]: RCFGBuilder took 832.07 ms. Allocated memory is still 201.3 MB. Free memory was 151.1 MB in the beginning and 107.0 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:22,584 INFO L168 Benchmark]: TraceAbstraction took 12939.97 ms. Allocated memory was 201.3 MB in the beginning and 599.8 MB in the end (delta: 398.5 MB). Free memory was 106.0 MB in the beginning and 105.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 399.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:22,596 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.54 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 762.28 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.6 MB in the beginning and 156.0 MB in the end (delta: -55.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.53 ms. Allocated memory is still 201.3 MB. Free memory was 156.0 MB in the beginning and 153.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.80 ms. Allocated memory is still 201.3 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 832.07 ms. Allocated memory is still 201.3 MB. Free memory was 151.1 MB in the beginning and 107.0 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12939.97 ms. Allocated memory was 201.3 MB in the beginning and 599.8 MB in the end (delta: 398.5 MB). Free memory was 106.0 MB in the beginning and 105.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 399.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 146 ProgramPointsBefore, 75 ProgramPointsAfterwards, 180 TransitionsBefore, 85 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 28 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 27 ChoiceCompositions, 4902 VarBasedMoverChecksPositive, 321 VarBasedMoverChecksNegative, 236 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 74785 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L792] FCALL, FORK 0 pthread_create(&t1445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.6s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1234 SDtfs, 1152 SDslu, 1959 SDs, 0 SdLazy, 807 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11886occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 5507 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 25673 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...