/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix048_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:43:22,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:43:22,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:43:22,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:43:22,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:43:22,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:43:22,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:43:22,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:43:22,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:43:22,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:43:22,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:43:22,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:43:22,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:43:22,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:43:22,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:43:22,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:43:22,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:43:22,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:43:22,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:43:22,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:43:22,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:43:22,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:43:22,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:43:22,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:43:22,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:43:22,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:43:22,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:43:22,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:43:22,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:43:22,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:43:22,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:43:22,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:43:22,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:43:22,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:43:22,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:43:22,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:43:22,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:43:22,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:43:22,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:43:22,719 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:43:22,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:43:22,721 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:43:22,740 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:43:22,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:43:22,742 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:43:22,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:43:22,742 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:43:22,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:43:22,743 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:43:22,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:43:22,743 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:43:22,743 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:43:22,744 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:43:22,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:43:22,745 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:43:22,745 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:43:22,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:43:22,746 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:43:22,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:43:22,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:43:22,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:43:22,747 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:43:22,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:43:22,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:43:22,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:43:22,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:43:22,747 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:43:22,748 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:43:22,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:43:22,748 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:43:22,748 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:43:22,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:43:23,032 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:43:23,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:43:23,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:43:23,051 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:43:23,052 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:43:23,053 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_rmo.oepc.i [2019-12-18 13:43:23,121 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4d7d856/befb697c40354fd7933c71ed3a1f3b8d/FLAG793ed38cc [2019-12-18 13:43:23,690 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:43:23,690 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_rmo.oepc.i [2019-12-18 13:43:23,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4d7d856/befb697c40354fd7933c71ed3a1f3b8d/FLAG793ed38cc [2019-12-18 13:43:23,965 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4d7d856/befb697c40354fd7933c71ed3a1f3b8d [2019-12-18 13:43:23,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:43:23,976 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:43:23,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:43:23,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:43:23,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:43:23,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:43:23" (1/1) ... [2019-12-18 13:43:23,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79236124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:23, skipping insertion in model container [2019-12-18 13:43:23,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:43:23" (1/1) ... [2019-12-18 13:43:23,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:43:24,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:43:24,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:43:24,542 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:43:24,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:43:24,719 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:43:24,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:24 WrapperNode [2019-12-18 13:43:24,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:43:24,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:43:24,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:43:24,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:43:24,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:24" (1/1) ... [2019-12-18 13:43:24,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:24" (1/1) ... [2019-12-18 13:43:24,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:43:24,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:43:24,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:43:24,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:43:24,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:24" (1/1) ... [2019-12-18 13:43:24,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:24" (1/1) ... [2019-12-18 13:43:24,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:24" (1/1) ... [2019-12-18 13:43:24,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:24" (1/1) ... [2019-12-18 13:43:24,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:24" (1/1) ... [2019-12-18 13:43:24,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:24" (1/1) ... [2019-12-18 13:43:24,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:24" (1/1) ... [2019-12-18 13:43:24,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:43:24,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:43:24,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:43:24,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:43:24,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:43:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:43:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:43:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:43:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:43:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:43:24,900 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:43:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:43:24,900 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:43:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:43:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:43:24,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:43:24,903 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:43:25,572 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:43:25,572 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:43:25,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:43:25 BoogieIcfgContainer [2019-12-18 13:43:25,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:43:25,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:43:25,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:43:25,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:43:25,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:43:23" (1/3) ... [2019-12-18 13:43:25,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d4d203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:43:25, skipping insertion in model container [2019-12-18 13:43:25,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:24" (2/3) ... [2019-12-18 13:43:25,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d4d203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:43:25, skipping insertion in model container [2019-12-18 13:43:25,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:43:25" (3/3) ... [2019-12-18 13:43:25,583 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_rmo.oepc.i [2019-12-18 13:43:25,594 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:43:25,595 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:43:25,603 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:43:25,604 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:43:25,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,645 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,645 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,645 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,646 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,646 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,657 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,657 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,714 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,714 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,715 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,724 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,726 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:25,742 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 13:43:25,759 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:43:25,759 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:43:25,760 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:43:25,760 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:43:25,760 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:43:25,760 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:43:25,760 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:43:25,760 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:43:25,778 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 13:43:25,780 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 13:43:25,857 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 13:43:25,858 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:43:25,874 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:43:25,896 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 13:43:25,939 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 13:43:25,939 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:43:25,952 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:43:25,966 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 13:43:25,968 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:43:30,737 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 13:43:30,843 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 13:43:30,938 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-18 13:43:30,939 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-18 13:43:30,942 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-18 13:43:31,973 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-18 13:43:31,976 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-18 13:43:31,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:43:31,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:31,984 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:43:31,984 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:31,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:31,991 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-18 13:43:32,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:32,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356628498] [2019-12-18 13:43:32,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:32,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:32,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356628498] [2019-12-18 13:43:32,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:32,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:43:32,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54189646] [2019-12-18 13:43:32,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:43:32,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:32,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:43:32,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:43:32,227 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-18 13:43:32,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:32,472 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-18 13:43:32,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:43:32,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:43:32,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:32,602 INFO L225 Difference]: With dead ends: 8074 [2019-12-18 13:43:32,602 INFO L226 Difference]: Without dead ends: 7606 [2019-12-18 13:43:32,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:43:32,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-18 13:43:33,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-18 13:43:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-18 13:43:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-18 13:43:33,093 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-18 13:43:33,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:33,094 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-18 13:43:33,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:43:33,094 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-18 13:43:33,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:43:33,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:33,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:43:33,098 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:33,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:33,099 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-18 13:43:33,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:33,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276787988] [2019-12-18 13:43:33,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:33,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276787988] [2019-12-18 13:43:33,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:33,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:43:33,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809451876] [2019-12-18 13:43:33,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:43:33,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:33,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:43:33,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:43:33,224 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-18 13:43:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:33,696 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-18 13:43:33,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:43:33,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:43:33,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:33,784 INFO L225 Difference]: With dead ends: 11630 [2019-12-18 13:43:33,784 INFO L226 Difference]: Without dead ends: 11623 [2019-12-18 13:43:33,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:43:33,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-18 13:43:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-18 13:43:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-18 13:43:34,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-18 13:43:34,819 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-18 13:43:34,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:34,819 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-18 13:43:34,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:43:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-18 13:43:34,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:43:34,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:34,826 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:43:34,826 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:34,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:34,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-18 13:43:34,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:34,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634188545] [2019-12-18 13:43:34,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:34,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:34,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634188545] [2019-12-18 13:43:34,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:34,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:43:34,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423548972] [2019-12-18 13:43:34,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:43:34,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:34,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:43:34,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:43:34,923 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-18 13:43:35,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:35,363 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-18 13:43:35,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:43:35,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 13:43:35,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:35,422 INFO L225 Difference]: With dead ends: 14471 [2019-12-18 13:43:35,422 INFO L226 Difference]: Without dead ends: 14471 [2019-12-18 13:43:35,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:43:35,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-18 13:43:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-18 13:43:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-18 13:43:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-18 13:43:35,959 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-18 13:43:35,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:35,960 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-18 13:43:35,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:43:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-18 13:43:35,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:43:35,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:35,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:43:35,965 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:35,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:35,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-18 13:43:35,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:35,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007416189] [2019-12-18 13:43:35,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:36,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007416189] [2019-12-18 13:43:36,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:36,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:43:36,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187178866] [2019-12-18 13:43:36,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:43:36,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:36,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:43:36,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:43:36,037 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-18 13:43:36,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:36,104 INFO L93 Difference]: Finished difference Result 10750 states and 33336 transitions. [2019-12-18 13:43:36,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:43:36,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 13:43:36,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:36,140 INFO L225 Difference]: With dead ends: 10750 [2019-12-18 13:43:36,140 INFO L226 Difference]: Without dead ends: 10750 [2019-12-18 13:43:36,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:43:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10750 states. [2019-12-18 13:43:36,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10750 to 10670. [2019-12-18 13:43:36,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10670 states. [2019-12-18 13:43:36,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10670 states to 10670 states and 33104 transitions. [2019-12-18 13:43:36,431 INFO L78 Accepts]: Start accepts. Automaton has 10670 states and 33104 transitions. Word has length 16 [2019-12-18 13:43:36,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:36,432 INFO L462 AbstractCegarLoop]: Abstraction has 10670 states and 33104 transitions. [2019-12-18 13:43:36,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:43:36,432 INFO L276 IsEmpty]: Start isEmpty. Operand 10670 states and 33104 transitions. [2019-12-18 13:43:36,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:43:36,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:36,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:43:36,435 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:36,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:36,436 INFO L82 PathProgramCache]: Analyzing trace with hash 2099964683, now seen corresponding path program 1 times [2019-12-18 13:43:36,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:36,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482900533] [2019-12-18 13:43:36,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:36,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482900533] [2019-12-18 13:43:36,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:36,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:43:36,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091026668] [2019-12-18 13:43:36,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:43:36,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:36,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:43:36,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:43:36,527 INFO L87 Difference]: Start difference. First operand 10670 states and 33104 transitions. Second operand 4 states. [2019-12-18 13:43:36,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:36,559 INFO L93 Difference]: Finished difference Result 2054 states and 5113 transitions. [2019-12-18 13:43:36,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:43:36,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:43:36,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:36,563 INFO L225 Difference]: With dead ends: 2054 [2019-12-18 13:43:36,564 INFO L226 Difference]: Without dead ends: 1457 [2019-12-18 13:43:36,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:43:36,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-12-18 13:43:36,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2019-12-18 13:43:36,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2019-12-18 13:43:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 3211 transitions. [2019-12-18 13:43:36,591 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 3211 transitions. Word has length 16 [2019-12-18 13:43:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:36,592 INFO L462 AbstractCegarLoop]: Abstraction has 1457 states and 3211 transitions. [2019-12-18 13:43:36,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:43:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 3211 transitions. [2019-12-18 13:43:36,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 13:43:36,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:36,594 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] [2019-12-18 13:43:36,594 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:36,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:36,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-18 13:43:36,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:36,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651055360] [2019-12-18 13:43:36,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:36,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:36,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651055360] [2019-12-18 13:43:36,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:36,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:43:36,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942216841] [2019-12-18 13:43:36,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:43:36,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:36,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:43:36,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:43:36,720 INFO L87 Difference]: Start difference. First operand 1457 states and 3211 transitions. Second operand 6 states. [2019-12-18 13:43:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:37,157 INFO L93 Difference]: Finished difference Result 2249 states and 4761 transitions. [2019-12-18 13:43:37,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:43:37,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 13:43:37,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:37,166 INFO L225 Difference]: With dead ends: 2249 [2019-12-18 13:43:37,167 INFO L226 Difference]: Without dead ends: 2197 [2019-12-18 13:43:37,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:43:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2019-12-18 13:43:37,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 1428. [2019-12-18 13:43:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-18 13:43:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 3147 transitions. [2019-12-18 13:43:37,200 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 3147 transitions. Word has length 24 [2019-12-18 13:43:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:37,200 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 3147 transitions. [2019-12-18 13:43:37,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:43:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 3147 transitions. [2019-12-18 13:43:37,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:43:37,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:37,203 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] [2019-12-18 13:43:37,204 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:37,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:37,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-12-18 13:43:37,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:37,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76655194] [2019-12-18 13:43:37,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:37,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76655194] [2019-12-18 13:43:37,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:37,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:43:37,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788241971] [2019-12-18 13:43:37,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:43:37,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:37,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:43:37,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:43:37,301 INFO L87 Difference]: Start difference. First operand 1428 states and 3147 transitions. Second operand 5 states. [2019-12-18 13:43:37,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:37,346 INFO L93 Difference]: Finished difference Result 752 states and 1639 transitions. [2019-12-18 13:43:37,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:43:37,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 13:43:37,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:37,349 INFO L225 Difference]: With dead ends: 752 [2019-12-18 13:43:37,349 INFO L226 Difference]: Without dead ends: 689 [2019-12-18 13:43:37,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:43:37,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-12-18 13:43:37,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-12-18 13:43:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-12-18 13:43:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1501 transitions. [2019-12-18 13:43:37,363 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1501 transitions. Word has length 27 [2019-12-18 13:43:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:37,364 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1501 transitions. [2019-12-18 13:43:37,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:43:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1501 transitions. [2019-12-18 13:43:37,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:43:37,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:37,371 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] [2019-12-18 13:43:37,372 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:37,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:37,372 INFO L82 PathProgramCache]: Analyzing trace with hash 178128967, now seen corresponding path program 1 times [2019-12-18 13:43:37,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:37,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547506321] [2019-12-18 13:43:37,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:37,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547506321] [2019-12-18 13:43:37,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:37,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:43:37,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084761257] [2019-12-18 13:43:37,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:43:37,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:37,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:43:37,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:43:37,474 INFO L87 Difference]: Start difference. First operand 689 states and 1501 transitions. Second operand 4 states. [2019-12-18 13:43:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:37,491 INFO L93 Difference]: Finished difference Result 1118 states and 2458 transitions. [2019-12-18 13:43:37,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:43:37,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-18 13:43:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:37,494 INFO L225 Difference]: With dead ends: 1118 [2019-12-18 13:43:37,494 INFO L226 Difference]: Without dead ends: 471 [2019-12-18 13:43:37,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:43:37,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-18 13:43:37,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2019-12-18 13:43:37,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-12-18 13:43:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1036 transitions. [2019-12-18 13:43:37,503 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1036 transitions. Word has length 51 [2019-12-18 13:43:37,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:37,505 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 1036 transitions. [2019-12-18 13:43:37,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:43:37,505 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1036 transitions. [2019-12-18 13:43:37,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:43:37,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:37,507 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] [2019-12-18 13:43:37,507 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:37,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:37,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1382412251, now seen corresponding path program 2 times [2019-12-18 13:43:37,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:37,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428451895] [2019-12-18 13:43:37,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:37,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428451895] [2019-12-18 13:43:37,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:37,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:43:37,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638495031] [2019-12-18 13:43:37,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:43:37,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:37,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:43:37,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:43:37,603 INFO L87 Difference]: Start difference. First operand 471 states and 1036 transitions. Second operand 7 states. [2019-12-18 13:43:37,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:37,791 INFO L93 Difference]: Finished difference Result 982 states and 2086 transitions. [2019-12-18 13:43:37,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:43:37,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 13:43:37,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:37,794 INFO L225 Difference]: With dead ends: 982 [2019-12-18 13:43:37,794 INFO L226 Difference]: Without dead ends: 683 [2019-12-18 13:43:37,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:43:37,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-18 13:43:37,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 529. [2019-12-18 13:43:37,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-18 13:43:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1137 transitions. [2019-12-18 13:43:37,806 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1137 transitions. Word has length 51 [2019-12-18 13:43:37,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:37,807 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1137 transitions. [2019-12-18 13:43:37,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:43:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1137 transitions. [2019-12-18 13:43:37,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:43:37,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:37,811 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] [2019-12-18 13:43:37,811 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:37,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:37,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1158154681, now seen corresponding path program 3 times [2019-12-18 13:43:37,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:37,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441727782] [2019-12-18 13:43:37,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:37,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441727782] [2019-12-18 13:43:37,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:37,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:43:37,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612513994] [2019-12-18 13:43:37,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:43:37,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:37,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:43:37,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:43:37,965 INFO L87 Difference]: Start difference. First operand 529 states and 1137 transitions. Second operand 5 states. [2019-12-18 13:43:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:38,333 INFO L93 Difference]: Finished difference Result 885 states and 1849 transitions. [2019-12-18 13:43:38,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:43:38,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-18 13:43:38,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:38,335 INFO L225 Difference]: With dead ends: 885 [2019-12-18 13:43:38,335 INFO L226 Difference]: Without dead ends: 861 [2019-12-18 13:43:38,336 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-18 13:43:38,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-12-18 13:43:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 712. [2019-12-18 13:43:38,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-12-18 13:43:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1532 transitions. [2019-12-18 13:43:38,348 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1532 transitions. Word has length 51 [2019-12-18 13:43:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:38,348 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 1532 transitions. [2019-12-18 13:43:38,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:43:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1532 transitions. [2019-12-18 13:43:38,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:43:38,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:38,351 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] [2019-12-18 13:43:38,351 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:38,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:38,352 INFO L82 PathProgramCache]: Analyzing trace with hash -320603405, now seen corresponding path program 4 times [2019-12-18 13:43:38,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:38,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145693273] [2019-12-18 13:43:38,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:38,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:38,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145693273] [2019-12-18 13:43:38,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:38,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:43:38,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352864028] [2019-12-18 13:43:38,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:43:38,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:38,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:43:38,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:43:38,453 INFO L87 Difference]: Start difference. First operand 712 states and 1532 transitions. Second operand 3 states. [2019-12-18 13:43:38,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:38,508 INFO L93 Difference]: Finished difference Result 923 states and 1980 transitions. [2019-12-18 13:43:38,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:43:38,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 13:43:38,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:38,512 INFO L225 Difference]: With dead ends: 923 [2019-12-18 13:43:38,512 INFO L226 Difference]: Without dead ends: 923 [2019-12-18 13:43:38,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:43:38,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-12-18 13:43:38,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 754. [2019-12-18 13:43:38,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-18 13:43:38,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-18 13:43:38,525 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-18 13:43:38,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:38,525 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-18 13:43:38,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:43:38,526 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-18 13:43:38,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:43:38,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:38,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:43:38,528 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:38,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:38,528 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-18 13:43:38,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:38,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665805052] [2019-12-18 13:43:38,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:43:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:43:38,698 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:43:38,698 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:43:38,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1289~0.base_40| 1)) (= 0 v_~__unbuffered_p1_EAX~0_51) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1289~0.base_40| 4)) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= 0 |v_ULTIMATE.start_main_~#t1289~0.offset_27|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1289~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1289~0.base_40|) |v_ULTIMATE.start_main_~#t1289~0.offset_27| 0)) |v_#memory_int_17|) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1289~0.base_40|) (= v_~y$r_buff1_thd1~0_115 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1289~0.base_40|)) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ULTIMATE.start_main_~#t1289~0.offset=|v_ULTIMATE.start_main_~#t1289~0.offset_27|, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ULTIMATE.start_main_~#t1289~0.base=|v_ULTIMATE.start_main_~#t1289~0.base_40|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1290~0.base=|v_ULTIMATE.start_main_~#t1290~0.base_41|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t1290~0.offset=|v_ULTIMATE.start_main_~#t1290~0.offset_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t1289~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1289~0.base, ~y~0, ULTIMATE.start_main_~#t1290~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1290~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 13:43:38,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1290~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1290~0.base_13|) |v_ULTIMATE.start_main_~#t1290~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1290~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1290~0.base_13|) (= |v_ULTIMATE.start_main_~#t1290~0.offset_11| 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1290~0.base_13| 4)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1290~0.base_13|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1290~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1290~0.base=|v_ULTIMATE.start_main_~#t1290~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1290~0.offset=|v_ULTIMATE.start_main_~#t1290~0.offset_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1290~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1290~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 13:43:38,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1020003248)) (= ~y$r_buff1_thd0~0_Out1020003248 ~y$r_buff0_thd0~0_In1020003248) (= ~y$r_buff1_thd2~0_Out1020003248 ~y$r_buff0_thd2~0_In1020003248) (= 1 ~y$r_buff0_thd1~0_Out1020003248) (= ~y$r_buff1_thd1~0_Out1020003248 ~y$r_buff0_thd1~0_In1020003248) (= ~x~0_In1020003248 ~__unbuffered_p0_EAX~0_Out1020003248)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1020003248, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1020003248, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1020003248, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1020003248, ~x~0=~x~0_In1020003248} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1020003248, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1020003248, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1020003248, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1020003248, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1020003248, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1020003248, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1020003248, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1020003248, ~x~0=~x~0_In1020003248} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 13:43:38,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In166724302 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In166724302 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out166724302| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out166724302| ~y$w_buff0_used~0_In166724302) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In166724302, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In166724302} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out166724302|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In166724302, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In166724302} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:43:38,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In2064104817 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out2064104817| |P1Thread1of1ForFork1_#t~ite21_Out2064104817|) (= |P1Thread1of1ForFork1_#t~ite20_Out2064104817| ~y$w_buff0_used~0_In2064104817) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2064104817 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In2064104817 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In2064104817 256)) (and (= 0 (mod ~y$w_buff1_used~0_In2064104817 256)) .cse0))) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In2064104817| |P1Thread1of1ForFork1_#t~ite20_Out2064104817|) (= |P1Thread1of1ForFork1_#t~ite21_Out2064104817| ~y$w_buff0_used~0_In2064104817)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2064104817, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2064104817, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In2064104817|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2064104817, ~weak$$choice2~0=~weak$$choice2~0_In2064104817, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2064104817} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2064104817, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2064104817, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out2064104817|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2064104817, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out2064104817|, ~weak$$choice2~0=~weak$$choice2~0_In2064104817, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2064104817} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 13:43:38,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse4 (= |P1Thread1of1ForFork1_#t~ite23_Out1282082403| |P1Thread1of1ForFork1_#t~ite24_Out1282082403|)) (.cse5 (= 0 (mod ~weak$$choice2~0_In1282082403 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1282082403 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1282082403 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd2~0_In1282082403 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1282082403 256)))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out1282082403|) (or .cse1 (not .cse2)) (not .cse3) (= |P1Thread1of1ForFork1_#t~ite23_Out1282082403| |P1Thread1of1ForFork1_#t~ite22_Out1282082403|) .cse4 .cse5)) (and (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out1282082403| ~y$w_buff1_used~0_In1282082403) (not .cse5) (= |P1Thread1of1ForFork1_#t~ite23_Out1282082403| |P1Thread1of1ForFork1_#t~ite23_In1282082403|)) (and .cse4 .cse5 (or .cse3 (and .cse2 .cse6) (and .cse6 .cse0)) (= |P1Thread1of1ForFork1_#t~ite23_Out1282082403| ~y$w_buff1_used~0_In1282082403))) (= |P1Thread1of1ForFork1_#t~ite22_In1282082403| |P1Thread1of1ForFork1_#t~ite22_Out1282082403|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1282082403, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1282082403, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1282082403, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1282082403|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In1282082403|, ~weak$$choice2~0=~weak$$choice2~0_In1282082403, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1282082403} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1282082403, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1282082403, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1282082403, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1282082403|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1282082403|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out1282082403|, ~weak$$choice2~0=~weak$$choice2~0_In1282082403, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1282082403} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 13:43:38,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-514163029 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-514163029 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-514163029 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-514163029 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-514163029| ~y$w_buff1_used~0_In-514163029) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out-514163029| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-514163029, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-514163029, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-514163029, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-514163029} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-514163029|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-514163029, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-514163029, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-514163029, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-514163029} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:43:38,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1618846831 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1618846831 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out-1618846831 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-1618846831 ~y$r_buff0_thd1~0_Out-1618846831)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1618846831, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1618846831} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1618846831, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1618846831|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1618846831} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:43:38,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1658920430 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1658920430 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In1658920430 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1658920430 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In1658920430 |P0Thread1of1ForFork0_#t~ite8_Out1658920430|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1658920430|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1658920430, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1658920430, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1658920430, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1658920430} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1658920430, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1658920430, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1658920430|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1658920430, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1658920430} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:43:38,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 13:43:38,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1083299783 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1083299783| ~y$r_buff1_thd2~0_In-1083299783) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-1083299783| |P1Thread1of1ForFork1_#t~ite30_Out-1083299783|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1083299783 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1083299783 256)) (and (= (mod ~y$r_buff1_thd2~0_In-1083299783 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1083299783 256)))))) (and (= |P1Thread1of1ForFork1_#t~ite29_In-1083299783| |P1Thread1of1ForFork1_#t~ite29_Out-1083299783|) (= ~y$r_buff1_thd2~0_In-1083299783 |P1Thread1of1ForFork1_#t~ite30_Out-1083299783|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1083299783, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1083299783|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1083299783, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1083299783, ~weak$$choice2~0=~weak$$choice2~0_In-1083299783, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1083299783} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1083299783, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1083299783|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1083299783|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1083299783, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1083299783, ~weak$$choice2~0=~weak$$choice2~0_In-1083299783, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1083299783} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 13:43:38,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 13:43:38,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-623421920 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-623421920 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In-623421920 |P1Thread1of1ForFork1_#t~ite32_Out-623421920|) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-623421920 |P1Thread1of1ForFork1_#t~ite32_Out-623421920|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-623421920, ~y$w_buff1~0=~y$w_buff1~0_In-623421920, ~y~0=~y~0_In-623421920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-623421920} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-623421920, ~y$w_buff1~0=~y$w_buff1~0_In-623421920, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-623421920|, ~y~0=~y~0_In-623421920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-623421920} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 13:43:38,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 13:43:38,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-188658254 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-188658254 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-188658254| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-188658254| ~y$w_buff0_used~0_In-188658254)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-188658254, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-188658254} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-188658254, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-188658254, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-188658254|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 13:43:38,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In-426820937 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-426820937 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-426820937 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-426820937 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-426820937 |P1Thread1of1ForFork1_#t~ite35_Out-426820937|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite35_Out-426820937| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-426820937, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-426820937, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-426820937, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-426820937} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-426820937, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-426820937, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-426820937, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-426820937|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-426820937} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 13:43:38,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1505904936 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1505904936 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1505904936|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1505904936| ~y$r_buff0_thd2~0_In-1505904936)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1505904936, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1505904936} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1505904936, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1505904936, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1505904936|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 13:43:38,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In-996677119 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-996677119 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-996677119 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-996677119 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-996677119 |P1Thread1of1ForFork1_#t~ite37_Out-996677119|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-996677119|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-996677119, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-996677119, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-996677119, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-996677119} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-996677119, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-996677119, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-996677119, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-996677119|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-996677119} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 13:43:38,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 13:43:38,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:43:38,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 13:43:38,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1865634155 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1865634155 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1865634155| ~y$w_buff1~0_In1865634155) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1865634155| ~y~0_In1865634155)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1865634155, ~y~0=~y~0_In1865634155, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1865634155, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1865634155} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1865634155|, ~y$w_buff1~0=~y$w_buff1~0_In1865634155, ~y~0=~y~0_In1865634155, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1865634155, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1865634155} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 13:43:38,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 13:43:38,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1393929753 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1393929753 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1393929753| ~y$w_buff0_used~0_In-1393929753)) (and (= |ULTIMATE.start_main_#t~ite42_Out-1393929753| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1393929753, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1393929753} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1393929753, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1393929753, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1393929753|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:43:38,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In90483465 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In90483465 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In90483465 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In90483465 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out90483465|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In90483465 |ULTIMATE.start_main_#t~ite43_Out90483465|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In90483465, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In90483465, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In90483465, ~y$w_buff1_used~0=~y$w_buff1_used~0_In90483465} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In90483465, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In90483465, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out90483465|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In90483465, ~y$w_buff1_used~0=~y$w_buff1_used~0_In90483465} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 13:43:38,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In837951997 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In837951997 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out837951997| 0)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In837951997 |ULTIMATE.start_main_#t~ite44_Out837951997|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In837951997, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In837951997} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In837951997, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In837951997, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out837951997|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 13:43:38,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In2025266797 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In2025266797 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In2025266797 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In2025266797 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out2025266797|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out2025266797| ~y$r_buff1_thd0~0_In2025266797)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2025266797, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2025266797, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2025266797, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2025266797} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2025266797, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2025266797, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2025266797, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2025266797|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2025266797} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:43:38,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:43:38,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:43:38 BasicIcfg [2019-12-18 13:43:38,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:43:38,836 INFO L168 Benchmark]: Toolchain (without parser) took 14859.23 ms. Allocated memory was 145.8 MB in the beginning and 591.9 MB in the end (delta: 446.2 MB). Free memory was 100.7 MB in the beginning and 138.9 MB in the end (delta: -38.2 MB). Peak memory consumption was 408.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:43:38,837 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 145.8 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 13:43:38,840 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.76 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.2 MB in the beginning and 158.0 MB in the end (delta: -57.8 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:43:38,841 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.80 ms. Allocated memory is still 203.9 MB. Free memory was 158.0 MB in the beginning and 155.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:43:38,848 INFO L168 Benchmark]: Boogie Preprocessor took 54.77 ms. Allocated memory is still 203.9 MB. Free memory was 155.1 MB in the beginning and 153.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:43:38,849 INFO L168 Benchmark]: RCFGBuilder took 733.57 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 109.3 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:43:38,850 INFO L168 Benchmark]: TraceAbstraction took 13258.14 ms. Allocated memory was 203.9 MB in the beginning and 591.9 MB in the end (delta: 388.0 MB). Free memory was 108.3 MB in the beginning and 138.9 MB in the end (delta: -30.6 MB). Peak memory consumption was 357.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:43:38,858 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52 ms. Allocated memory is still 145.8 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 742.76 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.2 MB in the beginning and 158.0 MB in the end (delta: -57.8 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.80 ms. Allocated memory is still 203.9 MB. Free memory was 158.0 MB in the beginning and 155.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.77 ms. Allocated memory is still 203.9 MB. Free memory was 155.1 MB in the beginning and 153.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 733.57 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 109.3 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13258.14 ms. Allocated memory was 203.9 MB in the beginning and 591.9 MB in the end (delta: 388.0 MB). Free memory was 108.3 MB in the beginning and 138.9 MB in the end (delta: -30.6 MB). Peak memory consumption was 357.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1289, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1290, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.9s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1295 SDtfs, 1438 SDslu, 2194 SDs, 0 SdLazy, 1138 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 5640 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 32918 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...