/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-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 03:22:46,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 03:22:46,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 03:22:46,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 03:22:46,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 03:22:46,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 03:22:46,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 03:22:46,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 03:22:46,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 03:22:46,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 03:22:46,782 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 03:22:46,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 03:22:46,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 03:22:46,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 03:22:46,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 03:22:46,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 03:22:46,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 03:22:46,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 03:22:46,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 03:22:46,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 03:22:46,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 03:22:46,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 03:22:46,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 03:22:46,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 03:22:46,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 03:22:46,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 03:22:46,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 03:22:46,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 03:22:46,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 03:22:46,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 03:22:46,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 03:22:46,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 03:22:46,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 03:22:46,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 03:22:46,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 03:22:46,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 03:22:46,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 03:22:46,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 03:22:46,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 03:22:46,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 03:22:46,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 03:22:46,827 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-NoLbe.epf [2019-12-19 03:22:46,860 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 03:22:46,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 03:22:46,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 03:22:46,865 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 03:22:46,865 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 03:22:46,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 03:22:46,866 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 03:22:46,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 03:22:46,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 03:22:46,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 03:22:46,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 03:22:46,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 03:22:46,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 03:22:46,869 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 03:22:46,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 03:22:46,869 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 03:22:46,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 03:22:46,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 03:22:46,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 03:22:46,870 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 03:22:46,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 03:22:46,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 03:22:46,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 03:22:46,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 03:22:46,871 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 03:22:46,871 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 03:22:46,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 03:22:46,872 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 03:22:46,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 03:22:46,873 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 03:22:47,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 03:22:47,191 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 03:22:47,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 03:22:47,198 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 03:22:47,199 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 03:22:47,200 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc.i [2019-12-19 03:22:47,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41094d04c/b244644eb6a4424bbb3d3a284efa6e9c/FLAG545bca1ad [2019-12-19 03:22:47,866 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 03:22:47,867 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc.i [2019-12-19 03:22:47,881 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41094d04c/b244644eb6a4424bbb3d3a284efa6e9c/FLAG545bca1ad [2019-12-19 03:22:48,115 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41094d04c/b244644eb6a4424bbb3d3a284efa6e9c [2019-12-19 03:22:48,123 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 03:22:48,125 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 03:22:48,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 03:22:48,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 03:22:48,130 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 03:22:48,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:22:48" (1/1) ... [2019-12-19 03:22:48,134 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45b49c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:22:48, skipping insertion in model container [2019-12-19 03:22:48,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:22:48" (1/1) ... [2019-12-19 03:22:48,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 03:22:48,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 03:22:48,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:22:48,775 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 03:22:48,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:22:48,951 INFO L208 MainTranslator]: Completed translation [2019-12-19 03:22:48,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:22:48 WrapperNode [2019-12-19 03:22:48,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 03:22:48,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 03:22:48,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 03:22:48,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 03:22:48,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:22:48" (1/1) ... [2019-12-19 03:22:48,983 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:22:48" (1/1) ... [2019-12-19 03:22:49,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 03:22:49,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 03:22:49,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 03:22:49,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 03:22:49,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:22:48" (1/1) ... [2019-12-19 03:22:49,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:22:48" (1/1) ... [2019-12-19 03:22:49,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:22:48" (1/1) ... [2019-12-19 03:22:49,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:22:48" (1/1) ... [2019-12-19 03:22:49,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:22:48" (1/1) ... [2019-12-19 03:22:49,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:22:48" (1/1) ... [2019-12-19 03:22:49,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:22:48" (1/1) ... [2019-12-19 03:22:49,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 03:22:49,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 03:22:49,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 03:22:49,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 03:22:49,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:22:48" (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-19 03:22:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 03:22:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 03:22:49,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 03:22:49,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 03:22:49,144 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 03:22:49,144 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 03:22:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 03:22:49,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 03:22:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 03:22:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 03:22:49,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 03:22:49,147 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 03:22:49,918 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 03:22:49,918 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 03:22:49,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:22:49 BoogieIcfgContainer [2019-12-19 03:22:49,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 03:22:49,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 03:22:49,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 03:22:49,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 03:22:49,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:22:48" (1/3) ... [2019-12-19 03:22:49,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332b6a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:22:49, skipping insertion in model container [2019-12-19 03:22:49,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:22:48" (2/3) ... [2019-12-19 03:22:49,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332b6a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:22:49, skipping insertion in model container [2019-12-19 03:22:49,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:22:49" (3/3) ... [2019-12-19 03:22:49,936 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc.i [2019-12-19 03:22:49,947 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 03:22:49,948 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 03:22:49,963 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 03:22:49,964 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 03:22:50,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,002 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,003 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,003 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,004 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,004 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,013 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,014 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,068 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,068 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,069 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,075 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,077 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:22:50,094 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 03:22:50,115 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 03:22:50,115 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 03:22:50,115 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 03:22:50,115 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 03:22:50,116 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 03:22:50,116 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 03:22:50,116 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 03:22:50,116 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 03:22:50,130 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 180 transitions [2019-12-19 03:22:52,241 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32590 states. [2019-12-19 03:22:52,243 INFO L276 IsEmpty]: Start isEmpty. Operand 32590 states. [2019-12-19 03:22:52,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-19 03:22:52,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:22:52,251 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] [2019-12-19 03:22:52,251 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:22:52,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:22:52,257 INFO L82 PathProgramCache]: Analyzing trace with hash -334571497, now seen corresponding path program 1 times [2019-12-19 03:22:52,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:22:52,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314913976] [2019-12-19 03:22:52,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:22:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:22:52,574 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-19 03:22:52,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314913976] [2019-12-19 03:22:52,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:22:52,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:22:52,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447001124] [2019-12-19 03:22:52,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:22:52,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:22:52,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:22:52,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:22:52,609 INFO L87 Difference]: Start difference. First operand 32590 states. Second operand 4 states. [2019-12-19 03:22:53,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:22:53,499 INFO L93 Difference]: Finished difference Result 33590 states and 129567 transitions. [2019-12-19 03:22:53,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:22:53,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-19 03:22:53,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:22:53,812 INFO L225 Difference]: With dead ends: 33590 [2019-12-19 03:22:53,813 INFO L226 Difference]: Without dead ends: 25702 [2019-12-19 03:22:53,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:22:55,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-12-19 03:22:56,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 25702. [2019-12-19 03:22:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25702 states. [2019-12-19 03:22:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25702 states to 25702 states and 99583 transitions. [2019-12-19 03:22:56,254 INFO L78 Accepts]: Start accepts. Automaton has 25702 states and 99583 transitions. Word has length 33 [2019-12-19 03:22:56,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:22:56,256 INFO L462 AbstractCegarLoop]: Abstraction has 25702 states and 99583 transitions. [2019-12-19 03:22:56,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:22:56,256 INFO L276 IsEmpty]: Start isEmpty. Operand 25702 states and 99583 transitions. [2019-12-19 03:22:56,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-19 03:22:56,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:22:56,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:22:56,270 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:22:56,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:22:56,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1021806200, now seen corresponding path program 1 times [2019-12-19 03:22:56,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:22:56,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819185657] [2019-12-19 03:22:56,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:22:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:22:56,431 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-19 03:22:56,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819185657] [2019-12-19 03:22:56,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:22:56,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:22:56,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654658964] [2019-12-19 03:22:56,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:22:56,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:22:56,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:22:56,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:22:56,435 INFO L87 Difference]: Start difference. First operand 25702 states and 99583 transitions. Second operand 5 states. [2019-12-19 03:22:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:22:57,322 INFO L93 Difference]: Finished difference Result 41080 states and 150430 transitions. [2019-12-19 03:22:57,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:22:57,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-19 03:22:57,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:22:58,740 INFO L225 Difference]: With dead ends: 41080 [2019-12-19 03:22:58,740 INFO L226 Difference]: Without dead ends: 40544 [2019-12-19 03:22:58,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:22:59,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40544 states. [2019-12-19 03:22:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40544 to 38924. [2019-12-19 03:22:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38924 states. [2019-12-19 03:23:00,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38924 states to 38924 states and 143580 transitions. [2019-12-19 03:23:00,088 INFO L78 Accepts]: Start accepts. Automaton has 38924 states and 143580 transitions. Word has length 45 [2019-12-19 03:23:00,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:00,090 INFO L462 AbstractCegarLoop]: Abstraction has 38924 states and 143580 transitions. [2019-12-19 03:23:00,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:23:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 38924 states and 143580 transitions. [2019-12-19 03:23:00,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-19 03:23:00,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:00,096 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] [2019-12-19 03:23:00,097 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:00,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:00,097 INFO L82 PathProgramCache]: Analyzing trace with hash -169129071, now seen corresponding path program 1 times [2019-12-19 03:23:00,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:00,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996973386] [2019-12-19 03:23:00,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:00,170 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-19 03:23:00,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996973386] [2019-12-19 03:23:00,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:00,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:23:00,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900340111] [2019-12-19 03:23:00,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:23:00,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:00,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:23:00,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:23:00,173 INFO L87 Difference]: Start difference. First operand 38924 states and 143580 transitions. Second operand 5 states. [2019-12-19 03:23:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:01,047 INFO L93 Difference]: Finished difference Result 49777 states and 180632 transitions. [2019-12-19 03:23:01,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:23:01,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-19 03:23:01,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:01,204 INFO L225 Difference]: With dead ends: 49777 [2019-12-19 03:23:01,204 INFO L226 Difference]: Without dead ends: 49273 [2019-12-19 03:23:01,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:23:01,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49273 states. [2019-12-19 03:23:03,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49273 to 42676. [2019-12-19 03:23:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42676 states. [2019-12-19 03:23:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42676 states to 42676 states and 156591 transitions. [2019-12-19 03:23:03,852 INFO L78 Accepts]: Start accepts. Automaton has 42676 states and 156591 transitions. Word has length 46 [2019-12-19 03:23:03,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:03,853 INFO L462 AbstractCegarLoop]: Abstraction has 42676 states and 156591 transitions. [2019-12-19 03:23:03,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:23:03,853 INFO L276 IsEmpty]: Start isEmpty. Operand 42676 states and 156591 transitions. [2019-12-19 03:23:03,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-19 03:23:03,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:03,869 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] [2019-12-19 03:23:03,870 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:03,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:03,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1646950391, now seen corresponding path program 1 times [2019-12-19 03:23:03,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:03,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433270557] [2019-12-19 03:23:03,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:03,952 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-19 03:23:03,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433270557] [2019-12-19 03:23:03,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:03,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:23:03,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771377989] [2019-12-19 03:23:03,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:23:03,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:03,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:23:03,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:23:03,955 INFO L87 Difference]: Start difference. First operand 42676 states and 156591 transitions. Second operand 3 states. [2019-12-19 03:23:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:04,656 INFO L93 Difference]: Finished difference Result 61086 states and 221429 transitions. [2019-12-19 03:23:04,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:23:04,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-19 03:23:04,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:04,855 INFO L225 Difference]: With dead ends: 61086 [2019-12-19 03:23:04,855 INFO L226 Difference]: Without dead ends: 61086 [2019-12-19 03:23:04,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:23:05,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61086 states. [2019-12-19 03:23:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61086 to 48015. [2019-12-19 03:23:07,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48015 states. [2019-12-19 03:23:07,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48015 states to 48015 states and 174178 transitions. [2019-12-19 03:23:07,824 INFO L78 Accepts]: Start accepts. Automaton has 48015 states and 174178 transitions. Word has length 48 [2019-12-19 03:23:07,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:07,825 INFO L462 AbstractCegarLoop]: Abstraction has 48015 states and 174178 transitions. [2019-12-19 03:23:07,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:23:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand 48015 states and 174178 transitions. [2019-12-19 03:23:07,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 03:23:07,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:07,842 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-19 03:23:07,842 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:07,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:07,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2087627749, now seen corresponding path program 1 times [2019-12-19 03:23:07,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:07,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843096251] [2019-12-19 03:23:07,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:07,970 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-19 03:23:07,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843096251] [2019-12-19 03:23:07,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:07,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:23:07,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313165385] [2019-12-19 03:23:07,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:23:07,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:07,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:23:07,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:23:07,972 INFO L87 Difference]: Start difference. First operand 48015 states and 174178 transitions. Second operand 6 states. [2019-12-19 03:23:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:08,906 INFO L93 Difference]: Finished difference Result 63755 states and 229378 transitions. [2019-12-19 03:23:08,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:23:08,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-19 03:23:08,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:09,047 INFO L225 Difference]: With dead ends: 63755 [2019-12-19 03:23:09,047 INFO L226 Difference]: Without dead ends: 63755 [2019-12-19 03:23:09,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:23:09,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63755 states. [2019-12-19 03:23:10,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63755 to 59948. [2019-12-19 03:23:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59948 states. [2019-12-19 03:23:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59948 states to 59948 states and 215671 transitions. [2019-12-19 03:23:13,487 INFO L78 Accepts]: Start accepts. Automaton has 59948 states and 215671 transitions. Word has length 52 [2019-12-19 03:23:13,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:13,487 INFO L462 AbstractCegarLoop]: Abstraction has 59948 states and 215671 transitions. [2019-12-19 03:23:13,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:23:13,487 INFO L276 IsEmpty]: Start isEmpty. Operand 59948 states and 215671 transitions. [2019-12-19 03:23:13,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 03:23:13,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:13,505 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-19 03:23:13,505 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:13,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:13,506 INFO L82 PathProgramCache]: Analyzing trace with hash 290676390, now seen corresponding path program 1 times [2019-12-19 03:23:13,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:13,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433919482] [2019-12-19 03:23:13,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:13,621 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-19 03:23:13,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433919482] [2019-12-19 03:23:13,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:13,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:23:13,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179925108] [2019-12-19 03:23:13,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:23:13,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:13,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:23:13,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:23:13,623 INFO L87 Difference]: Start difference. First operand 59948 states and 215671 transitions. Second operand 7 states. [2019-12-19 03:23:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:15,046 INFO L93 Difference]: Finished difference Result 83684 states and 290096 transitions. [2019-12-19 03:23:15,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:23:15,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-19 03:23:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:15,225 INFO L225 Difference]: With dead ends: 83684 [2019-12-19 03:23:15,225 INFO L226 Difference]: Without dead ends: 83684 [2019-12-19 03:23:15,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:23:15,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83684 states. [2019-12-19 03:23:16,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83684 to 71011. [2019-12-19 03:23:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71011 states. [2019-12-19 03:23:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71011 states to 71011 states and 249885 transitions. [2019-12-19 03:23:16,875 INFO L78 Accepts]: Start accepts. Automaton has 71011 states and 249885 transitions. Word has length 52 [2019-12-19 03:23:16,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:16,875 INFO L462 AbstractCegarLoop]: Abstraction has 71011 states and 249885 transitions. [2019-12-19 03:23:16,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:23:16,876 INFO L276 IsEmpty]: Start isEmpty. Operand 71011 states and 249885 transitions. [2019-12-19 03:23:16,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 03:23:16,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:16,890 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-19 03:23:16,890 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:16,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:16,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1178180071, now seen corresponding path program 1 times [2019-12-19 03:23:16,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:16,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077699364] [2019-12-19 03:23:16,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:16,972 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-19 03:23:16,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077699364] [2019-12-19 03:23:16,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:16,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:23:16,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306621522] [2019-12-19 03:23:16,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:23:16,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:16,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:23:16,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:23:16,975 INFO L87 Difference]: Start difference. First operand 71011 states and 249885 transitions. Second operand 4 states. [2019-12-19 03:23:17,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:17,054 INFO L93 Difference]: Finished difference Result 12158 states and 37828 transitions. [2019-12-19 03:23:17,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:23:17,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-19 03:23:17,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:17,576 INFO L225 Difference]: With dead ends: 12158 [2019-12-19 03:23:17,576 INFO L226 Difference]: Without dead ends: 10673 [2019-12-19 03:23:17,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-19 03:23:17,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10673 states. [2019-12-19 03:23:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10673 to 10624. [2019-12-19 03:23:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10624 states. [2019-12-19 03:23:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10624 states to 10624 states and 32590 transitions. [2019-12-19 03:23:17,736 INFO L78 Accepts]: Start accepts. Automaton has 10624 states and 32590 transitions. Word has length 52 [2019-12-19 03:23:17,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:17,736 INFO L462 AbstractCegarLoop]: Abstraction has 10624 states and 32590 transitions. [2019-12-19 03:23:17,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:23:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 10624 states and 32590 transitions. [2019-12-19 03:23:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 03:23:17,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:17,738 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-19 03:23:17,738 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:17,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:17,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1257036994, now seen corresponding path program 1 times [2019-12-19 03:23:17,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:17,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432696285] [2019-12-19 03:23:17,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:17,803 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-19 03:23:17,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432696285] [2019-12-19 03:23:17,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:17,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:23:17,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853611320] [2019-12-19 03:23:17,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:23:17,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:17,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:23:17,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:23:17,805 INFO L87 Difference]: Start difference. First operand 10624 states and 32590 transitions. Second operand 6 states. [2019-12-19 03:23:18,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:18,315 INFO L93 Difference]: Finished difference Result 13181 states and 39871 transitions. [2019-12-19 03:23:18,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 03:23:18,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-19 03:23:18,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:18,336 INFO L225 Difference]: With dead ends: 13181 [2019-12-19 03:23:18,336 INFO L226 Difference]: Without dead ends: 13118 [2019-12-19 03:23:18,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-19 03:23:18,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13118 states. [2019-12-19 03:23:18,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13118 to 11047. [2019-12-19 03:23:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11047 states. [2019-12-19 03:23:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11047 states to 11047 states and 33784 transitions. [2019-12-19 03:23:18,490 INFO L78 Accepts]: Start accepts. Automaton has 11047 states and 33784 transitions. Word has length 52 [2019-12-19 03:23:18,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:18,491 INFO L462 AbstractCegarLoop]: Abstraction has 11047 states and 33784 transitions. [2019-12-19 03:23:18,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:23:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 11047 states and 33784 transitions. [2019-12-19 03:23:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 03:23:18,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:18,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:23:18,495 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:18,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:18,495 INFO L82 PathProgramCache]: Analyzing trace with hash -575967074, now seen corresponding path program 1 times [2019-12-19 03:23:18,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:18,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117420207] [2019-12-19 03:23:18,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:18,551 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-19 03:23:18,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117420207] [2019-12-19 03:23:18,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:18,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:23:18,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944894453] [2019-12-19 03:23:18,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:23:18,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:18,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:23:18,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:23:18,557 INFO L87 Difference]: Start difference. First operand 11047 states and 33784 transitions. Second operand 4 states. [2019-12-19 03:23:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:18,704 INFO L93 Difference]: Finished difference Result 12861 states and 39390 transitions. [2019-12-19 03:23:18,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:23:18,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-19 03:23:18,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:18,723 INFO L225 Difference]: With dead ends: 12861 [2019-12-19 03:23:18,723 INFO L226 Difference]: Without dead ends: 12861 [2019-12-19 03:23:18,723 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-19 03:23:18,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-19 03:23:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 11692. [2019-12-19 03:23:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11692 states. [2019-12-19 03:23:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11692 states to 11692 states and 35761 transitions. [2019-12-19 03:23:18,882 INFO L78 Accepts]: Start accepts. Automaton has 11692 states and 35761 transitions. Word has length 60 [2019-12-19 03:23:18,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:18,882 INFO L462 AbstractCegarLoop]: Abstraction has 11692 states and 35761 transitions. [2019-12-19 03:23:18,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:23:18,882 INFO L276 IsEmpty]: Start isEmpty. Operand 11692 states and 35761 transitions. [2019-12-19 03:23:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 03:23:18,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:18,886 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:23:18,886 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:18,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:18,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1166843261, now seen corresponding path program 1 times [2019-12-19 03:23:18,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:18,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161933552] [2019-12-19 03:23:18,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:18,995 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-19 03:23:18,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161933552] [2019-12-19 03:23:18,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:18,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:23:18,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069507692] [2019-12-19 03:23:18,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:23:18,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:18,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:23:18,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:23:18,998 INFO L87 Difference]: Start difference. First operand 11692 states and 35761 transitions. Second operand 6 states. [2019-12-19 03:23:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:19,559 INFO L93 Difference]: Finished difference Result 14218 states and 42859 transitions. [2019-12-19 03:23:19,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 03:23:19,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-19 03:23:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:19,588 INFO L225 Difference]: With dead ends: 14218 [2019-12-19 03:23:19,588 INFO L226 Difference]: Without dead ends: 14157 [2019-12-19 03:23:19,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:23:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14157 states. [2019-12-19 03:23:19,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14157 to 13460. [2019-12-19 03:23:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13460 states. [2019-12-19 03:23:19,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13460 states to 13460 states and 40778 transitions. [2019-12-19 03:23:19,794 INFO L78 Accepts]: Start accepts. Automaton has 13460 states and 40778 transitions. Word has length 60 [2019-12-19 03:23:19,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:19,794 INFO L462 AbstractCegarLoop]: Abstraction has 13460 states and 40778 transitions. [2019-12-19 03:23:19,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:23:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 13460 states and 40778 transitions. [2019-12-19 03:23:19,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 03:23:19,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:19,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:23:19,802 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:19,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:19,803 INFO L82 PathProgramCache]: Analyzing trace with hash -365592073, now seen corresponding path program 1 times [2019-12-19 03:23:19,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:19,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779903525] [2019-12-19 03:23:19,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:19,866 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-19 03:23:19,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779903525] [2019-12-19 03:23:19,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:19,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:23:19,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488160015] [2019-12-19 03:23:19,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:23:19,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:19,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:23:19,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:23:19,868 INFO L87 Difference]: Start difference. First operand 13460 states and 40778 transitions. Second operand 4 states. [2019-12-19 03:23:20,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:20,340 INFO L93 Difference]: Finished difference Result 16502 states and 49370 transitions. [2019-12-19 03:23:20,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:23:20,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-19 03:23:20,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:20,364 INFO L225 Difference]: With dead ends: 16502 [2019-12-19 03:23:20,365 INFO L226 Difference]: Without dead ends: 16502 [2019-12-19 03:23:20,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:23:20,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16502 states. [2019-12-19 03:23:20,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16502 to 14981. [2019-12-19 03:23:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14981 states. [2019-12-19 03:23:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14981 states to 14981 states and 44959 transitions. [2019-12-19 03:23:20,565 INFO L78 Accepts]: Start accepts. Automaton has 14981 states and 44959 transitions. Word has length 64 [2019-12-19 03:23:20,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:20,565 INFO L462 AbstractCegarLoop]: Abstraction has 14981 states and 44959 transitions. [2019-12-19 03:23:20,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:23:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand 14981 states and 44959 transitions. [2019-12-19 03:23:20,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 03:23:20,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:20,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:23:20,573 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:20,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:20,574 INFO L82 PathProgramCache]: Analyzing trace with hash 327509624, now seen corresponding path program 1 times [2019-12-19 03:23:20,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:20,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519798632] [2019-12-19 03:23:20,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:20,624 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-19 03:23:20,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519798632] [2019-12-19 03:23:20,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:20,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:23:20,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503809932] [2019-12-19 03:23:20,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:23:20,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:20,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:23:20,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:23:20,626 INFO L87 Difference]: Start difference. First operand 14981 states and 44959 transitions. Second operand 3 states. [2019-12-19 03:23:20,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:20,900 INFO L93 Difference]: Finished difference Result 15529 states and 46402 transitions. [2019-12-19 03:23:20,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:23:20,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-19 03:23:20,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:20,933 INFO L225 Difference]: With dead ends: 15529 [2019-12-19 03:23:20,933 INFO L226 Difference]: Without dead ends: 15529 [2019-12-19 03:23:20,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:23:20,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15529 states. [2019-12-19 03:23:21,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15529 to 15275. [2019-12-19 03:23:21,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15275 states. [2019-12-19 03:23:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15275 states to 15275 states and 45727 transitions. [2019-12-19 03:23:21,155 INFO L78 Accepts]: Start accepts. Automaton has 15275 states and 45727 transitions. Word has length 64 [2019-12-19 03:23:21,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:21,155 INFO L462 AbstractCegarLoop]: Abstraction has 15275 states and 45727 transitions. [2019-12-19 03:23:21,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:23:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 15275 states and 45727 transitions. [2019-12-19 03:23:21,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:23:21,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:21,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:23:21,168 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:21,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:21,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1571759684, now seen corresponding path program 1 times [2019-12-19 03:23:21,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:21,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403959604] [2019-12-19 03:23:21,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:21,300 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-19 03:23:21,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403959604] [2019-12-19 03:23:21,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:21,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:23:21,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572917622] [2019-12-19 03:23:21,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:23:21,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:21,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:23:21,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:23:21,303 INFO L87 Difference]: Start difference. First operand 15275 states and 45727 transitions. Second operand 6 states. [2019-12-19 03:23:21,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:21,887 INFO L93 Difference]: Finished difference Result 16272 states and 48102 transitions. [2019-12-19 03:23:21,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:23:21,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-19 03:23:21,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:21,909 INFO L225 Difference]: With dead ends: 16272 [2019-12-19 03:23:21,909 INFO L226 Difference]: Without dead ends: 16272 [2019-12-19 03:23:21,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:23:21,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16272 states. [2019-12-19 03:23:22,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16272 to 15848. [2019-12-19 03:23:22,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15848 states. [2019-12-19 03:23:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15848 states to 15848 states and 47024 transitions. [2019-12-19 03:23:22,101 INFO L78 Accepts]: Start accepts. Automaton has 15848 states and 47024 transitions. Word has length 66 [2019-12-19 03:23:22,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:22,101 INFO L462 AbstractCegarLoop]: Abstraction has 15848 states and 47024 transitions. [2019-12-19 03:23:22,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:23:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 15848 states and 47024 transitions. [2019-12-19 03:23:22,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:23:22,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:22,110 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:23:22,110 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:22,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:22,110 INFO L82 PathProgramCache]: Analyzing trace with hash -878657987, now seen corresponding path program 1 times [2019-12-19 03:23:22,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:22,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108553073] [2019-12-19 03:23:22,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:22,193 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-19 03:23:22,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108553073] [2019-12-19 03:23:22,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:22,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:23:22,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534010234] [2019-12-19 03:23:22,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:23:22,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:22,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:23:22,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:23:22,195 INFO L87 Difference]: Start difference. First operand 15848 states and 47024 transitions. Second operand 6 states. [2019-12-19 03:23:22,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:22,903 INFO L93 Difference]: Finished difference Result 18159 states and 52352 transitions. [2019-12-19 03:23:22,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 03:23:22,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-19 03:23:22,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:22,930 INFO L225 Difference]: With dead ends: 18159 [2019-12-19 03:23:22,930 INFO L226 Difference]: Without dead ends: 18159 [2019-12-19 03:23:22,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 03:23:22,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18159 states. [2019-12-19 03:23:23,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18159 to 16540. [2019-12-19 03:23:23,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16540 states. [2019-12-19 03:23:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16540 states to 16540 states and 48244 transitions. [2019-12-19 03:23:23,145 INFO L78 Accepts]: Start accepts. Automaton has 16540 states and 48244 transitions. Word has length 66 [2019-12-19 03:23:23,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:23,145 INFO L462 AbstractCegarLoop]: Abstraction has 16540 states and 48244 transitions. [2019-12-19 03:23:23,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:23:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 16540 states and 48244 transitions. [2019-12-19 03:23:23,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:23:23,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:23,155 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:23:23,155 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:23,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:23,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1339099966, now seen corresponding path program 1 times [2019-12-19 03:23:23,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:23,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443729627] [2019-12-19 03:23:23,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:23,261 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-19 03:23:23,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443729627] [2019-12-19 03:23:23,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:23,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:23:23,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224402202] [2019-12-19 03:23:23,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:23:23,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:23,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:23:23,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:23:23,263 INFO L87 Difference]: Start difference. First operand 16540 states and 48244 transitions. Second operand 5 states. [2019-12-19 03:23:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:23,695 INFO L93 Difference]: Finished difference Result 21454 states and 62484 transitions. [2019-12-19 03:23:23,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:23:23,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-19 03:23:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:23,725 INFO L225 Difference]: With dead ends: 21454 [2019-12-19 03:23:23,726 INFO L226 Difference]: Without dead ends: 21454 [2019-12-19 03:23:23,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:23:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21454 states. [2019-12-19 03:23:23,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21454 to 19519. [2019-12-19 03:23:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19519 states. [2019-12-19 03:23:23,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19519 states to 19519 states and 56653 transitions. [2019-12-19 03:23:23,982 INFO L78 Accepts]: Start accepts. Automaton has 19519 states and 56653 transitions. Word has length 66 [2019-12-19 03:23:23,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:23,982 INFO L462 AbstractCegarLoop]: Abstraction has 19519 states and 56653 transitions. [2019-12-19 03:23:23,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:23:23,982 INFO L276 IsEmpty]: Start isEmpty. Operand 19519 states and 56653 transitions. [2019-12-19 03:23:23,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:23:23,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:23,993 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:23:23,993 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:23,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:23,993 INFO L82 PathProgramCache]: Analyzing trace with hash 828565789, now seen corresponding path program 1 times [2019-12-19 03:23:23,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:23,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542662595] [2019-12-19 03:23:23,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:24,054 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-19 03:23:24,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542662595] [2019-12-19 03:23:24,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:24,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:23:24,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271537306] [2019-12-19 03:23:24,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:23:24,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:24,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:23:24,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:23:24,056 INFO L87 Difference]: Start difference. First operand 19519 states and 56653 transitions. Second operand 5 states. [2019-12-19 03:23:24,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:24,597 INFO L93 Difference]: Finished difference Result 26406 states and 76311 transitions. [2019-12-19 03:23:24,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:23:24,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-19 03:23:24,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:24,634 INFO L225 Difference]: With dead ends: 26406 [2019-12-19 03:23:24,634 INFO L226 Difference]: Without dead ends: 26406 [2019-12-19 03:23:24,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:23:24,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26406 states. [2019-12-19 03:23:24,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26406 to 21407. [2019-12-19 03:23:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21407 states. [2019-12-19 03:23:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21407 states to 21407 states and 61927 transitions. [2019-12-19 03:23:24,933 INFO L78 Accepts]: Start accepts. Automaton has 21407 states and 61927 transitions. Word has length 66 [2019-12-19 03:23:24,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:24,933 INFO L462 AbstractCegarLoop]: Abstraction has 21407 states and 61927 transitions. [2019-12-19 03:23:24,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:23:24,934 INFO L276 IsEmpty]: Start isEmpty. Operand 21407 states and 61927 transitions. [2019-12-19 03:23:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:23:24,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:24,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:23:24,946 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:24,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:24,947 INFO L82 PathProgramCache]: Analyzing trace with hash -978888674, now seen corresponding path program 1 times [2019-12-19 03:23:24,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:24,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502291342] [2019-12-19 03:23:24,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:25,275 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-19 03:23:25,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502291342] [2019-12-19 03:23:25,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:25,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:23:25,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486891608] [2019-12-19 03:23:25,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:23:25,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:25,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:23:25,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:23:25,278 INFO L87 Difference]: Start difference. First operand 21407 states and 61927 transitions. Second operand 4 states. [2019-12-19 03:23:25,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:25,943 INFO L93 Difference]: Finished difference Result 27968 states and 81349 transitions. [2019-12-19 03:23:25,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:23:25,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-19 03:23:25,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:25,986 INFO L225 Difference]: With dead ends: 27968 [2019-12-19 03:23:25,986 INFO L226 Difference]: Without dead ends: 27833 [2019-12-19 03:23:25,986 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-19 03:23:26,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27833 states. [2019-12-19 03:23:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27833 to 25844. [2019-12-19 03:23:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25844 states. [2019-12-19 03:23:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25844 states to 25844 states and 75187 transitions. [2019-12-19 03:23:26,337 INFO L78 Accepts]: Start accepts. Automaton has 25844 states and 75187 transitions. Word has length 66 [2019-12-19 03:23:26,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:26,337 INFO L462 AbstractCegarLoop]: Abstraction has 25844 states and 75187 transitions. [2019-12-19 03:23:26,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:23:26,337 INFO L276 IsEmpty]: Start isEmpty. Operand 25844 states and 75187 transitions. [2019-12-19 03:23:26,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:23:26,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:26,346 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:23:26,346 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:26,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:26,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1519127263, now seen corresponding path program 1 times [2019-12-19 03:23:26,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:26,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708761783] [2019-12-19 03:23:26,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:26,468 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-19 03:23:26,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708761783] [2019-12-19 03:23:26,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:26,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:23:26,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720146567] [2019-12-19 03:23:26,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:23:26,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:26,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:23:26,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:23:26,470 INFO L87 Difference]: Start difference. First operand 25844 states and 75187 transitions. Second operand 7 states. [2019-12-19 03:23:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:27,029 INFO L93 Difference]: Finished difference Result 23112 states and 64209 transitions. [2019-12-19 03:23:27,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 03:23:27,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-19 03:23:27,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:27,059 INFO L225 Difference]: With dead ends: 23112 [2019-12-19 03:23:27,059 INFO L226 Difference]: Without dead ends: 23112 [2019-12-19 03:23:27,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:23:27,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23112 states. [2019-12-19 03:23:27,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23112 to 18808. [2019-12-19 03:23:27,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18808 states. [2019-12-19 03:23:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18808 states to 18808 states and 52244 transitions. [2019-12-19 03:23:27,311 INFO L78 Accepts]: Start accepts. Automaton has 18808 states and 52244 transitions. Word has length 66 [2019-12-19 03:23:27,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:27,311 INFO L462 AbstractCegarLoop]: Abstraction has 18808 states and 52244 transitions. [2019-12-19 03:23:27,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:23:27,311 INFO L276 IsEmpty]: Start isEmpty. Operand 18808 states and 52244 transitions. [2019-12-19 03:23:27,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:23:27,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:27,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:23:27,318 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:27,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:27,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1888336352, now seen corresponding path program 1 times [2019-12-19 03:23:27,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:27,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525990701] [2019-12-19 03:23:27,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:27,404 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-19 03:23:27,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525990701] [2019-12-19 03:23:27,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:27,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:23:27,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100340546] [2019-12-19 03:23:27,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:23:27,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:27,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:23:27,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:23:27,407 INFO L87 Difference]: Start difference. First operand 18808 states and 52244 transitions. Second operand 5 states. [2019-12-19 03:23:27,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:27,469 INFO L93 Difference]: Finished difference Result 6130 states and 14461 transitions. [2019-12-19 03:23:27,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:23:27,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-19 03:23:27,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:27,476 INFO L225 Difference]: With dead ends: 6130 [2019-12-19 03:23:27,476 INFO L226 Difference]: Without dead ends: 5260 [2019-12-19 03:23:27,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-19 03:23:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2019-12-19 03:23:27,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 4725. [2019-12-19 03:23:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-12-19 03:23:27,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 10820 transitions. [2019-12-19 03:23:27,523 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 10820 transitions. Word has length 66 [2019-12-19 03:23:27,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:27,523 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 10820 transitions. [2019-12-19 03:23:27,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:23:27,523 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 10820 transitions. [2019-12-19 03:23:27,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:23:27,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:27,527 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:23:27,527 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:27,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:27,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1090796306, now seen corresponding path program 1 times [2019-12-19 03:23:27,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:27,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471209759] [2019-12-19 03:23:27,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:27,567 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-19 03:23:27,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471209759] [2019-12-19 03:23:27,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:27,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:23:27,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129650028] [2019-12-19 03:23:27,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:23:27,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:27,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:23:27,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:23:27,569 INFO L87 Difference]: Start difference. First operand 4725 states and 10820 transitions. Second operand 3 states. [2019-12-19 03:23:27,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:27,611 INFO L93 Difference]: Finished difference Result 5855 states and 13186 transitions. [2019-12-19 03:23:27,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:23:27,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-19 03:23:27,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:27,620 INFO L225 Difference]: With dead ends: 5855 [2019-12-19 03:23:27,620 INFO L226 Difference]: Without dead ends: 5855 [2019-12-19 03:23:27,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:23:27,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2019-12-19 03:23:27,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 4660. [2019-12-19 03:23:27,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-19 03:23:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 10382 transitions. [2019-12-19 03:23:27,697 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 10382 transitions. Word has length 66 [2019-12-19 03:23:27,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:27,698 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 10382 transitions. [2019-12-19 03:23:27,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:23:27,698 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 10382 transitions. [2019-12-19 03:23:27,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-19 03:23:27,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:27,704 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:23:27,704 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:27,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:27,704 INFO L82 PathProgramCache]: Analyzing trace with hash -2889151, now seen corresponding path program 1 times [2019-12-19 03:23:27,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:27,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327839359] [2019-12-19 03:23:27,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:27,757 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-19 03:23:27,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327839359] [2019-12-19 03:23:27,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:27,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:23:27,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342597215] [2019-12-19 03:23:27,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:23:27,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:27,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:23:27,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:23:27,759 INFO L87 Difference]: Start difference. First operand 4660 states and 10382 transitions. Second operand 5 states. [2019-12-19 03:23:28,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:28,016 INFO L93 Difference]: Finished difference Result 5721 states and 12811 transitions. [2019-12-19 03:23:28,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 03:23:28,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-12-19 03:23:28,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:28,026 INFO L225 Difference]: With dead ends: 5721 [2019-12-19 03:23:28,026 INFO L226 Difference]: Without dead ends: 5721 [2019-12-19 03:23:28,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 03:23:28,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5721 states. [2019-12-19 03:23:28,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5721 to 5080. [2019-12-19 03:23:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5080 states. [2019-12-19 03:23:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 11340 transitions. [2019-12-19 03:23:28,134 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 11340 transitions. Word has length 72 [2019-12-19 03:23:28,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:28,134 INFO L462 AbstractCegarLoop]: Abstraction has 5080 states and 11340 transitions. [2019-12-19 03:23:28,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:23:28,134 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 11340 transitions. [2019-12-19 03:23:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-19 03:23:28,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:28,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:23:28,144 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:28,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:28,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1739921184, now seen corresponding path program 1 times [2019-12-19 03:23:28,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:28,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509180259] [2019-12-19 03:23:28,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:28,226 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-19 03:23:28,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509180259] [2019-12-19 03:23:28,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:28,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:23:28,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77850743] [2019-12-19 03:23:28,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:23:28,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:28,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:23:28,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:23:28,229 INFO L87 Difference]: Start difference. First operand 5080 states and 11340 transitions. Second operand 7 states. [2019-12-19 03:23:28,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:28,838 INFO L93 Difference]: Finished difference Result 5820 states and 12863 transitions. [2019-12-19 03:23:28,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 03:23:28,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-12-19 03:23:28,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:28,848 INFO L225 Difference]: With dead ends: 5820 [2019-12-19 03:23:28,848 INFO L226 Difference]: Without dead ends: 5767 [2019-12-19 03:23:28,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-19 03:23:28,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2019-12-19 03:23:28,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5167. [2019-12-19 03:23:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5167 states. [2019-12-19 03:23:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5167 states to 5167 states and 11429 transitions. [2019-12-19 03:23:28,962 INFO L78 Accepts]: Start accepts. Automaton has 5167 states and 11429 transitions. Word has length 72 [2019-12-19 03:23:28,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:28,962 INFO L462 AbstractCegarLoop]: Abstraction has 5167 states and 11429 transitions. [2019-12-19 03:23:28,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:23:28,963 INFO L276 IsEmpty]: Start isEmpty. Operand 5167 states and 11429 transitions. [2019-12-19 03:23:28,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 03:23:28,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:28,972 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:23:28,972 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:28,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:28,972 INFO L82 PathProgramCache]: Analyzing trace with hash 97446499, now seen corresponding path program 1 times [2019-12-19 03:23:28,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:28,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236821722] [2019-12-19 03:23:28,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:29,057 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-19 03:23:29,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236821722] [2019-12-19 03:23:29,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:29,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:23:29,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267451044] [2019-12-19 03:23:29,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:23:29,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:29,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:23:29,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:23:29,061 INFO L87 Difference]: Start difference. First operand 5167 states and 11429 transitions. Second operand 5 states. [2019-12-19 03:23:29,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:29,393 INFO L93 Difference]: Finished difference Result 6009 states and 13221 transitions. [2019-12-19 03:23:29,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:23:29,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-19 03:23:29,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:29,401 INFO L225 Difference]: With dead ends: 6009 [2019-12-19 03:23:29,401 INFO L226 Difference]: Without dead ends: 6009 [2019-12-19 03:23:29,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:23:29,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2019-12-19 03:23:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 5312. [2019-12-19 03:23:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5312 states. [2019-12-19 03:23:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5312 states to 5312 states and 11744 transitions. [2019-12-19 03:23:29,457 INFO L78 Accepts]: Start accepts. Automaton has 5312 states and 11744 transitions. Word has length 93 [2019-12-19 03:23:29,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:29,457 INFO L462 AbstractCegarLoop]: Abstraction has 5312 states and 11744 transitions. [2019-12-19 03:23:29,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:23:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 5312 states and 11744 transitions. [2019-12-19 03:23:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 03:23:29,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:23:29,463 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:29,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:29,464 INFO L82 PathProgramCache]: Analyzing trace with hash 835793363, now seen corresponding path program 1 times [2019-12-19 03:23:29,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:29,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082827521] [2019-12-19 03:23:29,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:29,516 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-19 03:23:29,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082827521] [2019-12-19 03:23:29,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:29,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:23:29,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6772620] [2019-12-19 03:23:29,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:23:29,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:29,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:23:29,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:23:29,518 INFO L87 Difference]: Start difference. First operand 5312 states and 11744 transitions. Second operand 4 states. [2019-12-19 03:23:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:29,624 INFO L93 Difference]: Finished difference Result 6275 states and 13793 transitions. [2019-12-19 03:23:29,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:23:29,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-19 03:23:29,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:29,632 INFO L225 Difference]: With dead ends: 6275 [2019-12-19 03:23:29,632 INFO L226 Difference]: Without dead ends: 6275 [2019-12-19 03:23:29,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:23:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6275 states. [2019-12-19 03:23:29,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6275 to 5506. [2019-12-19 03:23:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5506 states. [2019-12-19 03:23:29,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5506 states to 5506 states and 12150 transitions. [2019-12-19 03:23:29,712 INFO L78 Accepts]: Start accepts. Automaton has 5506 states and 12150 transitions. Word has length 93 [2019-12-19 03:23:29,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:29,713 INFO L462 AbstractCegarLoop]: Abstraction has 5506 states and 12150 transitions. [2019-12-19 03:23:29,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:23:29,713 INFO L276 IsEmpty]: Start isEmpty. Operand 5506 states and 12150 transitions. [2019-12-19 03:23:29,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:23:29,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:29,721 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:23:29,721 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:29,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:29,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1017086667, now seen corresponding path program 1 times [2019-12-19 03:23:29,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:29,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643501479] [2019-12-19 03:23:29,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:29,814 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-19 03:23:29,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643501479] [2019-12-19 03:23:29,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:29,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:23:29,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675023911] [2019-12-19 03:23:29,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:23:29,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:29,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:23:29,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:23:29,818 INFO L87 Difference]: Start difference. First operand 5506 states and 12150 transitions. Second operand 5 states. [2019-12-19 03:23:29,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:29,977 INFO L93 Difference]: Finished difference Result 5976 states and 13174 transitions. [2019-12-19 03:23:29,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:23:29,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-19 03:23:29,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:29,987 INFO L225 Difference]: With dead ends: 5976 [2019-12-19 03:23:29,987 INFO L226 Difference]: Without dead ends: 5976 [2019-12-19 03:23:29,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:23:30,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2019-12-19 03:23:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 4606. [2019-12-19 03:23:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4606 states. [2019-12-19 03:23:30,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4606 states to 4606 states and 10151 transitions. [2019-12-19 03:23:30,080 INFO L78 Accepts]: Start accepts. Automaton has 4606 states and 10151 transitions. Word has length 95 [2019-12-19 03:23:30,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:30,081 INFO L462 AbstractCegarLoop]: Abstraction has 4606 states and 10151 transitions. [2019-12-19 03:23:30,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:23:30,081 INFO L276 IsEmpty]: Start isEmpty. Operand 4606 states and 10151 transitions. [2019-12-19 03:23:30,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:23:30,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:30,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:23:30,091 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:30,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:30,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1028402794, now seen corresponding path program 1 times [2019-12-19 03:23:30,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:30,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012754033] [2019-12-19 03:23:30,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:30,213 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-19 03:23:30,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012754033] [2019-12-19 03:23:30,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:30,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:23:30,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602983801] [2019-12-19 03:23:30,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:23:30,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:30,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:23:30,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:23:30,216 INFO L87 Difference]: Start difference. First operand 4606 states and 10151 transitions. Second operand 6 states. [2019-12-19 03:23:30,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:30,378 INFO L93 Difference]: Finished difference Result 5090 states and 11138 transitions. [2019-12-19 03:23:30,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:23:30,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 03:23:30,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:30,388 INFO L225 Difference]: With dead ends: 5090 [2019-12-19 03:23:30,388 INFO L226 Difference]: Without dead ends: 5090 [2019-12-19 03:23:30,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:23:30,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5090 states. [2019-12-19 03:23:30,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5090 to 4500. [2019-12-19 03:23:30,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4500 states. [2019-12-19 03:23:30,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4500 states to 4500 states and 9960 transitions. [2019-12-19 03:23:30,445 INFO L78 Accepts]: Start accepts. Automaton has 4500 states and 9960 transitions. Word has length 95 [2019-12-19 03:23:30,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:30,445 INFO L462 AbstractCegarLoop]: Abstraction has 4500 states and 9960 transitions. [2019-12-19 03:23:30,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:23:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 4500 states and 9960 transitions. [2019-12-19 03:23:30,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:23:30,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:30,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:23:30,451 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:30,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:30,451 INFO L82 PathProgramCache]: Analyzing trace with hash 70745997, now seen corresponding path program 1 times [2019-12-19 03:23:30,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:30,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181395070] [2019-12-19 03:23:30,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:30,517 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-19 03:23:30,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181395070] [2019-12-19 03:23:30,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:30,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:23:30,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951198528] [2019-12-19 03:23:30,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:23:30,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:30,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:23:30,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:23:30,519 INFO L87 Difference]: Start difference. First operand 4500 states and 9960 transitions. Second operand 4 states. [2019-12-19 03:23:30,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:30,745 INFO L93 Difference]: Finished difference Result 5715 states and 12587 transitions. [2019-12-19 03:23:30,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:23:30,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-19 03:23:30,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:30,753 INFO L225 Difference]: With dead ends: 5715 [2019-12-19 03:23:30,754 INFO L226 Difference]: Without dead ends: 5659 [2019-12-19 03:23:30,754 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-19 03:23:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5659 states. [2019-12-19 03:23:30,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5659 to 5354. [2019-12-19 03:23:30,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5354 states. [2019-12-19 03:23:30,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5354 states to 5354 states and 11818 transitions. [2019-12-19 03:23:30,855 INFO L78 Accepts]: Start accepts. Automaton has 5354 states and 11818 transitions. Word has length 95 [2019-12-19 03:23:30,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:30,856 INFO L462 AbstractCegarLoop]: Abstraction has 5354 states and 11818 transitions. [2019-12-19 03:23:30,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:23:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 5354 states and 11818 transitions. [2019-12-19 03:23:30,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:23:30,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:30,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:23:30,866 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:30,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:30,868 INFO L82 PathProgramCache]: Analyzing trace with hash -2006463346, now seen corresponding path program 1 times [2019-12-19 03:23:30,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:30,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711910304] [2019-12-19 03:23:30,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:31,112 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-19 03:23:31,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711910304] [2019-12-19 03:23:31,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:31,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-19 03:23:31,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118338419] [2019-12-19 03:23:31,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-19 03:23:31,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:31,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-19 03:23:31,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-19 03:23:31,115 INFO L87 Difference]: Start difference. First operand 5354 states and 11818 transitions. Second operand 13 states. [2019-12-19 03:23:32,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:32,644 INFO L93 Difference]: Finished difference Result 7876 states and 17095 transitions. [2019-12-19 03:23:32,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-19 03:23:32,645 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2019-12-19 03:23:32,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:32,654 INFO L225 Difference]: With dead ends: 7876 [2019-12-19 03:23:32,654 INFO L226 Difference]: Without dead ends: 7876 [2019-12-19 03:23:32,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2019-12-19 03:23:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7876 states. [2019-12-19 03:23:32,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7876 to 5915. [2019-12-19 03:23:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5915 states. [2019-12-19 03:23:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 13012 transitions. [2019-12-19 03:23:32,818 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 13012 transitions. Word has length 95 [2019-12-19 03:23:32,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:32,818 INFO L462 AbstractCegarLoop]: Abstraction has 5915 states and 13012 transitions. [2019-12-19 03:23:32,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-19 03:23:32,818 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 13012 transitions. [2019-12-19 03:23:32,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:23:32,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:32,824 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:23:32,824 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:32,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:32,824 INFO L82 PathProgramCache]: Analyzing trace with hash -907608752, now seen corresponding path program 1 times [2019-12-19 03:23:32,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:32,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515778825] [2019-12-19 03:23:32,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:23:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:23:32,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515778825] [2019-12-19 03:23:32,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:23:32,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 03:23:32,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276575311] [2019-12-19 03:23:32,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 03:23:32,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:23:32,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 03:23:32,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:23:32,966 INFO L87 Difference]: Start difference. First operand 5915 states and 13012 transitions. Second operand 10 states. [2019-12-19 03:23:33,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:23:33,633 INFO L93 Difference]: Finished difference Result 17852 states and 39828 transitions. [2019-12-19 03:23:33,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 03:23:33,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-19 03:23:33,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:23:33,650 INFO L225 Difference]: With dead ends: 17852 [2019-12-19 03:23:33,650 INFO L226 Difference]: Without dead ends: 11878 [2019-12-19 03:23:33,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-19 03:23:33,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11878 states. [2019-12-19 03:23:33,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11878 to 5886. [2019-12-19 03:23:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5886 states. [2019-12-19 03:23:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5886 states to 5886 states and 12872 transitions. [2019-12-19 03:23:33,776 INFO L78 Accepts]: Start accepts. Automaton has 5886 states and 12872 transitions. Word has length 95 [2019-12-19 03:23:33,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:23:33,776 INFO L462 AbstractCegarLoop]: Abstraction has 5886 states and 12872 transitions. [2019-12-19 03:23:33,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 03:23:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 5886 states and 12872 transitions. [2019-12-19 03:23:33,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:23:33,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:23:33,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:23:33,785 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:23:33,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:23:33,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1770172980, now seen corresponding path program 2 times [2019-12-19 03:23:33,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:23:33,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277003385] [2019-12-19 03:23:33,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:23:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:23:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:23:33,927 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 03:23:33,927 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 03:23:34,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:23:34 BasicIcfg [2019-12-19 03:23:34,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 03:23:34,167 INFO L168 Benchmark]: Toolchain (without parser) took 46039.44 ms. Allocated memory was 146.8 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 102.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 842.9 MB. Max. memory is 7.1 GB. [2019-12-19 03:23:34,167 INFO L168 Benchmark]: CDTParser took 1.45 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-19 03:23:34,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.36 ms. Allocated memory was 146.8 MB in the beginning and 205.5 MB in the end (delta: 58.7 MB). Free memory was 102.5 MB in the beginning and 160.0 MB in the end (delta: -57.5 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-19 03:23:34,168 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.36 ms. Allocated memory is still 205.5 MB. Free memory was 160.0 MB in the beginning and 157.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-19 03:23:34,169 INFO L168 Benchmark]: Boogie Preprocessor took 40.54 ms. Allocated memory is still 205.5 MB. Free memory was 157.5 MB in the beginning and 155.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-19 03:23:34,173 INFO L168 Benchmark]: RCFGBuilder took 856.24 ms. Allocated memory is still 205.5 MB. Free memory was 155.0 MB in the beginning and 110.9 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-19 03:23:34,174 INFO L168 Benchmark]: TraceAbstraction took 44239.02 ms. Allocated memory was 205.5 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 110.9 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 792.4 MB. Max. memory is 7.1 GB. [2019-12-19 03:23:34,176 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.45 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 826.36 ms. Allocated memory was 146.8 MB in the beginning and 205.5 MB in the end (delta: 58.7 MB). Free memory was 102.5 MB in the beginning and 160.0 MB in the end (delta: -57.5 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.36 ms. Allocated memory is still 205.5 MB. Free memory was 160.0 MB in the beginning and 157.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.54 ms. Allocated memory is still 205.5 MB. Free memory was 157.5 MB in the beginning and 155.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 856.24 ms. Allocated memory is still 205.5 MB. Free memory was 155.0 MB in the beginning and 110.9 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 44239.02 ms. Allocated memory was 205.5 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 110.9 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 792.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 pthread_t t1441; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] FCALL, FORK 0 pthread_create(&t1441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t1442; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1442, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 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) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=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] [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_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))=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] [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=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] [L762] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L763] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$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))=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] [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=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] [L765] 2 y = y$flush_delayed ? y$mem_tmp : y [L766] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L807] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 43.8s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8299 SDtfs, 8720 SDslu, 19134 SDs, 0 SdLazy, 7753 SolverSat, 465 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 81 SyntacticMatches, 16 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71011occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 73454 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2056 NumberOfCodeBlocks, 2056 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1932 ConstructedInterpolants, 0 QuantifiedInterpolants, 319860 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...