/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix032_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:56:01,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:56:01,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:56:01,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:56:01,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:56:01,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:56:01,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:56:01,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:56:01,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:56:01,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:56:01,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:56:01,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:56:01,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:56:01,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:56:01,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:56:01,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:56:01,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:56:01,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:56:01,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:56:01,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:56:01,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:56:01,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:56:01,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:56:01,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:56:01,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:56:01,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:56:01,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:56:01,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:56:01,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:56:01,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:56:01,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:56:01,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:56:01,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:56:01,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:56:01,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:56:01,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:56:01,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:56:01,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:56:01,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:56:01,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:56:01,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:56:01,736 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:56:01,761 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:56:01,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:56:01,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:56:01,763 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:56:01,763 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:56:01,764 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:56:01,766 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:56:01,766 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:56:01,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:56:01,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:56:01,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:56:01,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:56:01,767 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:56:01,768 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:56:01,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:56:01,768 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:56:01,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:56:01,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:56:01,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:56:01,769 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:56:01,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:56:01,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:56:01,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:56:01,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:56:01,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:56:01,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:56:01,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:56:01,772 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:56:01,772 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:56:01,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:56:01,773 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:56:01,773 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:56:02,068 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:56:02,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:56:02,087 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:56:02,089 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:56:02,089 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:56:02,090 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_tso.opt.i [2019-12-27 20:56:02,156 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fcc98c2/bff2c1769be7429dbadb146c83568513/FLAGcf151fac9 [2019-12-27 20:56:02,741 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:56:02,742 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_tso.opt.i [2019-12-27 20:56:02,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fcc98c2/bff2c1769be7429dbadb146c83568513/FLAGcf151fac9 [2019-12-27 20:56:03,041 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fcc98c2/bff2c1769be7429dbadb146c83568513 [2019-12-27 20:56:03,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:56:03,050 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:56:03,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:56:03,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:56:03,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:56:03,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:56:03" (1/1) ... [2019-12-27 20:56:03,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d874f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:03, skipping insertion in model container [2019-12-27 20:56:03,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:56:03" (1/1) ... [2019-12-27 20:56:03,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:56:03,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:56:03,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:56:03,722 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:56:03,796 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:56:03,866 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:56:03,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:03 WrapperNode [2019-12-27 20:56:03,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:56:03,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:56:03,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:56:03,868 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:56:03,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:03" (1/1) ... [2019-12-27 20:56:03,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:03" (1/1) ... [2019-12-27 20:56:03,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:56:03,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:56:03,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:56:03,929 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:56:03,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:03" (1/1) ... [2019-12-27 20:56:03,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:03" (1/1) ... [2019-12-27 20:56:03,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:03" (1/1) ... [2019-12-27 20:56:03,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:03" (1/1) ... [2019-12-27 20:56:03,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:03" (1/1) ... [2019-12-27 20:56:03,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:03" (1/1) ... [2019-12-27 20:56:03,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:03" (1/1) ... [2019-12-27 20:56:03,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:56:03,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:56:03,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:56:03,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:56:03,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:56:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:56:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:56:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:56:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:56:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:56:04,028 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:56:04,028 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:56:04,028 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:56:04,028 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:56:04,028 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:56:04,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:56:04,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:56:04,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:56:04,031 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:56:04,725 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:56:04,726 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:56:04,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:56:04 BoogieIcfgContainer [2019-12-27 20:56:04,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:56:04,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:56:04,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:56:04,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:56:04,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:56:03" (1/3) ... [2019-12-27 20:56:04,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acfb8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:56:04, skipping insertion in model container [2019-12-27 20:56:04,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:03" (2/3) ... [2019-12-27 20:56:04,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acfb8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:56:04, skipping insertion in model container [2019-12-27 20:56:04,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:56:04" (3/3) ... [2019-12-27 20:56:04,736 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_tso.opt.i [2019-12-27 20:56:04,746 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:56:04,746 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:56:04,756 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:56:04,757 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:56:04,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,795 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,795 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,798 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,798 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,822 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,822 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,823 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,823 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,823 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,834 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,835 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,836 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,840 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,840 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,844 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,862 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:04,878 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:56:04,897 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:56:04,898 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:56:04,898 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:56:04,898 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:56:04,898 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:56:04,898 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:56:04,898 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:56:04,898 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:56:04,915 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 181 transitions [2019-12-27 20:56:04,917 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 156 places, 181 transitions [2019-12-27 20:56:05,035 INFO L132 PetriNetUnfolder]: 35/178 cut-off events. [2019-12-27 20:56:05,036 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:56:05,052 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 35/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/141 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 20:56:05,067 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 156 places, 181 transitions [2019-12-27 20:56:05,150 INFO L132 PetriNetUnfolder]: 35/178 cut-off events. [2019-12-27 20:56:05,150 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:56:05,156 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 35/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/141 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 20:56:05,169 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-27 20:56:05,171 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:56:08,354 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:56:08,472 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:56:08,777 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 20:56:08,938 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 20:56:08,962 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51271 [2019-12-27 20:56:08,962 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 20:56:08,966 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-12-27 20:56:09,990 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14534 states. [2019-12-27 20:56:09,993 INFO L276 IsEmpty]: Start isEmpty. Operand 14534 states. [2019-12-27 20:56:10,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 20:56:10,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:10,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:10,002 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:56:10,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:10,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1671700896, now seen corresponding path program 1 times [2019-12-27 20:56:10,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:10,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754006093] [2019-12-27 20:56:10,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:10,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:56:10,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754006093] [2019-12-27 20:56:10,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:10,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:56:10,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1581288343] [2019-12-27 20:56:10,361 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:10,367 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:10,384 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 20:56:10,384 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:10,389 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:56:10,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:56:10,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:10,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:56:10,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:56:10,411 INFO L87 Difference]: Start difference. First operand 14534 states. Second operand 3 states. [2019-12-27 20:56:10,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:10,713 INFO L93 Difference]: Finished difference Result 14182 states and 55174 transitions. [2019-12-27 20:56:10,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:56:10,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 20:56:10,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:10,915 INFO L225 Difference]: With dead ends: 14182 [2019-12-27 20:56:10,915 INFO L226 Difference]: Without dead ends: 13350 [2019-12-27 20:56:10,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:56:11,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13350 states. [2019-12-27 20:56:11,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13350 to 13350. [2019-12-27 20:56:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13350 states. [2019-12-27 20:56:11,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13350 states to 13350 states and 51860 transitions. [2019-12-27 20:56:11,748 INFO L78 Accepts]: Start accepts. Automaton has 13350 states and 51860 transitions. Word has length 7 [2019-12-27 20:56:11,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:11,749 INFO L462 AbstractCegarLoop]: Abstraction has 13350 states and 51860 transitions. [2019-12-27 20:56:11,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:56:11,749 INFO L276 IsEmpty]: Start isEmpty. Operand 13350 states and 51860 transitions. [2019-12-27 20:56:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:56:11,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:11,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:11,756 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:56:11,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:11,757 INFO L82 PathProgramCache]: Analyzing trace with hash -76146322, now seen corresponding path program 1 times [2019-12-27 20:56:11,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:11,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766869638] [2019-12-27 20:56:11,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:11,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:56:11,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766869638] [2019-12-27 20:56:11,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:11,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:56:11,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1918107708] [2019-12-27 20:56:11,829 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:11,830 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:11,833 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:56:11,833 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:11,834 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:56:11,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:56:11,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:11,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:56:11,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:56:11,836 INFO L87 Difference]: Start difference. First operand 13350 states and 51860 transitions. Second operand 3 states. [2019-12-27 20:56:11,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:11,942 INFO L93 Difference]: Finished difference Result 7974 states and 27125 transitions. [2019-12-27 20:56:11,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:56:11,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:56:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:11,977 INFO L225 Difference]: With dead ends: 7974 [2019-12-27 20:56:11,977 INFO L226 Difference]: Without dead ends: 7974 [2019-12-27 20:56:11,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:56:12,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7974 states. [2019-12-27 20:56:12,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7974 to 7974. [2019-12-27 20:56:12,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7974 states. [2019-12-27 20:56:13,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7974 states to 7974 states and 27125 transitions. [2019-12-27 20:56:13,005 INFO L78 Accepts]: Start accepts. Automaton has 7974 states and 27125 transitions. Word has length 13 [2019-12-27 20:56:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:13,006 INFO L462 AbstractCegarLoop]: Abstraction has 7974 states and 27125 transitions. [2019-12-27 20:56:13,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:56:13,006 INFO L276 IsEmpty]: Start isEmpty. Operand 7974 states and 27125 transitions. [2019-12-27 20:56:13,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:56:13,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:13,009 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:13,009 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:56:13,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:13,009 INFO L82 PathProgramCache]: Analyzing trace with hash 383510487, now seen corresponding path program 1 times [2019-12-27 20:56:13,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:13,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973822414] [2019-12-27 20:56:13,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:56:13,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973822414] [2019-12-27 20:56:13,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:13,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:56:13,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2114417684] [2019-12-27 20:56:13,072 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:13,073 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:13,075 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 20:56:13,076 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:13,077 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:56:13,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:56:13,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:13,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:56:13,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:56:13,078 INFO L87 Difference]: Start difference. First operand 7974 states and 27125 transitions. Second operand 4 states. [2019-12-27 20:56:13,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:13,127 INFO L93 Difference]: Finished difference Result 1840 states and 5044 transitions. [2019-12-27 20:56:13,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:56:13,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:56:13,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:13,133 INFO L225 Difference]: With dead ends: 1840 [2019-12-27 20:56:13,133 INFO L226 Difference]: Without dead ends: 1840 [2019-12-27 20:56:13,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:56:13,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2019-12-27 20:56:13,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1840. [2019-12-27 20:56:13,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1840 states. [2019-12-27 20:56:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 5044 transitions. [2019-12-27 20:56:13,186 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 5044 transitions. Word has length 14 [2019-12-27 20:56:13,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:13,186 INFO L462 AbstractCegarLoop]: Abstraction has 1840 states and 5044 transitions. [2019-12-27 20:56:13,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:56:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 5044 transitions. [2019-12-27 20:56:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:56:13,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:13,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:13,189 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:56:13,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:13,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1452926097, now seen corresponding path program 1 times [2019-12-27 20:56:13,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:13,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024238406] [2019-12-27 20:56:13,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:13,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:56:13,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024238406] [2019-12-27 20:56:13,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:13,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:56:13,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1837821483] [2019-12-27 20:56:13,283 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:13,286 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:13,290 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 20:56:13,291 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:13,291 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:56:13,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:56:13,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:13,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:56:13,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:56:13,293 INFO L87 Difference]: Start difference. First operand 1840 states and 5044 transitions. Second operand 3 states. [2019-12-27 20:56:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:13,398 INFO L93 Difference]: Finished difference Result 2653 states and 7081 transitions. [2019-12-27 20:56:13,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:56:13,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 20:56:13,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:13,410 INFO L225 Difference]: With dead ends: 2653 [2019-12-27 20:56:13,410 INFO L226 Difference]: Without dead ends: 2653 [2019-12-27 20:56:13,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:56:13,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2019-12-27 20:56:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 2071. [2019-12-27 20:56:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-27 20:56:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 5594 transitions. [2019-12-27 20:56:13,468 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 5594 transitions. Word has length 16 [2019-12-27 20:56:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:13,469 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 5594 transitions. [2019-12-27 20:56:13,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:56:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 5594 transitions. [2019-12-27 20:56:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:56:13,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:13,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:13,471 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:56:13,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:13,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1583082976, now seen corresponding path program 1 times [2019-12-27 20:56:13,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:13,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465887928] [2019-12-27 20:56:13,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:56:13,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465887928] [2019-12-27 20:56:13,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:13,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:56:13,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1544096933] [2019-12-27 20:56:13,538 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:13,540 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:13,544 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 20:56:13,544 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:13,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:56:13,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:56:13,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:13,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:56:13,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:56:13,545 INFO L87 Difference]: Start difference. First operand 2071 states and 5594 transitions. Second operand 4 states. [2019-12-27 20:56:13,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:13,719 INFO L93 Difference]: Finished difference Result 2647 states and 6980 transitions. [2019-12-27 20:56:13,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:56:13,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:56:13,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:13,729 INFO L225 Difference]: With dead ends: 2647 [2019-12-27 20:56:13,729 INFO L226 Difference]: Without dead ends: 2647 [2019-12-27 20:56:13,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:56:13,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-12-27 20:56:13,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2439. [2019-12-27 20:56:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2439 states. [2019-12-27 20:56:13,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2439 states and 6530 transitions. [2019-12-27 20:56:13,788 INFO L78 Accepts]: Start accepts. Automaton has 2439 states and 6530 transitions. Word has length 16 [2019-12-27 20:56:13,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:13,788 INFO L462 AbstractCegarLoop]: Abstraction has 2439 states and 6530 transitions. [2019-12-27 20:56:13,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:56:13,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 6530 transitions. [2019-12-27 20:56:13,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:56:13,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:13,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:13,791 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:56:13,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:13,791 INFO L82 PathProgramCache]: Analyzing trace with hash 427470360, now seen corresponding path program 1 times [2019-12-27 20:56:13,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:13,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829427621] [2019-12-27 20:56:13,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:56:13,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829427621] [2019-12-27 20:56:13,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:13,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:56:13,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2072998597] [2019-12-27 20:56:13,884 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:13,888 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:13,892 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 20:56:13,892 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:13,929 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:56:13,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:56:13,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:13,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:56:13,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:56:13,930 INFO L87 Difference]: Start difference. First operand 2439 states and 6530 transitions. Second operand 5 states. [2019-12-27 20:56:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:14,213 INFO L93 Difference]: Finished difference Result 3088 states and 8135 transitions. [2019-12-27 20:56:14,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:56:14,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 20:56:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:14,225 INFO L225 Difference]: With dead ends: 3088 [2019-12-27 20:56:14,226 INFO L226 Difference]: Without dead ends: 3088 [2019-12-27 20:56:14,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:56:14,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2019-12-27 20:56:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 2576. [2019-12-27 20:56:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2019-12-27 20:56:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 6902 transitions. [2019-12-27 20:56:14,294 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 6902 transitions. Word has length 16 [2019-12-27 20:56:14,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:14,295 INFO L462 AbstractCegarLoop]: Abstraction has 2576 states and 6902 transitions. [2019-12-27 20:56:14,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:56:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 6902 transitions. [2019-12-27 20:56:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 20:56:14,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:14,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:14,300 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:56:14,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:14,301 INFO L82 PathProgramCache]: Analyzing trace with hash 879756343, now seen corresponding path program 1 times [2019-12-27 20:56:14,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:14,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386020925] [2019-12-27 20:56:14,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:56:14,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386020925] [2019-12-27 20:56:14,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:14,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:56:14,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [856178058] [2019-12-27 20:56:14,362 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:14,367 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:14,381 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 97 transitions. [2019-12-27 20:56:14,382 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:14,382 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:56:14,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:56:14,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:14,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:56:14,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:56:14,383 INFO L87 Difference]: Start difference. First operand 2576 states and 6902 transitions. Second operand 5 states. [2019-12-27 20:56:14,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:14,429 INFO L93 Difference]: Finished difference Result 1612 states and 4421 transitions. [2019-12-27 20:56:14,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:56:14,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 20:56:14,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:14,435 INFO L225 Difference]: With dead ends: 1612 [2019-12-27 20:56:14,435 INFO L226 Difference]: Without dead ends: 1612 [2019-12-27 20:56:14,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:56:14,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2019-12-27 20:56:14,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1512. [2019-12-27 20:56:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2019-12-27 20:56:14,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 4171 transitions. [2019-12-27 20:56:14,478 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 4171 transitions. Word has length 29 [2019-12-27 20:56:14,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:14,478 INFO L462 AbstractCegarLoop]: Abstraction has 1512 states and 4171 transitions. [2019-12-27 20:56:14,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:56:14,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 4171 transitions. [2019-12-27 20:56:14,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 20:56:14,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:14,483 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:14,484 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:56:14,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:14,484 INFO L82 PathProgramCache]: Analyzing trace with hash 266150348, now seen corresponding path program 1 times [2019-12-27 20:56:14,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:14,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504548131] [2019-12-27 20:56:14,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:14,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:56:14,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504548131] [2019-12-27 20:56:14,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:14,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:56:14,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [716313161] [2019-12-27 20:56:14,569 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:14,581 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:14,624 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 143 transitions. [2019-12-27 20:56:14,625 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:14,636 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:56:14,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:56:14,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:14,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:56:14,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:56:14,638 INFO L87 Difference]: Start difference. First operand 1512 states and 4171 transitions. Second operand 5 states. [2019-12-27 20:56:14,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:14,689 INFO L93 Difference]: Finished difference Result 2240 states and 5797 transitions. [2019-12-27 20:56:14,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:56:14,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 20:56:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:14,695 INFO L225 Difference]: With dead ends: 2240 [2019-12-27 20:56:14,695 INFO L226 Difference]: Without dead ends: 1473 [2019-12-27 20:56:14,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:56:14,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2019-12-27 20:56:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1369. [2019-12-27 20:56:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2019-12-27 20:56:14,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 3710 transitions. [2019-12-27 20:56:14,723 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 3710 transitions. Word has length 44 [2019-12-27 20:56:14,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:14,723 INFO L462 AbstractCegarLoop]: Abstraction has 1369 states and 3710 transitions. [2019-12-27 20:56:14,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:56:14,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 3710 transitions. [2019-12-27 20:56:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 20:56:14,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:14,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:14,728 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:56:14,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:14,728 INFO L82 PathProgramCache]: Analyzing trace with hash 790276266, now seen corresponding path program 2 times [2019-12-27 20:56:14,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:14,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660995167] [2019-12-27 20:56:14,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:56:14,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660995167] [2019-12-27 20:56:14,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:14,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:56:14,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [224710083] [2019-12-27 20:56:14,792 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:14,804 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:14,918 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 151 transitions. [2019-12-27 20:56:14,918 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:14,932 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:56:14,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:56:14,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:14,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:56:14,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:56:14,933 INFO L87 Difference]: Start difference. First operand 1369 states and 3710 transitions. Second operand 5 states. [2019-12-27 20:56:15,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:15,118 INFO L93 Difference]: Finished difference Result 2329 states and 6105 transitions. [2019-12-27 20:56:15,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:56:15,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 20:56:15,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:15,120 INFO L225 Difference]: With dead ends: 2329 [2019-12-27 20:56:15,120 INFO L226 Difference]: Without dead ends: 763 [2019-12-27 20:56:15,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:56:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-12-27 20:56:15,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 490. [2019-12-27 20:56:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-12-27 20:56:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1117 transitions. [2019-12-27 20:56:15,131 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1117 transitions. Word has length 44 [2019-12-27 20:56:15,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:15,131 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 1117 transitions. [2019-12-27 20:56:15,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:56:15,131 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1117 transitions. [2019-12-27 20:56:15,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 20:56:15,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:15,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:15,133 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:56:15,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:15,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1816574034, now seen corresponding path program 3 times [2019-12-27 20:56:15,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:15,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989932158] [2019-12-27 20:56:15,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:15,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:56:15,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989932158] [2019-12-27 20:56:15,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:15,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:56:15,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [609337383] [2019-12-27 20:56:15,211 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:15,221 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:15,254 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 134 transitions. [2019-12-27 20:56:15,255 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:15,269 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:56:15,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:56:15,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:15,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:56:15,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:56:15,270 INFO L87 Difference]: Start difference. First operand 490 states and 1117 transitions. Second operand 7 states. [2019-12-27 20:56:15,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:15,465 INFO L93 Difference]: Finished difference Result 894 states and 1986 transitions. [2019-12-27 20:56:15,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:56:15,466 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-27 20:56:15,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:15,467 INFO L225 Difference]: With dead ends: 894 [2019-12-27 20:56:15,467 INFO L226 Difference]: Without dead ends: 606 [2019-12-27 20:56:15,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:56:15,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-12-27 20:56:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 538. [2019-12-27 20:56:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-12-27 20:56:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1192 transitions. [2019-12-27 20:56:15,477 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1192 transitions. Word has length 44 [2019-12-27 20:56:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:15,478 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 1192 transitions. [2019-12-27 20:56:15,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:56:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1192 transitions. [2019-12-27 20:56:15,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 20:56:15,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:15,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:15,481 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:56:15,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:15,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1698775532, now seen corresponding path program 4 times [2019-12-27 20:56:15,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:15,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899281244] [2019-12-27 20:56:15,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:15,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:56:15,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899281244] [2019-12-27 20:56:15,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:15,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:56:15,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2082051898] [2019-12-27 20:56:15,603 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:15,612 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:15,652 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 151 transitions. [2019-12-27 20:56:15,652 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:15,703 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:56:15,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:56:15,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:15,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:56:15,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:56:15,705 INFO L87 Difference]: Start difference. First operand 538 states and 1192 transitions. Second operand 6 states. [2019-12-27 20:56:16,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:16,129 INFO L93 Difference]: Finished difference Result 870 states and 1883 transitions. [2019-12-27 20:56:16,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:56:16,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-12-27 20:56:16,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:16,133 INFO L225 Difference]: With dead ends: 870 [2019-12-27 20:56:16,133 INFO L226 Difference]: Without dead ends: 852 [2019-12-27 20:56:16,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:56:16,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2019-12-27 20:56:16,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 808. [2019-12-27 20:56:16,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-12-27 20:56:16,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1766 transitions. [2019-12-27 20:56:16,146 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1766 transitions. Word has length 44 [2019-12-27 20:56:16,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:16,147 INFO L462 AbstractCegarLoop]: Abstraction has 808 states and 1766 transitions. [2019-12-27 20:56:16,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:56:16,147 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1766 transitions. [2019-12-27 20:56:16,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 20:56:16,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:16,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:16,150 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:56:16,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:16,150 INFO L82 PathProgramCache]: Analyzing trace with hash -2098685651, now seen corresponding path program 1 times [2019-12-27 20:56:16,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:16,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117060450] [2019-12-27 20:56:16,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:16,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-27 20:56:16,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117060450] [2019-12-27 20:56:16,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:16,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:56:16,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1041917347] [2019-12-27 20:56:16,240 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:16,252 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:16,293 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 109 transitions. [2019-12-27 20:56:16,293 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:16,308 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:56:16,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:56:16,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:16,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:56:16,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:56:16,309 INFO L87 Difference]: Start difference. First operand 808 states and 1766 transitions. Second operand 3 states. [2019-12-27 20:56:16,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:16,350 INFO L93 Difference]: Finished difference Result 920 states and 1868 transitions. [2019-12-27 20:56:16,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:56:16,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 20:56:16,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:16,352 INFO L225 Difference]: With dead ends: 920 [2019-12-27 20:56:16,352 INFO L226 Difference]: Without dead ends: 920 [2019-12-27 20:56:16,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:56:16,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2019-12-27 20:56:16,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 808. [2019-12-27 20:56:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-12-27 20:56:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1658 transitions. [2019-12-27 20:56:16,367 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1658 transitions. Word has length 44 [2019-12-27 20:56:16,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:16,367 INFO L462 AbstractCegarLoop]: Abstraction has 808 states and 1658 transitions. [2019-12-27 20:56:16,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:56:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1658 transitions. [2019-12-27 20:56:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 20:56:16,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:16,369 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:16,369 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:56:16,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:16,370 INFO L82 PathProgramCache]: Analyzing trace with hash 476211020, now seen corresponding path program 5 times [2019-12-27 20:56:16,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:16,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593564100] [2019-12-27 20:56:16,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:56:16,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593564100] [2019-12-27 20:56:16,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:16,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:56:16,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1894970952] [2019-12-27 20:56:16,446 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:16,455 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:16,493 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 104 transitions. [2019-12-27 20:56:16,493 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:16,493 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:56:16,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:56:16,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:16,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:56:16,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:56:16,495 INFO L87 Difference]: Start difference. First operand 808 states and 1658 transitions. Second operand 3 states. [2019-12-27 20:56:16,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:16,506 INFO L93 Difference]: Finished difference Result 806 states and 1653 transitions. [2019-12-27 20:56:16,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:56:16,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 20:56:16,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:16,508 INFO L225 Difference]: With dead ends: 806 [2019-12-27 20:56:16,508 INFO L226 Difference]: Without dead ends: 806 [2019-12-27 20:56:16,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:56:16,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-12-27 20:56:16,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 665. [2019-12-27 20:56:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-12-27 20:56:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1386 transitions. [2019-12-27 20:56:16,519 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1386 transitions. Word has length 44 [2019-12-27 20:56:16,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:16,519 INFO L462 AbstractCegarLoop]: Abstraction has 665 states and 1386 transitions. [2019-12-27 20:56:16,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:56:16,520 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1386 transitions. [2019-12-27 20:56:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 20:56:16,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:16,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:16,522 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:56:16,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:16,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1501880967, now seen corresponding path program 1 times [2019-12-27 20:56:16,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:16,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540227849] [2019-12-27 20:56:16,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:56:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:56:16,617 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:56:16,617 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:56:16,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p1_EBX~0_17 0) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~a~0_8) (= 0 v_~z$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_p0_EAX~0_15) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t870~0.base_24|) (= |v_#NULL.offset_3| 0) (= v_~z$read_delayed~0_8 0) (= 0 |v_ULTIMATE.start_main_~#t870~0.offset_19|) (= 0 v_~__unbuffered_cnt~0_21) (= 0 v_~z$w_buff1~0_21) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t870~0.base_24| 4)) (= 0 v_~__unbuffered_p2_EAX~0_16) (= 0 v_~z$r_buff1_thd2~0_38) (= 0 v_~z$flush_delayed~0_14) (= v_~z~0_23 0) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~z$r_buff1_thd1~0_9 0) (= v_~z$r_buff0_thd1~0_9 0) (= v_~z$mem_tmp~0_10 0) (= 0 v_~z$r_buff1_thd3~0_16) (= v_~z$w_buff0_used~0_95 0) (= v_~z$r_buff0_thd3~0_25 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t870~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t870~0.base_24|) |v_ULTIMATE.start_main_~#t870~0.offset_19| 0)) |v_#memory_int_17|) (= 0 v_~z$w_buff1_used~0_53) (= 0 |v_#NULL.base_3|) (= 0 v_~z$w_buff0~0_28) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t870~0.base_24| 1)) (= v_~z$r_buff0_thd2~0_66 0) (= v_~x~0_12 0) (= v_~main$tmp_guard0~0_11 0) (= v_~b~0_12 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t870~0.base_24|) 0) (= 0 v_~__unbuffered_p1_EAX~0_16) (= v_~z$read_delayed_var~0.offset_8 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_38, #NULL.offset=|v_#NULL.offset_3|, ~a~0=v_~a~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ULTIMATE.start_main_~#t870~0.offset=|v_ULTIMATE.start_main_~#t870~0.offset_19|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ULTIMATE.start_main_~#t870~0.base=|v_ULTIMATE.start_main_~#t870~0.base_24|, ULTIMATE.start_main_~#t871~0.base=|v_ULTIMATE.start_main_~#t871~0.base_23|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_53, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_11|, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_9, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_12, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_~#t871~0.offset=|v_ULTIMATE.start_main_~#t871~0.offset_17|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t872~0.base=|v_ULTIMATE.start_main_~#t872~0.base_21|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_20, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_66, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~z$w_buff0~0=v_~z$w_buff0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_16, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_~#t872~0.offset=|v_ULTIMATE.start_main_~#t872~0.offset_17|, ~b~0=v_~b~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t870~0.offset, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t870~0.base, ULTIMATE.start_main_~#t871~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t871~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t872~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t872~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:56:16,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t871~0.offset_9| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t871~0.base_10|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t871~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t871~0.base_10|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t871~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t871~0.base_10|) |v_ULTIMATE.start_main_~#t871~0.offset_9| 1))) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t871~0.base_10|)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t871~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t871~0.base=|v_ULTIMATE.start_main_~#t871~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t871~0.offset=|v_ULTIMATE.start_main_~#t871~0.offset_9|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t871~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t871~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 20:56:16,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L834-1-->L836: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t872~0.base_13|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t872~0.base_13| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t872~0.base_13| 4)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t872~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t872~0.base_13|) |v_ULTIMATE.start_main_~#t872~0.offset_11| 2)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t872~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t872~0.offset_11|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t872~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_10|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t872~0.offset=|v_ULTIMATE.start_main_~#t872~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t872~0.base=|v_ULTIMATE.start_main_~#t872~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t872~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t872~0.base] because there is no mapped edge [2019-12-27 20:56:16,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] P2ENTRY-->L4-3: Formula: (and (= |P2Thread1of1ForFork0_#in~arg.offset_In-1149153633| P2Thread1of1ForFork0_~arg.offset_Out-1149153633) (= |P2Thread1of1ForFork0_#in~arg.base_In-1149153633| P2Thread1of1ForFork0_~arg.base_Out-1149153633) (= ~z$w_buff0~0_Out-1149153633 1) (= ~z$w_buff1_used~0_Out-1149153633 ~z$w_buff0_used~0_In-1149153633) (= (mod ~z$w_buff1_used~0_Out-1149153633 256) 0) (= ~z$w_buff1~0_Out-1149153633 ~z$w_buff0~0_In-1149153633) (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1149153633| 1) (= 1 ~z$w_buff0_used~0_Out-1149153633) (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1149153633 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1149153633|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-1149153633|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1149153633, ~z$w_buff0~0=~z$w_buff0~0_In-1149153633, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-1149153633|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out-1149153633, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1149153633|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-1149153633|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1149153633, ~z$w_buff0~0=~z$w_buff0~0_Out-1149153633, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out-1149153633, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1149153633, ~z$w_buff1~0=~z$w_buff1~0_Out-1149153633, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-1149153633|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1149153633} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 20:56:16,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 1 v_~b~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~x~0_6) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_6} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~b~0=v_~b~0_7, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_6, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 20:56:16,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-307458602 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-307458602 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out-307458602| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-307458602 |P2Thread1of1ForFork0_#t~ite28_Out-307458602|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-307458602, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-307458602} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-307458602|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-307458602, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-307458602} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 20:56:16,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1845415786 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-1845415786 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1845415786 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1845415786 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite29_Out-1845415786|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1845415786 |P2Thread1of1ForFork0_#t~ite29_Out-1845415786|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1845415786, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1845415786, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1845415786, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1845415786} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1845415786, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1845415786, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1845415786, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1845415786, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1845415786|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 20:56:16,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L812-->L813: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1321855703 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1321855703 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd3~0_Out1321855703 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_Out1321855703 ~z$r_buff0_thd3~0_In1321855703)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1321855703, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1321855703} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1321855703, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out1321855703, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1321855703|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite30] because there is no mapped edge [2019-12-27 20:56:16,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1047831048 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1047831048 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In1047831048 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1047831048 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite31_Out1047831048|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In1047831048 |P2Thread1of1ForFork0_#t~ite31_Out1047831048|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1047831048, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1047831048, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1047831048, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1047831048} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1047831048, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1047831048, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1047831048, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1047831048, P2Thread1of1ForFork0_#t~ite31=|P2Thread1of1ForFork0_#t~ite31_Out1047831048|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 20:56:16,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_11 |v_P2Thread1of1ForFork0_#t~ite31_8|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 20:56:16,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L772-->L773: Formula: (and (= v_~z$r_buff0_thd2~0_58 v_~z$r_buff0_thd2~0_57) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_58} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_10|, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_12|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 20:56:16,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L775-->L783: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= v_~z~0_13 v_~z$mem_tmp~0_4) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_13, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 20:56:16,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:56:16,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L842-2-->L842-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In79040010 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In79040010 256)))) (or (and (= ~z~0_In79040010 |ULTIMATE.start_main_#t~ite35_Out79040010|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In79040010 |ULTIMATE.start_main_#t~ite35_Out79040010|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In79040010, ~z$w_buff1_used~0=~z$w_buff1_used~0_In79040010, ~z$w_buff1~0=~z$w_buff1~0_In79040010, ~z~0=~z~0_In79040010} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In79040010, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out79040010|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In79040010, ~z$w_buff1~0=~z$w_buff1~0_In79040010, ~z~0=~z~0_In79040010} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-27 20:56:16,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L842-4-->L843: Formula: (= v_~z~0_12 |v_ULTIMATE.start_main_#t~ite35_7|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~z~0=v_~z~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-12-27 20:56:16,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1113716665 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1113716665 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1113716665 |ULTIMATE.start_main_#t~ite37_Out-1113716665|)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-1113716665|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1113716665, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1113716665} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1113716665, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1113716665, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1113716665|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 20:56:16,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L844-->L844-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-1763150861 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1763150861 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1763150861 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1763150861 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1763150861| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-1763150861| ~z$w_buff1_used~0_In-1763150861)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1763150861, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1763150861, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1763150861, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1763150861} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1763150861, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1763150861, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1763150861, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1763150861, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1763150861|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 20:56:16,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L845-->L845-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1451229602 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1451229602 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1451229602| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite39_Out-1451229602| ~z$r_buff0_thd0~0_In-1451229602) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1451229602, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1451229602} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1451229602, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1451229602|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1451229602} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 20:56:16,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In791296399 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In791296399 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In791296399 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In791296399 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite40_Out791296399|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out791296399| ~z$r_buff1_thd0~0_In791296399) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In791296399, ~z$w_buff0_used~0=~z$w_buff0_used~0_In791296399, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In791296399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In791296399} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In791296399, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out791296399|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In791296399, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In791296399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In791296399} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:56:16,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= |v_ULTIMATE.start_main_#t~ite40_16| v_~z$r_buff1_thd0~0_14) (= v_~main$tmp_guard1~0_12 0) (= v_~__unbuffered_p1_EBX~0_11 0) (= 1 v_~__unbuffered_p2_EAX~0_10) (= 1 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~__unbuffered_p0_EAX~0_12)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_11, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_11, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:56:16,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:56:16 BasicIcfg [2019-12-27 20:56:16,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:56:16,744 INFO L168 Benchmark]: Toolchain (without parser) took 13690.89 ms. Allocated memory was 143.7 MB in the beginning and 629.7 MB in the end (delta: 486.0 MB). Free memory was 100.1 MB in the beginning and 282.6 MB in the end (delta: -182.5 MB). Peak memory consumption was 303.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:56:16,745 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 20:56:16,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 815.32 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 99.7 MB in the beginning and 153.0 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:56:16,750 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.72 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 150.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:56:16,750 INFO L168 Benchmark]: Boogie Preprocessor took 38.46 ms. Allocated memory is still 201.3 MB. Free memory was 150.9 MB in the beginning and 148.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:56:16,751 INFO L168 Benchmark]: RCFGBuilder took 759.38 ms. Allocated memory is still 201.3 MB. Free memory was 148.0 MB in the beginning and 104.0 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:56:16,752 INFO L168 Benchmark]: TraceAbstraction took 12010.40 ms. Allocated memory was 201.3 MB in the beginning and 629.7 MB in the end (delta: 428.3 MB). Free memory was 103.3 MB in the beginning and 282.6 MB in the end (delta: -179.3 MB). Peak memory consumption was 249.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:56:16,764 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.15 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 815.32 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 99.7 MB in the beginning and 153.0 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.72 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 150.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.46 ms. Allocated memory is still 201.3 MB. Free memory was 150.9 MB in the beginning and 148.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 759.38 ms. Allocated memory is still 201.3 MB. Free memory was 148.0 MB in the beginning and 104.0 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12010.40 ms. Allocated memory was 201.3 MB in the beginning and 629.7 MB in the end (delta: 428.3 MB). Free memory was 103.3 MB in the beginning and 282.6 MB in the end (delta: -179.3 MB). Peak memory consumption was 249.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 156 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 85 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 19 ChoiceCompositions, 4625 VarBasedMoverChecksPositive, 127 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51271 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t870, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t871, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] FCALL, FORK 0 pthread_create(&t872, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L794] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L795] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L796] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = (_Bool)1 [L800] 3 a = 1 [L803] 3 __unbuffered_p2_EAX = a [L806] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 147 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1506 SDtfs, 1304 SDslu, 2479 SDs, 0 SdLazy, 986 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14534occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 2144 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 36148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...