/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:54:08,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:54:08,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:54:08,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:54:08,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:54:08,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:54:08,629 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:54:08,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:54:08,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:54:08,642 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:54:08,643 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:54:08,644 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:54:08,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:54:08,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:54:08,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:54:08,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:54:08,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:54:08,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:54:08,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:54:08,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:54:08,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:54:08,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:54:08,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:54:08,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:54:08,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:54:08,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:54:08,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:54:08,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:54:08,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:54:08,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:54:08,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:54:08,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:54:08,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:54:08,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:54:08,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:54:08,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:54:08,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:54:08,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:54:08,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:54:08,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:54:08,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:54:08,695 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:54:08,735 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:54:08,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:54:08,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:54:08,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:54:08,738 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:54:08,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:54:08,738 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:54:08,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:54:08,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:54:08,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:54:08,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:54:08,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:54:08,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:54:08,741 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:54:08,741 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:54:08,741 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:54:08,741 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:54:08,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:54:08,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:54:08,742 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:54:08,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:54:08,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:54:08,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:54:08,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:54:08,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:54:08,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:54:08,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:54:08,744 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:54:08,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:54:08,744 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:54:09,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:54:09,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:54:09,039 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:54:09,040 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:54:09,040 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:54:09,041 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i [2019-12-27 06:54:09,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f16aba3b2/ed12b88aa2db4c9ba46841b5b9e81098/FLAG92ba9f476 [2019-12-27 06:54:09,635 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:54:09,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i [2019-12-27 06:54:09,667 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f16aba3b2/ed12b88aa2db4c9ba46841b5b9e81098/FLAG92ba9f476 [2019-12-27 06:54:09,972 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f16aba3b2/ed12b88aa2db4c9ba46841b5b9e81098 [2019-12-27 06:54:09,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:54:09,983 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:54:09,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:54:09,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:54:09,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:54:09,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:54:09" (1/1) ... [2019-12-27 06:54:09,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74df8f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:09, skipping insertion in model container [2019-12-27 06:54:09,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:54:09" (1/1) ... [2019-12-27 06:54:09,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:54:10,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:54:10,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:54:10,598 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:54:10,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:54:10,746 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:54:10,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:10 WrapperNode [2019-12-27 06:54:10,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:54:10,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:54:10,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:54:10,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:54:10,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:10" (1/1) ... [2019-12-27 06:54:10,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:10" (1/1) ... [2019-12-27 06:54:10,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:54:10,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:54:10,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:54:10,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:54:10,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:10" (1/1) ... [2019-12-27 06:54:10,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:10" (1/1) ... [2019-12-27 06:54:10,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:10" (1/1) ... [2019-12-27 06:54:10,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:10" (1/1) ... [2019-12-27 06:54:10,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:10" (1/1) ... [2019-12-27 06:54:10,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:10" (1/1) ... [2019-12-27 06:54:10,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:10" (1/1) ... [2019-12-27 06:54:10,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:54:10,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:54:10,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:54:10,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:54:10,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:10" (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 06:54:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:54:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:54:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:54:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:54:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:54:10,930 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:54:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:54:10,930 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:54:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:54:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:54:10,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:54:10,932 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 06:54:11,666 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:54:11,667 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:54:11,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:54:11 BoogieIcfgContainer [2019-12-27 06:54:11,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:54:11,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:54:11,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:54:11,674 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:54:11,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:54:09" (1/3) ... [2019-12-27 06:54:11,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ec7f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:54:11, skipping insertion in model container [2019-12-27 06:54:11,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:10" (2/3) ... [2019-12-27 06:54:11,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ec7f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:54:11, skipping insertion in model container [2019-12-27 06:54:11,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:54:11" (3/3) ... [2019-12-27 06:54:11,678 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_tso.opt.i [2019-12-27 06:54:11,690 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:54:11,691 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:54:11,700 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:54:11,701 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:54:11,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,744 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,745 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,755 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,755 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,755 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,756 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,756 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,778 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,779 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,782 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,782 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,782 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:11,801 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 06:54:11,822 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:54:11,822 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:54:11,822 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:54:11,823 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:54:11,823 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:54:11,823 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:54:11,823 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:54:11,823 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:54:11,841 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 06:54:11,843 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 06:54:11,962 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 06:54:11,963 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:54:11,976 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:54:11,994 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 06:54:12,052 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 06:54:12,053 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:54:12,061 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:54:12,078 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 06:54:12,079 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:54:14,932 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 06:54:15,053 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48801 [2019-12-27 06:54:15,053 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 06:54:15,057 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 93 transitions [2019-12-27 06:54:15,582 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9180 states. [2019-12-27 06:54:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states. [2019-12-27 06:54:15,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 06:54:15,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:15,593 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 06:54:15,594 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:15,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:15,600 INFO L82 PathProgramCache]: Analyzing trace with hash 690083796, now seen corresponding path program 1 times [2019-12-27 06:54:15,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:15,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971249615] [2019-12-27 06:54:15,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:15,846 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 06:54:15,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971249615] [2019-12-27 06:54:15,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:15,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:54:15,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483437638] [2019-12-27 06:54:15,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:15,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:15,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:15,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:15,873 INFO L87 Difference]: Start difference. First operand 9180 states. Second operand 3 states. [2019-12-27 06:54:16,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:16,189 INFO L93 Difference]: Finished difference Result 9108 states and 29960 transitions. [2019-12-27 06:54:16,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:16,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 06:54:16,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:16,316 INFO L225 Difference]: With dead ends: 9108 [2019-12-27 06:54:16,316 INFO L226 Difference]: Without dead ends: 8926 [2019-12-27 06:54:16,317 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 06:54:16,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8926 states. [2019-12-27 06:54:16,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8926 to 8926. [2019-12-27 06:54:16,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8926 states. [2019-12-27 06:54:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8926 states to 8926 states and 29401 transitions. [2019-12-27 06:54:16,777 INFO L78 Accepts]: Start accepts. Automaton has 8926 states and 29401 transitions. Word has length 5 [2019-12-27 06:54:16,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:16,778 INFO L462 AbstractCegarLoop]: Abstraction has 8926 states and 29401 transitions. [2019-12-27 06:54:16,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 8926 states and 29401 transitions. [2019-12-27 06:54:16,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:54:16,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:16,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:16,781 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:16,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:16,782 INFO L82 PathProgramCache]: Analyzing trace with hash 741678959, now seen corresponding path program 1 times [2019-12-27 06:54:16,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:16,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196744463] [2019-12-27 06:54:16,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:16,832 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 06:54:16,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196744463] [2019-12-27 06:54:16,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:16,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:16,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469869838] [2019-12-27 06:54:16,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:16,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:16,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:16,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:16,836 INFO L87 Difference]: Start difference. First operand 8926 states and 29401 transitions. Second operand 3 states. [2019-12-27 06:54:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:16,872 INFO L93 Difference]: Finished difference Result 1402 states and 3230 transitions. [2019-12-27 06:54:16,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:16,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 06:54:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:16,882 INFO L225 Difference]: With dead ends: 1402 [2019-12-27 06:54:16,882 INFO L226 Difference]: Without dead ends: 1402 [2019-12-27 06:54:16,883 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 06:54:16,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-12-27 06:54:16,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2019-12-27 06:54:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-12-27 06:54:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 3230 transitions. [2019-12-27 06:54:16,920 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 3230 transitions. Word has length 11 [2019-12-27 06:54:16,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:16,921 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 3230 transitions. [2019-12-27 06:54:16,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 3230 transitions. [2019-12-27 06:54:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:54:16,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:16,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:16,924 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:16,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:16,924 INFO L82 PathProgramCache]: Analyzing trace with hash 520956806, now seen corresponding path program 1 times [2019-12-27 06:54:16,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:16,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129270052] [2019-12-27 06:54:16,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:17,150 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 06:54:17,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129270052] [2019-12-27 06:54:17,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:17,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:17,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970658977] [2019-12-27 06:54:17,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:54:17,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:17,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:54:17,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:54:17,153 INFO L87 Difference]: Start difference. First operand 1402 states and 3230 transitions. Second operand 4 states. [2019-12-27 06:54:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:17,456 INFO L93 Difference]: Finished difference Result 1878 states and 4185 transitions. [2019-12-27 06:54:17,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:54:17,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:54:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:17,467 INFO L225 Difference]: With dead ends: 1878 [2019-12-27 06:54:17,467 INFO L226 Difference]: Without dead ends: 1878 [2019-12-27 06:54:17,468 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 06:54:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2019-12-27 06:54:17,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1726. [2019-12-27 06:54:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-12-27 06:54:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 3896 transitions. [2019-12-27 06:54:17,514 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 3896 transitions. Word has length 11 [2019-12-27 06:54:17,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:17,514 INFO L462 AbstractCegarLoop]: Abstraction has 1726 states and 3896 transitions. [2019-12-27 06:54:17,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:54:17,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 3896 transitions. [2019-12-27 06:54:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 06:54:17,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:17,518 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] [2019-12-27 06:54:17,518 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:17,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:17,519 INFO L82 PathProgramCache]: Analyzing trace with hash -707662606, now seen corresponding path program 1 times [2019-12-27 06:54:17,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:17,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26441030] [2019-12-27 06:54:17,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:17,593 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 06:54:17,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26441030] [2019-12-27 06:54:17,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:17,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:54:17,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745162809] [2019-12-27 06:54:17,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:54:17,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:17,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:54:17,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:54:17,595 INFO L87 Difference]: Start difference. First operand 1726 states and 3896 transitions. Second operand 4 states. [2019-12-27 06:54:17,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:17,623 INFO L93 Difference]: Finished difference Result 357 states and 661 transitions. [2019-12-27 06:54:17,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:54:17,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 06:54:17,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:17,627 INFO L225 Difference]: With dead ends: 357 [2019-12-27 06:54:17,627 INFO L226 Difference]: Without dead ends: 357 [2019-12-27 06:54:17,628 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 06:54:17,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-27 06:54:17,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 322. [2019-12-27 06:54:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-27 06:54:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 596 transitions. [2019-12-27 06:54:17,636 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 596 transitions. Word has length 23 [2019-12-27 06:54:17,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:17,636 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 596 transitions. [2019-12-27 06:54:17,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:54:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 596 transitions. [2019-12-27 06:54:17,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:54:17,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:17,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:17,639 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:17,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:17,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1936914374, now seen corresponding path program 1 times [2019-12-27 06:54:17,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:17,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387275182] [2019-12-27 06:54:17,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:17,745 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 06:54:17,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387275182] [2019-12-27 06:54:17,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:17,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:54:17,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831289368] [2019-12-27 06:54:17,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:17,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:17,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:17,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:17,747 INFO L87 Difference]: Start difference. First operand 322 states and 596 transitions. Second operand 3 states. [2019-12-27 06:54:17,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:17,824 INFO L93 Difference]: Finished difference Result 332 states and 611 transitions. [2019-12-27 06:54:17,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:17,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 06:54:17,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:17,827 INFO L225 Difference]: With dead ends: 332 [2019-12-27 06:54:17,827 INFO L226 Difference]: Without dead ends: 332 [2019-12-27 06:54:17,828 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 06:54:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-27 06:54:17,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-12-27 06:54:17,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 06:54:17,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 607 transitions. [2019-12-27 06:54:17,835 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 607 transitions. Word has length 52 [2019-12-27 06:54:17,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:17,839 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 607 transitions. [2019-12-27 06:54:17,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:17,840 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 607 transitions. [2019-12-27 06:54:17,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:54:17,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:17,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:17,843 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:17,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:17,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1506335965, now seen corresponding path program 1 times [2019-12-27 06:54:17,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:17,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677858597] [2019-12-27 06:54:17,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:18,019 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 06:54:18,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677858597] [2019-12-27 06:54:18,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:18,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:54:18,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149624800] [2019-12-27 06:54:18,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:54:18,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:18,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:54:18,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:54:18,022 INFO L87 Difference]: Start difference. First operand 328 states and 607 transitions. Second operand 5 states. [2019-12-27 06:54:18,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:18,236 INFO L93 Difference]: Finished difference Result 459 states and 843 transitions. [2019-12-27 06:54:18,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:54:18,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 06:54:18,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:18,243 INFO L225 Difference]: With dead ends: 459 [2019-12-27 06:54:18,244 INFO L226 Difference]: Without dead ends: 459 [2019-12-27 06:54:18,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:54:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-27 06:54:18,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 375. [2019-12-27 06:54:18,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-12-27 06:54:18,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 698 transitions. [2019-12-27 06:54:18,253 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 698 transitions. Word has length 52 [2019-12-27 06:54:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:18,253 INFO L462 AbstractCegarLoop]: Abstraction has 375 states and 698 transitions. [2019-12-27 06:54:18,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:54:18,253 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 698 transitions. [2019-12-27 06:54:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:54:18,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:18,255 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:18,255 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:18,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:18,255 INFO L82 PathProgramCache]: Analyzing trace with hash -788706827, now seen corresponding path program 2 times [2019-12-27 06:54:18,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:18,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921066160] [2019-12-27 06:54:18,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:18,417 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 06:54:18,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921066160] [2019-12-27 06:54:18,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:18,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:18,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238494506] [2019-12-27 06:54:18,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:18,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:18,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:18,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:18,420 INFO L87 Difference]: Start difference. First operand 375 states and 698 transitions. Second operand 3 states. [2019-12-27 06:54:18,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:18,437 INFO L93 Difference]: Finished difference Result 375 states and 683 transitions. [2019-12-27 06:54:18,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:18,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 06:54:18,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:18,441 INFO L225 Difference]: With dead ends: 375 [2019-12-27 06:54:18,441 INFO L226 Difference]: Without dead ends: 375 [2019-12-27 06:54:18,442 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 06:54:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-12-27 06:54:18,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 363. [2019-12-27 06:54:18,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-27 06:54:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 661 transitions. [2019-12-27 06:54:18,450 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 661 transitions. Word has length 52 [2019-12-27 06:54:18,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:18,450 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 661 transitions. [2019-12-27 06:54:18,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:18,450 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 661 transitions. [2019-12-27 06:54:18,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:54:18,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:18,452 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:18,452 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:18,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:18,452 INFO L82 PathProgramCache]: Analyzing trace with hash -817414714, now seen corresponding path program 1 times [2019-12-27 06:54:18,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:18,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852074888] [2019-12-27 06:54:18,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:18,547 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 06:54:18,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852074888] [2019-12-27 06:54:18,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:18,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:18,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200822503] [2019-12-27 06:54:18,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:18,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:18,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:18,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:18,551 INFO L87 Difference]: Start difference. First operand 363 states and 661 transitions. Second operand 3 states. [2019-12-27 06:54:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:18,601 INFO L93 Difference]: Finished difference Result 363 states and 660 transitions. [2019-12-27 06:54:18,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:18,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 06:54:18,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:18,604 INFO L225 Difference]: With dead ends: 363 [2019-12-27 06:54:18,605 INFO L226 Difference]: Without dead ends: 363 [2019-12-27 06:54:18,605 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 06:54:18,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-27 06:54:18,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 274. [2019-12-27 06:54:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-12-27 06:54:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 499 transitions. [2019-12-27 06:54:18,612 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 499 transitions. Word has length 53 [2019-12-27 06:54:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:18,613 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 499 transitions. [2019-12-27 06:54:18,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 499 transitions. [2019-12-27 06:54:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:54:18,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:18,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:18,615 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:18,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:18,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1599315070, now seen corresponding path program 1 times [2019-12-27 06:54:18,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:18,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362119936] [2019-12-27 06:54:18,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:18,884 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 06:54:18,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362119936] [2019-12-27 06:54:18,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:18,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:54:18,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907263440] [2019-12-27 06:54:18,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:54:18,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:18,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:54:18,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:54:18,887 INFO L87 Difference]: Start difference. First operand 274 states and 499 transitions. Second operand 10 states. [2019-12-27 06:54:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:19,151 INFO L93 Difference]: Finished difference Result 500 states and 907 transitions. [2019-12-27 06:54:19,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:54:19,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 06:54:19,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:19,154 INFO L225 Difference]: With dead ends: 500 [2019-12-27 06:54:19,155 INFO L226 Difference]: Without dead ends: 234 [2019-12-27 06:54:19,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-27 06:54:19,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-12-27 06:54:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 210. [2019-12-27 06:54:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-27 06:54:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 372 transitions. [2019-12-27 06:54:19,161 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 372 transitions. Word has length 54 [2019-12-27 06:54:19,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:19,162 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 372 transitions. [2019-12-27 06:54:19,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:54:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 372 transitions. [2019-12-27 06:54:19,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:54:19,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:19,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:19,163 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:19,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:19,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1986508478, now seen corresponding path program 2 times [2019-12-27 06:54:19,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:19,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368699694] [2019-12-27 06:54:19,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:19,514 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 06:54:19,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368699694] [2019-12-27 06:54:19,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:19,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 06:54:19,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450327371] [2019-12-27 06:54:19,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 06:54:19,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:19,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 06:54:19,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:54:19,517 INFO L87 Difference]: Start difference. First operand 210 states and 372 transitions. Second operand 13 states. [2019-12-27 06:54:19,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:19,955 INFO L93 Difference]: Finished difference Result 374 states and 646 transitions. [2019-12-27 06:54:19,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 06:54:19,956 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 06:54:19,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:19,958 INFO L225 Difference]: With dead ends: 374 [2019-12-27 06:54:19,958 INFO L226 Difference]: Without dead ends: 340 [2019-12-27 06:54:19,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2019-12-27 06:54:19,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-12-27 06:54:19,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 318. [2019-12-27 06:54:19,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-12-27 06:54:19,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 557 transitions. [2019-12-27 06:54:19,966 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 557 transitions. Word has length 54 [2019-12-27 06:54:19,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:19,966 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 557 transitions. [2019-12-27 06:54:19,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 06:54:19,966 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 557 transitions. [2019-12-27 06:54:19,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:54:19,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:19,967 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:19,968 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:19,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:19,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2083989660, now seen corresponding path program 3 times [2019-12-27 06:54:19,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:19,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314805302] [2019-12-27 06:54:19,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:20,308 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 06:54:20,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314805302] [2019-12-27 06:54:20,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:20,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 06:54:20,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321683552] [2019-12-27 06:54:20,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 06:54:20,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:20,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 06:54:20,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:54:20,310 INFO L87 Difference]: Start difference. First operand 318 states and 557 transitions. Second operand 13 states. [2019-12-27 06:54:20,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:20,854 INFO L93 Difference]: Finished difference Result 422 states and 718 transitions. [2019-12-27 06:54:20,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 06:54:20,855 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 06:54:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:20,858 INFO L225 Difference]: With dead ends: 422 [2019-12-27 06:54:20,858 INFO L226 Difference]: Without dead ends: 388 [2019-12-27 06:54:20,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:54:20,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-12-27 06:54:20,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 318. [2019-12-27 06:54:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-12-27 06:54:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 557 transitions. [2019-12-27 06:54:20,865 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 557 transitions. Word has length 54 [2019-12-27 06:54:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:20,866 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 557 transitions. [2019-12-27 06:54:20,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 06:54:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 557 transitions. [2019-12-27 06:54:20,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:54:20,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:20,867 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:20,867 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:20,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:20,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1497243502, now seen corresponding path program 4 times [2019-12-27 06:54:20,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:20,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603858891] [2019-12-27 06:54:20,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:54:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:54:20,969 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:54:20,969 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:54:20,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= v_~x$r_buff1_thd1~0_19 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~x$w_buff1~0_25) (= v_~main$tmp_guard1~0_11 0) (= v_~x~0_27 0) (= v_~x$flush_delayed~0_16 0) (= 0 v_~x$w_buff0_used~0_104) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= |v_ULTIMATE.start_main_~#t1455~0.offset_17| 0) (= 0 v_~weak$$choice2~0_33) (= v_~x$w_buff1_used~0_65 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1455~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1455~0.base_22|) |v_ULTIMATE.start_main_~#t1455~0.offset_17| 0)) |v_#memory_int_13|) (= v_~x$r_buff1_thd0~0_48 0) (= 0 v_~x$r_buff0_thd0~0_76) (= (store .cse0 |v_ULTIMATE.start_main_~#t1455~0.base_22| 1) |v_#valid_47|) (= v_~x$r_buff1_thd2~0_16 0) (= 0 v_~y~0_8) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff0_thd2~0_25) (= v_~x$mem_tmp~0_11 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1455~0.base_22| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1455~0.base_22|) (= 0 v_~weak$$choice0~0_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1455~0.base_22|) 0) (= 0 v_~x$w_buff0~0_28) (= 0 v_~__unbuffered_cnt~0_16) (= 0 v_~x$r_buff0_thd1~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ULTIMATE.start_main_~#t1455~0.base=|v_ULTIMATE.start_main_~#t1455~0.base_22|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_9|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, #length=|v_#length_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_7|, ~x$w_buff1~0=v_~x$w_buff1~0_25, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ULTIMATE.start_main_~#t1456~0.offset=|v_ULTIMATE.start_main_~#t1456~0.offset_14|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~x~0=v_~x~0_27, ULTIMATE.start_main_~#t1455~0.offset=|v_ULTIMATE.start_main_~#t1455~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_~#t1456~0.base=|v_ULTIMATE.start_main_~#t1456~0.base_17|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y~0=v_~y~0_8, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_48, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1455~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1456~0.offset, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1455~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1456~0.base, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 06:54:20,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L779-1-->L781: Formula: (and (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1456~0.base_10| 1) |v_#valid_25|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1456~0.base_10| 4) |v_#length_9|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1456~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1456~0.base_10|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1456~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1456~0.base_10|) |v_ULTIMATE.start_main_~#t1456~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t1456~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1456~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1456~0.base=|v_ULTIMATE.start_main_~#t1456~0.base_10|, ULTIMATE.start_main_~#t1456~0.offset=|v_ULTIMATE.start_main_~#t1456~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1456~0.base, ULTIMATE.start_main_~#t1456~0.offset] because there is no mapped edge [2019-12-27 06:54:20,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_18) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= 0 (mod v_~x$w_buff1_used~0_57 256)) (= 1 v_~x$w_buff0_used~0_88) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff1_used~0_57 v_~x$w_buff0_used~0_89) (= 2 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_89} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_18, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_57, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 06:54:20,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L728-2-->L728-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out123249758| |P0Thread1of1ForFork0_#t~ite4_Out123249758|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In123249758 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In123249758 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out123249758| ~x$w_buff1~0_In123249758)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out123249758| ~x~0_In123249758) .cse0 (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In123249758, ~x$w_buff1_used~0=~x$w_buff1_used~0_In123249758, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In123249758, ~x~0=~x~0_In123249758} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out123249758|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out123249758|, ~x$w_buff1~0=~x$w_buff1~0_In123249758, ~x$w_buff1_used~0=~x$w_buff1_used~0_In123249758, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In123249758, ~x~0=~x~0_In123249758} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 06:54:20,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L729-->L729-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In275593152 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In275593152 256) 0))) (or (and (= ~x$w_buff0_used~0_In275593152 |P0Thread1of1ForFork0_#t~ite5_Out275593152|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out275593152|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In275593152, ~x$w_buff0_used~0=~x$w_buff0_used~0_In275593152} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out275593152|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In275593152, ~x$w_buff0_used~0=~x$w_buff0_used~0_In275593152} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:54:20,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L730-->L730-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In638530717 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In638530717 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In638530717 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In638530717 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out638530717| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out638530717| ~x$w_buff1_used~0_In638530717)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In638530717, ~x$w_buff1_used~0=~x$w_buff1_used~0_In638530717, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In638530717, ~x$w_buff0_used~0=~x$w_buff0_used~0_In638530717} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out638530717|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In638530717, ~x$w_buff1_used~0=~x$w_buff1_used~0_In638530717, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In638530717, ~x$w_buff0_used~0=~x$w_buff0_used~0_In638530717} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:54:20,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In406956943 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In406956943 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out406956943| 0)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out406956943| ~x$w_buff0_used~0_In406956943) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In406956943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In406956943} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out406956943|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In406956943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In406956943} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 06:54:20,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L731-->L731-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1704822040 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1704822040 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out1704822040| ~x$r_buff0_thd1~0_In1704822040) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out1704822040| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1704822040, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1704822040} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1704822040, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1704822040|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1704822040} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 06:54:20,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L732-->L732-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In901316987 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In901316987 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In901316987 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In901316987 256) 0))) (or (and (= ~x$r_buff1_thd1~0_In901316987 |P0Thread1of1ForFork0_#t~ite8_Out901316987|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out901316987|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In901316987, ~x$w_buff1_used~0=~x$w_buff1_used~0_In901316987, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In901316987, ~x$w_buff0_used~0=~x$w_buff0_used~0_In901316987} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In901316987, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out901316987|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In901316987, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In901316987, ~x$w_buff0_used~0=~x$w_buff0_used~0_In901316987} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:54:20,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L732-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 06:54:20,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1501832938 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1501832938 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1501832938 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1501832938 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1501832938|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1501832938 |P1Thread1of1ForFork1_#t~ite12_Out-1501832938|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1501832938, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1501832938, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1501832938, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1501832938} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1501832938, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1501832938, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1501832938|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1501832938, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1501832938} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:54:20,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L759-->L760: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1146823276 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1146823276 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In1146823276 ~x$r_buff0_thd2~0_Out1146823276) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out1146823276)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1146823276, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1146823276} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1146823276|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1146823276, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1146823276} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 06:54:20,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In-1535573481 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1535573481 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1535573481 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1535573481 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1535573481 |P1Thread1of1ForFork1_#t~ite14_Out-1535573481|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1535573481|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1535573481, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1535573481, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1535573481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1535573481} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1535573481, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1535573481, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1535573481, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1535573481|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1535573481} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 06:54:20,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:54:20,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [586] [586] L781-1-->L787: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:54:20,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L787-2-->L787-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite18_Out532062056| |ULTIMATE.start_main_#t~ite17_Out532062056|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In532062056 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In532062056 256) 0))) (or (and .cse0 (= ~x$w_buff1~0_In532062056 |ULTIMATE.start_main_#t~ite17_Out532062056|) (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= |ULTIMATE.start_main_#t~ite17_Out532062056| ~x~0_In532062056)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In532062056, ~x$w_buff1_used~0=~x$w_buff1_used~0_In532062056, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In532062056, ~x~0=~x~0_In532062056} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out532062056|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out532062056|, ~x$w_buff1~0=~x$w_buff1~0_In532062056, ~x$w_buff1_used~0=~x$w_buff1_used~0_In532062056, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In532062056, ~x~0=~x~0_In532062056} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 06:54:20,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1953267218 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1953267218 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-1953267218| 0)) (and (= |ULTIMATE.start_main_#t~ite19_Out-1953267218| ~x$w_buff0_used~0_In-1953267218) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1953267218, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1953267218} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1953267218, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1953267218|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1953267218} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 06:54:20,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-325875557 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-325875557 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-325875557 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-325875557 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-325875557| ~x$w_buff1_used~0_In-325875557) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite20_Out-325875557| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-325875557, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-325875557, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-325875557, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-325875557} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-325875557, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-325875557, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-325875557|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-325875557, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-325875557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:54:20,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1896915338 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1896915338 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1896915338| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out-1896915338| ~x$r_buff0_thd0~0_In-1896915338)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1896915338, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1896915338} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1896915338, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1896915338|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1896915338} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:54:20,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L791-->L791-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In612247587 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In612247587 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In612247587 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In612247587 256) 0))) (or (and (= ~x$r_buff1_thd0~0_In612247587 |ULTIMATE.start_main_#t~ite22_Out612247587|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite22_Out612247587|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In612247587, ~x$w_buff1_used~0=~x$w_buff1_used~0_In612247587, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In612247587, ~x$w_buff0_used~0=~x$w_buff0_used~0_In612247587} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In612247587, ~x$w_buff1_used~0=~x$w_buff1_used~0_In612247587, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In612247587, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out612247587|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In612247587} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:54:20,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L800-->L800-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In957112704 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In957112704 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In957112704 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In957112704 256)) (and (= (mod ~x$r_buff1_thd0~0_In957112704 256) 0) .cse1))) (= ~x$w_buff1~0_In957112704 |ULTIMATE.start_main_#t~ite31_Out957112704|) (= |ULTIMATE.start_main_#t~ite32_Out957112704| |ULTIMATE.start_main_#t~ite31_Out957112704|)) (and (= |ULTIMATE.start_main_#t~ite31_In957112704| |ULTIMATE.start_main_#t~ite31_Out957112704|) (not .cse0) (= ~x$w_buff1~0_In957112704 |ULTIMATE.start_main_#t~ite32_Out957112704|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In957112704, ~x$w_buff1~0=~x$w_buff1~0_In957112704, ~x$w_buff1_used~0=~x$w_buff1_used~0_In957112704, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In957112704, ~weak$$choice2~0=~weak$$choice2~0_In957112704, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In957112704|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In957112704} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In957112704, ~x$w_buff1~0=~x$w_buff1~0_In957112704, ~x$w_buff1_used~0=~x$w_buff1_used~0_In957112704, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out957112704|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In957112704, ~weak$$choice2~0=~weak$$choice2~0_In957112704, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out957112704|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In957112704} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 06:54:20,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L803-->L804: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd0~0_65 v_~x$r_buff0_thd0~0_64)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_9|, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:54:20,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L806-->L809-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~x$mem_tmp~0_7 v_~x~0_22) (= v_~x$flush_delayed~0_10 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:54:20,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:54:21,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:54:21 BasicIcfg [2019-12-27 06:54:21,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:54:21,081 INFO L168 Benchmark]: Toolchain (without parser) took 11097.35 ms. Allocated memory was 145.2 MB in the beginning and 391.1 MB in the end (delta: 245.9 MB). Free memory was 101.4 MB in the beginning and 176.8 MB in the end (delta: -75.4 MB). Peak memory consumption was 170.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:21,084 INFO L168 Benchmark]: CDTParser took 1.47 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 06:54:21,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.43 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.9 MB in the beginning and 157.2 MB in the end (delta: -56.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:21,085 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.81 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 154.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:21,090 INFO L168 Benchmark]: Boogie Preprocessor took 38.06 ms. Allocated memory is still 202.9 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:21,091 INFO L168 Benchmark]: RCFGBuilder took 814.28 ms. Allocated memory is still 202.9 MB. Free memory was 151.8 MB in the beginning and 107.9 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:21,092 INFO L168 Benchmark]: TraceAbstraction took 9408.79 ms. Allocated memory was 202.9 MB in the beginning and 391.1 MB in the end (delta: 188.2 MB). Free memory was 107.3 MB in the beginning and 176.8 MB in the end (delta: -69.5 MB). Peak memory consumption was 118.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:21,099 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.47 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.43 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.9 MB in the beginning and 157.2 MB in the end (delta: -56.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.81 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 154.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.06 ms. Allocated memory is still 202.9 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 814.28 ms. Allocated memory is still 202.9 MB. Free memory was 151.8 MB in the beginning and 107.9 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9408.79 ms. Allocated memory was 202.9 MB in the beginning and 391.1 MB in the end (delta: 188.2 MB). Free memory was 107.3 MB in the beginning and 176.8 MB in the end (delta: -69.5 MB). Peak memory consumption was 118.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 146 ProgramPointsBefore, 80 ProgramPointsAfterwards, 180 TransitionsBefore, 93 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 24 ChoiceCompositions, 3674 VarBasedMoverChecksPositive, 148 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48801 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t1455, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] FCALL, FORK 0 pthread_create(&t1456, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L748] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L749] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L750] 2 x$r_buff0_thd2 = (_Bool)1 [L753] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 1 y = 1 [L725] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L731] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 x$flush_delayed = weak$$choice2 [L797] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.1s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1074 SDtfs, 996 SDslu, 2695 SDs, 0 SdLazy, 1237 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9180occurred 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: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 492 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 475 NumberOfCodeBlocks, 475 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 410 ConstructedInterpolants, 0 QuantifiedInterpolants, 79407 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...