/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:42:48,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:42:48,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:42:48,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:42:48,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:42:48,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:42:48,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:42:48,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:42:48,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:42:48,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:42:48,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:42:48,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:42:48,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:42:48,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:42:48,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:42:48,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:42:48,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:42:48,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:42:48,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:42:48,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:42:48,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:42:48,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:42:48,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:42:48,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:42:48,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:42:48,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:42:48,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:42:48,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:42:48,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:42:48,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:42:48,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:42:48,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:42:48,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:42:48,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:42:48,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:42:48,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:42:48,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:42:48,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:42:48,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:42:48,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:42:48,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:42:48,725 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:42:48,747 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:42:48,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:42:48,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:42:48,751 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:42:48,751 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:42:48,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:42:48,752 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:42:48,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:42:48,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:42:48,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:42:48,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:42:48,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:42:48,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:42:48,754 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:42:48,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:42:48,754 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:42:48,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:42:48,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:42:48,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:42:48,756 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:42:48,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:42:48,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:42:48,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:42:48,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:42:48,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:42:48,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:42:48,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:42:48,762 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:42:48,762 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:42:48,762 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:42:49,049 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:42:49,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:42:49,065 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:42:49,067 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:42:49,067 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:42:49,068 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_pso.opt.i [2019-12-18 20:42:49,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02acf2611/9de86a425f984f0caf7151068aa3fa81/FLAG34357f160 [2019-12-18 20:42:49,661 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:42:49,662 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_pso.opt.i [2019-12-18 20:42:49,675 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02acf2611/9de86a425f984f0caf7151068aa3fa81/FLAG34357f160 [2019-12-18 20:42:49,971 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02acf2611/9de86a425f984f0caf7151068aa3fa81 [2019-12-18 20:42:49,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:42:49,987 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:42:49,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:42:49,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:42:49,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:42:49,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:42:49" (1/1) ... [2019-12-18 20:42:49,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd22070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:49, skipping insertion in model container [2019-12-18 20:42:49,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:42:49" (1/1) ... [2019-12-18 20:42:50,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:42:50,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:42:50,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:42:50,725 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:42:50,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:42:50,866 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:42:50,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:50 WrapperNode [2019-12-18 20:42:50,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:42:50,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:42:50,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:42:50,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:42:50,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:50" (1/1) ... [2019-12-18 20:42:50,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:50" (1/1) ... [2019-12-18 20:42:50,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:42:50,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:42:50,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:42:50,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:42:50,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:50" (1/1) ... [2019-12-18 20:42:50,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:50" (1/1) ... [2019-12-18 20:42:50,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:50" (1/1) ... [2019-12-18 20:42:50,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:50" (1/1) ... [2019-12-18 20:42:50,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:50" (1/1) ... [2019-12-18 20:42:50,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:50" (1/1) ... [2019-12-18 20:42:50,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:50" (1/1) ... [2019-12-18 20:42:50,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:42:50,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:42:50,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:42:50,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:42:50,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:50" (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 20:42:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:42:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:42:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:42:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:42:51,032 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:42:51,032 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:42:51,032 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:42:51,032 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:42:51,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:42:51,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:42:51,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:42:51,035 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 20:42:51,731 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:42:51,732 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:42:51,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:42:51 BoogieIcfgContainer [2019-12-18 20:42:51,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:42:51,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:42:51,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:42:51,738 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:42:51,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:42:49" (1/3) ... [2019-12-18 20:42:51,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373dcc06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:42:51, skipping insertion in model container [2019-12-18 20:42:51,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:50" (2/3) ... [2019-12-18 20:42:51,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373dcc06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:42:51, skipping insertion in model container [2019-12-18 20:42:51,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:42:51" (3/3) ... [2019-12-18 20:42:51,743 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_pso.opt.i [2019-12-18 20:42:51,753 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:42:51,754 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:42:51,761 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:42:51,762 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:42:51,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,801 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,801 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,801 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,802 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,802 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,812 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,812 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,858 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,858 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,859 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,864 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,867 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:51,883 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 20:42:51,902 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:42:51,903 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:42:51,903 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:42:51,903 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:42:51,903 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:42:51,903 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:42:51,904 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:42:51,904 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:42:51,920 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 20:42:51,922 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 20:42:51,995 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 20:42:51,996 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:42:52,012 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 340 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 20:42:52,033 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 20:42:52,070 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 20:42:52,070 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:42:52,077 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 340 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 20:42:52,095 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 20:42:52,096 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:42:55,128 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-18 20:42:55,349 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 20:42:55,454 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 20:42:55,480 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55625 [2019-12-18 20:42:55,480 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-18 20:42:55,484 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 89 transitions [2019-12-18 20:42:56,027 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9482 states. [2019-12-18 20:42:56,029 INFO L276 IsEmpty]: Start isEmpty. Operand 9482 states. [2019-12-18 20:42:56,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 20:42:56,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:56,036 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 20:42:56,036 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:56,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:56,043 INFO L82 PathProgramCache]: Analyzing trace with hash 786448, now seen corresponding path program 1 times [2019-12-18 20:42:56,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:56,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713536042] [2019-12-18 20:42:56,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:42:56,280 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 20:42:56,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713536042] [2019-12-18 20:42:56,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:42:56,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:42:56,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197435552] [2019-12-18 20:42:56,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:42:56,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:42:56,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:42:56,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:42:56,306 INFO L87 Difference]: Start difference. First operand 9482 states. Second operand 3 states. [2019-12-18 20:42:56,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:42:56,571 INFO L93 Difference]: Finished difference Result 9196 states and 29676 transitions. [2019-12-18 20:42:56,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:42:56,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 20:42:56,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:42:56,709 INFO L225 Difference]: With dead ends: 9196 [2019-12-18 20:42:56,709 INFO L226 Difference]: Without dead ends: 8650 [2019-12-18 20:42:56,710 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 20:42:56,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8650 states. [2019-12-18 20:42:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8650 to 8650. [2019-12-18 20:42:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8650 states. [2019-12-18 20:42:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8650 states to 8650 states and 27866 transitions. [2019-12-18 20:42:57,285 INFO L78 Accepts]: Start accepts. Automaton has 8650 states and 27866 transitions. Word has length 3 [2019-12-18 20:42:57,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:42:57,285 INFO L462 AbstractCegarLoop]: Abstraction has 8650 states and 27866 transitions. [2019-12-18 20:42:57,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:42:57,286 INFO L276 IsEmpty]: Start isEmpty. Operand 8650 states and 27866 transitions. [2019-12-18 20:42:57,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:42:57,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:57,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:42:57,292 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:57,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:57,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1848805564, now seen corresponding path program 1 times [2019-12-18 20:42:57,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:57,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979335830] [2019-12-18 20:42:57,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:42:57,486 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 20:42:57,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979335830] [2019-12-18 20:42:57,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:42:57,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:42:57,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342749353] [2019-12-18 20:42:57,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:42:57,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:42:57,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:42:57,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:42:57,491 INFO L87 Difference]: Start difference. First operand 8650 states and 27866 transitions. Second operand 4 states. [2019-12-18 20:42:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:42:57,943 INFO L93 Difference]: Finished difference Result 13062 states and 40116 transitions. [2019-12-18 20:42:57,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:42:57,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 20:42:57,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:42:58,068 INFO L225 Difference]: With dead ends: 13062 [2019-12-18 20:42:58,069 INFO L226 Difference]: Without dead ends: 13055 [2019-12-18 20:42:58,072 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 20:42:58,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13055 states. [2019-12-18 20:42:58,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13055 to 11681. [2019-12-18 20:42:58,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11681 states. [2019-12-18 20:42:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11681 states to 11681 states and 36573 transitions. [2019-12-18 20:42:58,800 INFO L78 Accepts]: Start accepts. Automaton has 11681 states and 36573 transitions. Word has length 11 [2019-12-18 20:42:58,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:42:58,801 INFO L462 AbstractCegarLoop]: Abstraction has 11681 states and 36573 transitions. [2019-12-18 20:42:58,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:42:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 11681 states and 36573 transitions. [2019-12-18 20:42:58,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:42:58,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:58,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:42:58,814 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:58,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:58,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1479508104, now seen corresponding path program 1 times [2019-12-18 20:42:58,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:58,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253057197] [2019-12-18 20:42:58,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:42:58,954 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 20:42:58,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253057197] [2019-12-18 20:42:58,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:42:58,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:42:58,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663894854] [2019-12-18 20:42:58,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:42:58,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:42:58,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:42:58,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:42:58,956 INFO L87 Difference]: Start difference. First operand 11681 states and 36573 transitions. Second operand 4 states. [2019-12-18 20:42:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:42:59,922 INFO L93 Difference]: Finished difference Result 13877 states and 43308 transitions. [2019-12-18 20:42:59,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:42:59,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 20:42:59,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:42:59,997 INFO L225 Difference]: With dead ends: 13877 [2019-12-18 20:42:59,997 INFO L226 Difference]: Without dead ends: 13877 [2019-12-18 20:42:59,997 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 20:43:00,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13877 states. [2019-12-18 20:43:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13877 to 12389. [2019-12-18 20:43:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12389 states. [2019-12-18 20:43:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12389 states to 12389 states and 38882 transitions. [2019-12-18 20:43:00,557 INFO L78 Accepts]: Start accepts. Automaton has 12389 states and 38882 transitions. Word has length 14 [2019-12-18 20:43:00,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:00,558 INFO L462 AbstractCegarLoop]: Abstraction has 12389 states and 38882 transitions. [2019-12-18 20:43:00,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:43:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 12389 states and 38882 transitions. [2019-12-18 20:43:00,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:43:00,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:00,563 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:00,563 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:00,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:00,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1357739076, now seen corresponding path program 1 times [2019-12-18 20:43:00,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:00,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194597167] [2019-12-18 20:43:00,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:00,618 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 20:43:00,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194597167] [2019-12-18 20:43:00,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:00,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:43:00,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468807779] [2019-12-18 20:43:00,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:43:00,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:00,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:43:00,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:43:00,621 INFO L87 Difference]: Start difference. First operand 12389 states and 38882 transitions. Second operand 3 states. [2019-12-18 20:43:00,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:00,727 INFO L93 Difference]: Finished difference Result 12386 states and 38873 transitions. [2019-12-18 20:43:00,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:43:00,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 20:43:00,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:00,778 INFO L225 Difference]: With dead ends: 12386 [2019-12-18 20:43:00,779 INFO L226 Difference]: Without dead ends: 12386 [2019-12-18 20:43:00,779 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 20:43:01,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2019-12-18 20:43:01,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 12386. [2019-12-18 20:43:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12386 states. [2019-12-18 20:43:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12386 states to 12386 states and 38873 transitions. [2019-12-18 20:43:01,350 INFO L78 Accepts]: Start accepts. Automaton has 12386 states and 38873 transitions. Word has length 16 [2019-12-18 20:43:01,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:01,351 INFO L462 AbstractCegarLoop]: Abstraction has 12386 states and 38873 transitions. [2019-12-18 20:43:01,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:43:01,351 INFO L276 IsEmpty]: Start isEmpty. Operand 12386 states and 38873 transitions. [2019-12-18 20:43:01,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 20:43:01,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:01,355 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:01,356 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:01,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:01,356 INFO L82 PathProgramCache]: Analyzing trace with hash 865126068, now seen corresponding path program 1 times [2019-12-18 20:43:01,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:01,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868291719] [2019-12-18 20:43:01,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:01,423 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 20:43:01,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868291719] [2019-12-18 20:43:01,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:01,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:43:01,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521376986] [2019-12-18 20:43:01,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:43:01,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:01,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:43:01,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:43:01,425 INFO L87 Difference]: Start difference. First operand 12386 states and 38873 transitions. Second operand 4 states. [2019-12-18 20:43:01,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:01,462 INFO L93 Difference]: Finished difference Result 2361 states and 5903 transitions. [2019-12-18 20:43:01,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:43:01,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 20:43:01,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:01,467 INFO L225 Difference]: With dead ends: 2361 [2019-12-18 20:43:01,467 INFO L226 Difference]: Without dead ends: 1670 [2019-12-18 20:43:01,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:43:01,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2019-12-18 20:43:01,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1654. [2019-12-18 20:43:01,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-12-18 20:43:01,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3696 transitions. [2019-12-18 20:43:01,505 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 3696 transitions. Word has length 17 [2019-12-18 20:43:01,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:01,505 INFO L462 AbstractCegarLoop]: Abstraction has 1654 states and 3696 transitions. [2019-12-18 20:43:01,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:43:01,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 3696 transitions. [2019-12-18 20:43:01,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:43:01,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:01,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:01,508 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:01,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:01,508 INFO L82 PathProgramCache]: Analyzing trace with hash 935036584, now seen corresponding path program 1 times [2019-12-18 20:43:01,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:01,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417347554] [2019-12-18 20:43:01,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:01,586 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 20:43:01,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417347554] [2019-12-18 20:43:01,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:01,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:43:01,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823555863] [2019-12-18 20:43:01,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:43:01,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:01,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:43:01,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:43:01,588 INFO L87 Difference]: Start difference. First operand 1654 states and 3696 transitions. Second operand 6 states. [2019-12-18 20:43:02,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:02,228 INFO L93 Difference]: Finished difference Result 4552 states and 10047 transitions. [2019-12-18 20:43:02,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:43:02,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 20:43:02,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:02,241 INFO L225 Difference]: With dead ends: 4552 [2019-12-18 20:43:02,241 INFO L226 Difference]: Without dead ends: 4517 [2019-12-18 20:43:02,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:43:02,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-18 20:43:02,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 2214. [2019-12-18 20:43:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2019-12-18 20:43:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 5000 transitions. [2019-12-18 20:43:02,303 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 5000 transitions. Word has length 25 [2019-12-18 20:43:02,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:02,304 INFO L462 AbstractCegarLoop]: Abstraction has 2214 states and 5000 transitions. [2019-12-18 20:43:02,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:43:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 5000 transitions. [2019-12-18 20:43:02,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 20:43:02,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:02,310 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] [2019-12-18 20:43:02,310 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:02,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:02,310 INFO L82 PathProgramCache]: Analyzing trace with hash -453087513, now seen corresponding path program 1 times [2019-12-18 20:43:02,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:02,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798112929] [2019-12-18 20:43:02,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:02,395 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 20:43:02,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798112929] [2019-12-18 20:43:02,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:02,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:43:02,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907357524] [2019-12-18 20:43:02,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:43:02,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:02,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:43:02,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:43:02,397 INFO L87 Difference]: Start difference. First operand 2214 states and 5000 transitions. Second operand 3 states. [2019-12-18 20:43:02,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:02,416 INFO L93 Difference]: Finished difference Result 3872 states and 8779 transitions. [2019-12-18 20:43:02,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:43:02,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 20:43:02,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:02,422 INFO L225 Difference]: With dead ends: 3872 [2019-12-18 20:43:02,422 INFO L226 Difference]: Without dead ends: 2030 [2019-12-18 20:43:02,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:43:02,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2019-12-18 20:43:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 2010. [2019-12-18 20:43:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2010 states. [2019-12-18 20:43:02,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 4452 transitions. [2019-12-18 20:43:02,460 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 4452 transitions. Word has length 26 [2019-12-18 20:43:02,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:02,460 INFO L462 AbstractCegarLoop]: Abstraction has 2010 states and 4452 transitions. [2019-12-18 20:43:02,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:43:02,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 4452 transitions. [2019-12-18 20:43:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 20:43:02,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:02,463 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] [2019-12-18 20:43:02,463 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:02,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:02,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1584123616, now seen corresponding path program 1 times [2019-12-18 20:43:02,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:02,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130519268] [2019-12-18 20:43:02,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:02,572 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 20:43:02,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130519268] [2019-12-18 20:43:02,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:02,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:43:02,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154176720] [2019-12-18 20:43:02,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:43:02,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:02,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:43:02,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:43:02,575 INFO L87 Difference]: Start difference. First operand 2010 states and 4452 transitions. Second operand 6 states. [2019-12-18 20:43:03,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:03,040 INFO L93 Difference]: Finished difference Result 3736 states and 7983 transitions. [2019-12-18 20:43:03,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:43:03,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-18 20:43:03,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:03,049 INFO L225 Difference]: With dead ends: 3736 [2019-12-18 20:43:03,050 INFO L226 Difference]: Without dead ends: 3707 [2019-12-18 20:43:03,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:43:03,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2019-12-18 20:43:03,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 1982. [2019-12-18 20:43:03,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-18 20:43:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4405 transitions. [2019-12-18 20:43:03,102 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4405 transitions. Word has length 26 [2019-12-18 20:43:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:03,104 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4405 transitions. [2019-12-18 20:43:03,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:43:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4405 transitions. [2019-12-18 20:43:03,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:43:03,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:03,107 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 20:43:03,108 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:03,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:03,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1377848575, now seen corresponding path program 1 times [2019-12-18 20:43:03,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:03,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775418923] [2019-12-18 20:43:03,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:03,223 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 20:43:03,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775418923] [2019-12-18 20:43:03,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:03,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:43:03,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360571759] [2019-12-18 20:43:03,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:43:03,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:03,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:43:03,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:43:03,225 INFO L87 Difference]: Start difference. First operand 1982 states and 4405 transitions. Second operand 5 states. [2019-12-18 20:43:03,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:03,681 INFO L93 Difference]: Finished difference Result 2989 states and 6529 transitions. [2019-12-18 20:43:03,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:43:03,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 20:43:03,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:03,689 INFO L225 Difference]: With dead ends: 2989 [2019-12-18 20:43:03,689 INFO L226 Difference]: Without dead ends: 2989 [2019-12-18 20:43:03,690 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 20:43:03,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2019-12-18 20:43:03,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2553. [2019-12-18 20:43:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-12-18 20:43:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 5641 transitions. [2019-12-18 20:43:03,739 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 5641 transitions. Word has length 27 [2019-12-18 20:43:03,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:03,739 INFO L462 AbstractCegarLoop]: Abstraction has 2553 states and 5641 transitions. [2019-12-18 20:43:03,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:43:03,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 5641 transitions. [2019-12-18 20:43:03,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:43:03,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:03,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:03,746 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:03,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:03,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1012801820, now seen corresponding path program 1 times [2019-12-18 20:43:03,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:03,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477146640] [2019-12-18 20:43:03,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:03,829 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 20:43:03,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477146640] [2019-12-18 20:43:03,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:03,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:43:03,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71651460] [2019-12-18 20:43:03,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:43:03,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:03,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:43:03,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:43:03,831 INFO L87 Difference]: Start difference. First operand 2553 states and 5641 transitions. Second operand 5 states. [2019-12-18 20:43:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:03,885 INFO L93 Difference]: Finished difference Result 1549 states and 3250 transitions. [2019-12-18 20:43:03,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:43:03,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 20:43:03,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:03,889 INFO L225 Difference]: With dead ends: 1549 [2019-12-18 20:43:03,889 INFO L226 Difference]: Without dead ends: 1302 [2019-12-18 20:43:03,890 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 20:43:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2019-12-18 20:43:03,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1207. [2019-12-18 20:43:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2019-12-18 20:43:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 2612 transitions. [2019-12-18 20:43:03,911 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 2612 transitions. Word has length 28 [2019-12-18 20:43:03,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:03,912 INFO L462 AbstractCegarLoop]: Abstraction has 1207 states and 2612 transitions. [2019-12-18 20:43:03,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:43:03,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 2612 transitions. [2019-12-18 20:43:03,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 20:43:03,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:03,915 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 20:43:03,916 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:03,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:03,916 INFO L82 PathProgramCache]: Analyzing trace with hash -257669256, now seen corresponding path program 1 times [2019-12-18 20:43:03,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:03,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38420528] [2019-12-18 20:43:03,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:04,076 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 20:43:04,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38420528] [2019-12-18 20:43:04,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:04,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:43:04,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59312973] [2019-12-18 20:43:04,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:43:04,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:04,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:43:04,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:43:04,079 INFO L87 Difference]: Start difference. First operand 1207 states and 2612 transitions. Second operand 7 states. [2019-12-18 20:43:04,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:04,257 INFO L93 Difference]: Finished difference Result 2115 states and 4473 transitions. [2019-12-18 20:43:04,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 20:43:04,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 20:43:04,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:04,261 INFO L225 Difference]: With dead ends: 2115 [2019-12-18 20:43:04,261 INFO L226 Difference]: Without dead ends: 1423 [2019-12-18 20:43:04,262 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 20:43:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2019-12-18 20:43:04,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1214. [2019-12-18 20:43:04,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-18 20:43:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2602 transitions. [2019-12-18 20:43:04,283 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 2602 transitions. Word has length 51 [2019-12-18 20:43:04,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:04,283 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 2602 transitions. [2019-12-18 20:43:04,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:43:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2602 transitions. [2019-12-18 20:43:04,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 20:43:04,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:04,287 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 20:43:04,287 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:04,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:04,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1643045960, now seen corresponding path program 2 times [2019-12-18 20:43:04,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:04,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396236833] [2019-12-18 20:43:04,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:04,358 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 20:43:04,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396236833] [2019-12-18 20:43:04,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:04,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:43:04,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824396215] [2019-12-18 20:43:04,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:43:04,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:04,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:43:04,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:43:04,360 INFO L87 Difference]: Start difference. First operand 1214 states and 2602 transitions. Second operand 3 states. [2019-12-18 20:43:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:04,412 INFO L93 Difference]: Finished difference Result 1587 states and 3364 transitions. [2019-12-18 20:43:04,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:43:04,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 20:43:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:04,416 INFO L225 Difference]: With dead ends: 1587 [2019-12-18 20:43:04,417 INFO L226 Difference]: Without dead ends: 1587 [2019-12-18 20:43:04,417 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 20:43:04,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2019-12-18 20:43:04,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1262. [2019-12-18 20:43:04,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1262 states. [2019-12-18 20:43:04,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 2714 transitions. [2019-12-18 20:43:04,439 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 2714 transitions. Word has length 51 [2019-12-18 20:43:04,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:04,439 INFO L462 AbstractCegarLoop]: Abstraction has 1262 states and 2714 transitions. [2019-12-18 20:43:04,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:43:04,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 2714 transitions. [2019-12-18 20:43:04,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 20:43:04,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:04,443 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 20:43:04,443 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:04,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:04,443 INFO L82 PathProgramCache]: Analyzing trace with hash 730196883, now seen corresponding path program 1 times [2019-12-18 20:43:04,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:04,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582247394] [2019-12-18 20:43:04,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:04,584 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 20:43:04,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582247394] [2019-12-18 20:43:04,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:04,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:43:04,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192402029] [2019-12-18 20:43:04,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:43:04,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:04,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:43:04,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:43:04,590 INFO L87 Difference]: Start difference. First operand 1262 states and 2714 transitions. Second operand 8 states. [2019-12-18 20:43:06,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:06,017 INFO L93 Difference]: Finished difference Result 2653 states and 5478 transitions. [2019-12-18 20:43:06,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:43:06,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-18 20:43:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:06,026 INFO L225 Difference]: With dead ends: 2653 [2019-12-18 20:43:06,026 INFO L226 Difference]: Without dead ends: 2653 [2019-12-18 20:43:06,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2019-12-18 20:43:06,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2019-12-18 20:43:06,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 1286. [2019-12-18 20:43:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2019-12-18 20:43:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2747 transitions. [2019-12-18 20:43:06,057 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2747 transitions. Word has length 52 [2019-12-18 20:43:06,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:06,058 INFO L462 AbstractCegarLoop]: Abstraction has 1286 states and 2747 transitions. [2019-12-18 20:43:06,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:43:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2747 transitions. [2019-12-18 20:43:06,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 20:43:06,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:06,061 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 20:43:06,062 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:06,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:06,062 INFO L82 PathProgramCache]: Analyzing trace with hash -539154384, now seen corresponding path program 1 times [2019-12-18 20:43:06,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:06,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680319118] [2019-12-18 20:43:06,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:06,154 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 20:43:06,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680319118] [2019-12-18 20:43:06,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:06,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:43:06,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635302437] [2019-12-18 20:43:06,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:43:06,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:06,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:43:06,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:43:06,156 INFO L87 Difference]: Start difference. First operand 1286 states and 2747 transitions. Second operand 4 states. [2019-12-18 20:43:06,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:06,530 INFO L93 Difference]: Finished difference Result 1970 states and 4215 transitions. [2019-12-18 20:43:06,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:43:06,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-18 20:43:06,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:06,537 INFO L225 Difference]: With dead ends: 1970 [2019-12-18 20:43:06,537 INFO L226 Difference]: Without dead ends: 1970 [2019-12-18 20:43:06,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 20:43:06,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2019-12-18 20:43:06,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1316. [2019-12-18 20:43:06,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-12-18 20:43:06,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 2818 transitions. [2019-12-18 20:43:06,576 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 2818 transitions. Word has length 52 [2019-12-18 20:43:06,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:06,578 INFO L462 AbstractCegarLoop]: Abstraction has 1316 states and 2818 transitions. [2019-12-18 20:43:06,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:43:06,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 2818 transitions. [2019-12-18 20:43:06,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 20:43:06,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:06,583 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 20:43:06,583 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:06,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:06,584 INFO L82 PathProgramCache]: Analyzing trace with hash -930930685, now seen corresponding path program 2 times [2019-12-18 20:43:06,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:06,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698974390] [2019-12-18 20:43:06,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:06,658 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 20:43:06,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698974390] [2019-12-18 20:43:06,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:06,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:43:06,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891403698] [2019-12-18 20:43:06,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:43:06,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:06,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:43:06,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:43:06,660 INFO L87 Difference]: Start difference. First operand 1316 states and 2818 transitions. Second operand 3 states. [2019-12-18 20:43:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:06,674 INFO L93 Difference]: Finished difference Result 1315 states and 2816 transitions. [2019-12-18 20:43:06,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:43:06,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 20:43:06,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:06,678 INFO L225 Difference]: With dead ends: 1315 [2019-12-18 20:43:06,679 INFO L226 Difference]: Without dead ends: 1315 [2019-12-18 20:43:06,679 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 20:43:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2019-12-18 20:43:06,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 935. [2019-12-18 20:43:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-12-18 20:43:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 2029 transitions. [2019-12-18 20:43:06,696 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 2029 transitions. Word has length 52 [2019-12-18 20:43:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:06,696 INFO L462 AbstractCegarLoop]: Abstraction has 935 states and 2029 transitions. [2019-12-18 20:43:06,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:43:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 2029 transitions. [2019-12-18 20:43:06,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 20:43:06,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:06,699 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:06,699 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:06,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:06,699 INFO L82 PathProgramCache]: Analyzing trace with hash -87902062, now seen corresponding path program 1 times [2019-12-18 20:43:06,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:06,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030865084] [2019-12-18 20:43:06,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:43:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:43:06,849 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:43:06,851 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:43:06,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t591~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t591~0.base_22|) |v_ULTIMATE.start_main_~#t591~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd2~0_77 0) (= 0 v_~__unbuffered_cnt~0_13) (= 0 v_~__unbuffered_p1_EAX~0_12) (= 0 v_~y$r_buff1_thd2~0_53) (= 0 v_~y$r_buff1_thd0~0_22) (= 0 v_~weak$$choice0~0_5) (= v_~y$r_buff0_thd0~0_24 0) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$r_buff1_thd1~0_21) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~y$flush_delayed~0_14) (= v_~y$read_delayed~0_6 0) (= v_~y$mem_tmp~0_11 0) (= v_~x~0_17 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~y$read_delayed_var~0.base_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t591~0.base_22| 1) |v_#valid_44|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t591~0.base_22| 4) |v_#length_17|) (= v_~main$tmp_guard1~0_15 0) (= |v_#NULL.offset_4| 0) (= v_~y$w_buff1_used~0_67 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t591~0.base_22|)) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~main$tmp_guard0~0_11 0) (= v_~y~0_26 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t591~0.base_22|) (= 0 |v_ULTIMATE.start_main_~#t591~0.offset_17|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_~#t591~0.offset=|v_ULTIMATE.start_main_~#t591~0.offset_17|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_20|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t591~0.base=|v_ULTIMATE.start_main_~#t591~0.base_22|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_17|, ~y~0=v_~y~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_~#t592~0.base=|v_ULTIMATE.start_main_~#t592~0.base_18|, ULTIMATE.start_main_~#t592~0.offset=|v_ULTIMATE.start_main_~#t592~0.offset_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_24, #valid=|v_#valid_44|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_77, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_22, ~x~0=v_~x~0_17, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t591~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t591~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t592~0.base, ULTIMATE.start_main_~#t592~0.offset, ~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, ~__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 20:43:06,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L797-1-->L799: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t592~0.base_12|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t592~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t592~0.base_12|) |v_ULTIMATE.start_main_~#t592~0.offset_10| 1)) |v_#memory_int_9|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t592~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t592~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t592~0.offset_10| 0) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t592~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t592~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t592~0.base=|v_ULTIMATE.start_main_~#t592~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t592~0.offset=|v_ULTIMATE.start_main_~#t592~0.offset_10|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t592~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t592~0.offset, #length] because there is no mapped edge [2019-12-18 20:43:06,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_11) (= 1 v_~x~0_5) (= v_~y$r_buff0_thd2~0_55 v_~y$r_buff1_thd2~0_33) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$r_buff0_thd1~0_16 1) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_16, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 20:43:06,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-127148919 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-127148919 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-127148919| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-127148919| ~y$w_buff0_used~0_In-127148919) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-127148919, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-127148919} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-127148919|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-127148919, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-127148919} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 20:43:06,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In627096685 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In627096685 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In627096685 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In627096685 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out627096685| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out627096685| ~y$w_buff1_used~0_In627096685)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In627096685, ~y$w_buff0_used~0=~y$w_buff0_used~0_In627096685, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In627096685, ~y$w_buff1_used~0=~y$w_buff1_used~0_In627096685} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out627096685|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In627096685, ~y$w_buff0_used~0=~y$w_buff0_used~0_In627096685, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In627096685, ~y$w_buff1_used~0=~y$w_buff1_used~0_In627096685} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 20:43:06,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-49727632 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-49727632 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out-49727632) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out-49727632 ~y$r_buff0_thd1~0_In-49727632)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-49727632, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-49727632} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-49727632, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-49727632|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-49727632} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:43:06,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1597362819 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In-1597362819| |P1Thread1of1ForFork1_#t~ite14_Out-1597362819|) (not .cse0) (= ~y$w_buff0~0_In-1597362819 |P1Thread1of1ForFork1_#t~ite15_Out-1597362819|)) (and .cse0 (= ~y$w_buff0~0_In-1597362819 |P1Thread1of1ForFork1_#t~ite14_Out-1597362819|) (= |P1Thread1of1ForFork1_#t~ite15_Out-1597362819| |P1Thread1of1ForFork1_#t~ite14_Out-1597362819|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1597362819 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1597362819 256) 0)) (= (mod ~y$w_buff0_used~0_In-1597362819 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1597362819 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1597362819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1597362819, ~y$w_buff0~0=~y$w_buff0~0_In-1597362819, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1597362819, ~weak$$choice2~0=~weak$$choice2~0_In-1597362819, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1597362819|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1597362819} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1597362819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1597362819, ~y$w_buff0~0=~y$w_buff0~0_In-1597362819, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1597362819, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1597362819|, ~weak$$choice2~0=~weak$$choice2~0_In-1597362819, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1597362819|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1597362819} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 20:43:06,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1634935530 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In1634935530| |P1Thread1of1ForFork1_#t~ite17_Out1634935530|) (= |P1Thread1of1ForFork1_#t~ite18_Out1634935530| ~y$w_buff1~0_In1634935530) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite17_Out1634935530| |P1Thread1of1ForFork1_#t~ite18_Out1634935530|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1634935530 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1634935530 256))) (= (mod ~y$w_buff0_used~0_In1634935530 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In1634935530 256)) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite17_Out1634935530| ~y$w_buff1~0_In1634935530)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1634935530, ~y$w_buff1~0=~y$w_buff1~0_In1634935530, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1634935530, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1634935530, ~weak$$choice2~0=~weak$$choice2~0_In1634935530, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1634935530|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1634935530} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1634935530, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1634935530|, ~y$w_buff1~0=~y$w_buff1~0_In1634935530, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1634935530, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1634935530, ~weak$$choice2~0=~weak$$choice2~0_In1634935530, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1634935530|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1634935530} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 20:43:06,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1753675306 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1753675306 |P1Thread1of1ForFork1_#t~ite21_Out-1753675306|) (= |P1Thread1of1ForFork1_#t~ite20_In-1753675306| |P1Thread1of1ForFork1_#t~ite20_Out-1753675306|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out-1753675306| |P1Thread1of1ForFork1_#t~ite21_Out-1753675306|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1753675306 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In-1753675306 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-1753675306 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1753675306 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite20_Out-1753675306| ~y$w_buff0_used~0_In-1753675306)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1753675306, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1753675306, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1753675306|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1753675306, ~weak$$choice2~0=~weak$$choice2~0_In-1753675306, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1753675306} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1753675306, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1753675306, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1753675306|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1753675306, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1753675306|, ~weak$$choice2~0=~weak$$choice2~0_In-1753675306, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1753675306} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 20:43:06,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_61 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 20:43:06,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1848219569 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1848219569| ~y$r_buff1_thd2~0_In-1848219569) (= |P1Thread1of1ForFork1_#t~ite29_Out-1848219569| |P1Thread1of1ForFork1_#t~ite30_Out-1848219569|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1848219569 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1848219569 256)) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In-1848219569 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-1848219569 256) 0)))) (and (= ~y$r_buff1_thd2~0_In-1848219569 |P1Thread1of1ForFork1_#t~ite30_Out-1848219569|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-1848219569| |P1Thread1of1ForFork1_#t~ite29_Out-1848219569|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1848219569, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1848219569|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1848219569, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1848219569, ~weak$$choice2~0=~weak$$choice2~0_In-1848219569, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1848219569} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1848219569, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1848219569|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1848219569|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1848219569, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1848219569, ~weak$$choice2~0=~weak$$choice2~0_In-1848219569, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1848219569} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 20:43:06,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In1940558350 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1940558350 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1940558350 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1940558350 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1940558350| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1940558350| ~y$r_buff1_thd1~0_In1940558350) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1940558350, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1940558350, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1940558350, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1940558350} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1940558350, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1940558350, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1940558350|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1940558350, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1940558350} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 20:43:06,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L742-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_16, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} 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 20:43:06,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_15 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} 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_6, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 20:43:06,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-2142966102 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-2142966102 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-2142966102| ~y~0_In-2142966102)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-2142966102| ~y$w_buff1~0_In-2142966102) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2142966102, ~y$w_buff1~0=~y$w_buff1~0_In-2142966102, ~y~0=~y~0_In-2142966102, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2142966102} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2142966102, ~y$w_buff1~0=~y$w_buff1~0_In-2142966102, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-2142966102|, ~y~0=~y~0_In-2142966102, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2142966102} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 20:43:06,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_16 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 20:43:06,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1394925815 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1394925815 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1394925815|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out1394925815| ~y$w_buff0_used~0_In1394925815) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1394925815, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1394925815} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1394925815, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1394925815, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1394925815|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 20:43:06,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In243357692 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In243357692 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In243357692 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In243357692 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out243357692| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite35_Out243357692| ~y$w_buff1_used~0_In243357692)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In243357692, ~y$w_buff0_used~0=~y$w_buff0_used~0_In243357692, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In243357692, ~y$w_buff1_used~0=~y$w_buff1_used~0_In243357692} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In243357692, ~y$w_buff0_used~0=~y$w_buff0_used~0_In243357692, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In243357692, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out243357692|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In243357692} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 20:43:06,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1548838319 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1548838319 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1548838319| 0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In1548838319 |P1Thread1of1ForFork1_#t~ite36_Out1548838319|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1548838319, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1548838319} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1548838319, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1548838319, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1548838319|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 20:43:06,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1577899976 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1577899976 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1577899976 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1577899976 256)))) (or (and (= ~y$r_buff1_thd2~0_In1577899976 |P1Thread1of1ForFork1_#t~ite37_Out1577899976|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1577899976|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1577899976, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1577899976, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1577899976, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1577899976} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1577899976, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1577899976, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1577899976, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1577899976|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1577899976} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 20:43:06,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} 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 20:43:06,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_82 256)) (= (mod v_~y$r_buff0_thd0~0_17 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 20:43:06,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In629923318 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In629923318 256) 0))) (or (and (= ~y$w_buff1~0_In629923318 |ULTIMATE.start_main_#t~ite40_Out629923318|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out629923318| ~y~0_In629923318)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In629923318, ~y~0=~y~0_In629923318, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In629923318, ~y$w_buff1_used~0=~y$w_buff1_used~0_In629923318} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out629923318|, ~y$w_buff1~0=~y$w_buff1~0_In629923318, ~y~0=~y~0_In629923318, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In629923318, ~y$w_buff1_used~0=~y$w_buff1_used~0_In629923318} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 20:43:06,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 20:43:06,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In814051890 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In814051890 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In814051890 |ULTIMATE.start_main_#t~ite42_Out814051890|)) (and (= |ULTIMATE.start_main_#t~ite42_Out814051890| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In814051890, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In814051890} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In814051890, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In814051890, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out814051890|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:43:06,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1108483711 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1108483711 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1108483711 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1108483711 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1108483711| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out1108483711| ~y$w_buff1_used~0_In1108483711) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1108483711, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1108483711, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1108483711, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1108483711} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1108483711, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1108483711, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1108483711|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1108483711, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1108483711} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 20:43:06,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1446543151 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1446543151 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1446543151 |ULTIMATE.start_main_#t~ite44_Out1446543151|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1446543151|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1446543151, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1446543151} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1446543151, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1446543151, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1446543151|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:43:06,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-832451590 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-832451590 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-832451590 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-832451590 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-832451590| ~y$r_buff1_thd0~0_In-832451590) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite45_Out-832451590| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-832451590, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-832451590, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-832451590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-832451590} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-832451590, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-832451590, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-832451590, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-832451590|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-832451590} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:43:06,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_10| v_~y$r_buff1_thd0~0_14) (= 2 v_~__unbuffered_p1_EAX~0_7) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_7 0) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 2 v_~x~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~x~0=v_~x~0_9, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x~0=v_~x~0_9, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[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 20:43:06,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:43:06 BasicIcfg [2019-12-18 20:43:06,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:43:06,977 INFO L168 Benchmark]: Toolchain (without parser) took 16990.52 ms. Allocated memory was 146.3 MB in the beginning and 680.5 MB in the end (delta: 534.2 MB). Free memory was 101.9 MB in the beginning and 489.8 MB in the end (delta: -387.9 MB). Peak memory consumption was 146.4 MB. Max. memory is 7.1 GB. [2019-12-18 20:43:06,977 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 20:43:06,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 879.09 ms. Allocated memory was 146.3 MB in the beginning and 202.4 MB in the end (delta: 56.1 MB). Free memory was 101.5 MB in the beginning and 157.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:43:06,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.90 ms. Allocated memory is still 202.4 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:43:06,982 INFO L168 Benchmark]: Boogie Preprocessor took 37.30 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 20:43:06,983 INFO L168 Benchmark]: RCFGBuilder took 766.68 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 108.4 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-18 20:43:06,985 INFO L168 Benchmark]: TraceAbstraction took 15239.66 ms. Allocated memory was 202.4 MB in the beginning and 680.5 MB in the end (delta: 478.2 MB). Free memory was 107.8 MB in the beginning and 489.8 MB in the end (delta: -382.0 MB). Peak memory consumption was 96.2 MB. Max. memory is 7.1 GB. [2019-12-18 20:43:06,988 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.18 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 879.09 ms. Allocated memory was 146.3 MB in the beginning and 202.4 MB in the end (delta: 56.1 MB). Free memory was 101.5 MB in the beginning and 157.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.90 ms. Allocated memory is still 202.4 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.30 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 766.68 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 108.4 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15239.66 ms. Allocated memory was 202.4 MB in the beginning and 680.5 MB in the end (delta: 478.2 MB). Free memory was 107.8 MB in the beginning and 489.8 MB in the end (delta: -382.0 MB). Peak memory consumption was 96.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 29 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 27 ChoiceCompositions, 4371 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 55625 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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 [L799] FCALL, FORK 0 pthread_create(&t592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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) [L762] 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) [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 [L763] 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)) [L764] 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)) [L765] 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)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 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)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 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 [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L808] 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: 14.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1964 SDtfs, 2147 SDslu, 3601 SDs, 0 SdLazy, 2761 SolverSat, 178 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12389occurred 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.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 10392 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 436 ConstructedInterpolants, 0 QuantifiedInterpolants, 50628 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...