/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 05:28:23,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 05:28:23,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 05:28:23,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 05:28:23,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 05:28:23,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 05:28:23,920 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 05:28:23,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 05:28:23,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 05:28:23,938 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 05:28:23,940 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 05:28:23,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 05:28:23,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 05:28:23,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 05:28:23,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 05:28:23,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 05:28:23,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 05:28:23,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 05:28:23,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 05:28:23,956 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 05:28:23,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 05:28:23,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 05:28:23,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 05:28:23,966 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 05:28:23,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 05:28:23,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 05:28:23,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 05:28:23,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 05:28:23,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 05:28:23,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 05:28:23,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 05:28:23,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 05:28:23,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 05:28:23,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 05:28:23,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 05:28:23,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 05:28:23,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 05:28:23,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 05:28:23,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 05:28:23,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 05:28:23,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 05:28:23,983 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-MCR.epf [2019-12-28 05:28:24,009 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 05:28:24,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 05:28:24,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 05:28:24,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 05:28:24,011 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 05:28:24,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 05:28:24,012 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 05:28:24,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 05:28:24,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 05:28:24,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 05:28:24,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 05:28:24,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 05:28:24,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 05:28:24,013 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 05:28:24,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 05:28:24,013 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 05:28:24,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 05:28:24,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 05:28:24,014 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 05:28:24,014 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 05:28:24,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 05:28:24,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 05:28:24,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 05:28:24,015 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 05:28:24,015 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 05:28:24,016 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 05:28:24,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 05:28:24,016 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 05:28:24,016 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 05:28:24,016 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 05:28:24,017 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 05:28:24,017 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 05:28:24,310 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 05:28:24,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 05:28:24,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 05:28:24,328 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 05:28:24,328 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 05:28:24,329 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_pso.opt.i [2019-12-28 05:28:24,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e22c484ed/17a135b00c14438eb342fd58fee6fa23/FLAG73f9e9d48 [2019-12-28 05:28:24,912 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 05:28:24,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_pso.opt.i [2019-12-28 05:28:24,927 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e22c484ed/17a135b00c14438eb342fd58fee6fa23/FLAG73f9e9d48 [2019-12-28 05:28:25,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e22c484ed/17a135b00c14438eb342fd58fee6fa23 [2019-12-28 05:28:25,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 05:28:25,251 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 05:28:25,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 05:28:25,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 05:28:25,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 05:28:25,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:28:25" (1/1) ... [2019-12-28 05:28:25,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677b895b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:25, skipping insertion in model container [2019-12-28 05:28:25,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:28:25" (1/1) ... [2019-12-28 05:28:25,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 05:28:25,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 05:28:25,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 05:28:25,840 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 05:28:25,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 05:28:26,005 INFO L208 MainTranslator]: Completed translation [2019-12-28 05:28:26,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:26 WrapperNode [2019-12-28 05:28:26,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 05:28:26,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 05:28:26,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 05:28:26,009 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 05:28:26,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:26" (1/1) ... [2019-12-28 05:28:26,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:26" (1/1) ... [2019-12-28 05:28:26,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 05:28:26,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 05:28:26,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 05:28:26,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 05:28:26,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:26" (1/1) ... [2019-12-28 05:28:26,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:26" (1/1) ... [2019-12-28 05:28:26,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:26" (1/1) ... [2019-12-28 05:28:26,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:26" (1/1) ... [2019-12-28 05:28:26,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:26" (1/1) ... [2019-12-28 05:28:26,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:26" (1/1) ... [2019-12-28 05:28:26,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:26" (1/1) ... [2019-12-28 05:28:26,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 05:28:26,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 05:28:26,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 05:28:26,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 05:28:26,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:26" (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-28 05:28:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 05:28:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 05:28:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 05:28:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 05:28:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 05:28:26,165 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 05:28:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 05:28:26,165 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 05:28:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-28 05:28:26,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-28 05:28:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 05:28:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 05:28:26,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 05:28:26,168 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 05:28:26,850 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 05:28:26,851 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 05:28:26,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:28:26 BoogieIcfgContainer [2019-12-28 05:28:26,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 05:28:26,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 05:28:26,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 05:28:26,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 05:28:26,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:28:25" (1/3) ... [2019-12-28 05:28:26,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131111f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:28:26, skipping insertion in model container [2019-12-28 05:28:26,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:26" (2/3) ... [2019-12-28 05:28:26,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131111f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:28:26, skipping insertion in model container [2019-12-28 05:28:26,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:28:26" (3/3) ... [2019-12-28 05:28:26,865 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_pso.opt.i [2019-12-28 05:28:26,876 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 05:28:26,877 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 05:28:26,896 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 05:28:26,897 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 05:28:26,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,960 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,961 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,964 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,964 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:26,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,004 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,004 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,011 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,011 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,011 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,024 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,024 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,030 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,034 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,040 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,042 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,043 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:27,062 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-28 05:28:27,098 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 05:28:27,099 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 05:28:27,099 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 05:28:27,099 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 05:28:27,099 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 05:28:27,099 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 05:28:27,099 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 05:28:27,099 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 05:28:27,114 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 151 places, 176 transitions [2019-12-28 05:28:45,599 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111186 states. [2019-12-28 05:28:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 111186 states. [2019-12-28 05:28:45,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-28 05:28:45,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:45,623 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-28 05:28:45,624 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:45,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:45,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1109224519, now seen corresponding path program 1 times [2019-12-28 05:28:45,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:45,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244257047] [2019-12-28 05:28:45,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:28:46,001 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-28 05:28:46,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244257047] [2019-12-28 05:28:46,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:28:46,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:28:46,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1237898832] [2019-12-28 05:28:46,005 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:28:46,013 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:28:46,035 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 45 transitions. [2019-12-28 05:28:46,035 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:28:46,039 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:28:46,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:28:46,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:28:46,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:28:46,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:28:46,054 INFO L87 Difference]: Start difference. First operand 111186 states. Second operand 4 states. [2019-12-28 05:28:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:28:47,872 INFO L93 Difference]: Finished difference Result 114114 states and 522350 transitions. [2019-12-28 05:28:47,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 05:28:47,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-28 05:28:47,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:28:48,519 INFO L225 Difference]: With dead ends: 114114 [2019-12-28 05:28:48,519 INFO L226 Difference]: Without dead ends: 82834 [2019-12-28 05:28:48,523 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-28 05:28:52,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82834 states. [2019-12-28 05:28:55,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82834 to 82834. [2019-12-28 05:28:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82834 states. [2019-12-28 05:28:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82834 states to 82834 states and 380410 transitions. [2019-12-28 05:28:55,605 INFO L78 Accepts]: Start accepts. Automaton has 82834 states and 380410 transitions. Word has length 45 [2019-12-28 05:28:55,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:28:55,607 INFO L462 AbstractCegarLoop]: Abstraction has 82834 states and 380410 transitions. [2019-12-28 05:28:55,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:28:55,607 INFO L276 IsEmpty]: Start isEmpty. Operand 82834 states and 380410 transitions. [2019-12-28 05:28:55,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 05:28:55,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:55,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:28:55,628 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:55,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:55,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1958045590, now seen corresponding path program 1 times [2019-12-28 05:28:55,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:55,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437577593] [2019-12-28 05:28:55,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:28:55,775 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-28 05:28:55,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437577593] [2019-12-28 05:28:55,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:28:55,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:28:55,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1560837830] [2019-12-28 05:28:55,777 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:28:55,785 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:28:55,791 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 53 transitions. [2019-12-28 05:28:55,791 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:28:55,791 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:28:55,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:28:55,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:28:55,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:28:55,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:28:55,794 INFO L87 Difference]: Start difference. First operand 82834 states and 380410 transitions. Second operand 5 states. [2019-12-28 05:29:00,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:29:00,000 INFO L93 Difference]: Finished difference Result 129234 states and 566702 transitions. [2019-12-28 05:29:00,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:29:00,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-28 05:29:00,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:29:00,875 INFO L225 Difference]: With dead ends: 129234 [2019-12-28 05:29:00,875 INFO L226 Difference]: Without dead ends: 126474 [2019-12-28 05:29:00,876 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-28 05:29:02,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126474 states. [2019-12-28 05:29:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126474 to 119958. [2019-12-28 05:29:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119958 states. [2019-12-28 05:29:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119958 states to 119958 states and 531549 transitions. [2019-12-28 05:29:10,405 INFO L78 Accepts]: Start accepts. Automaton has 119958 states and 531549 transitions. Word has length 53 [2019-12-28 05:29:10,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:29:10,406 INFO L462 AbstractCegarLoop]: Abstraction has 119958 states and 531549 transitions. [2019-12-28 05:29:10,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:29:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand 119958 states and 531549 transitions. [2019-12-28 05:29:10,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 05:29:10,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:29:10,424 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:29:10,425 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:29:10,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:29:10,425 INFO L82 PathProgramCache]: Analyzing trace with hash 690713249, now seen corresponding path program 1 times [2019-12-28 05:29:10,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:29:10,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312528833] [2019-12-28 05:29:10,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:29:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:29:10,581 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-28 05:29:10,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312528833] [2019-12-28 05:29:10,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:29:10,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:29:10,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1931338656] [2019-12-28 05:29:10,582 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:29:10,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:29:10,601 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 126 transitions. [2019-12-28 05:29:10,602 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:29:10,668 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 05:29:10,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:29:10,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:29:10,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:29:10,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:29:10,669 INFO L87 Difference]: Start difference. First operand 119958 states and 531549 transitions. Second operand 6 states. [2019-12-28 05:29:16,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:29:16,833 INFO L93 Difference]: Finished difference Result 156370 states and 680698 transitions. [2019-12-28 05:29:16,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:29:16,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-28 05:29:16,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:29:17,534 INFO L225 Difference]: With dead ends: 156370 [2019-12-28 05:29:17,534 INFO L226 Difference]: Without dead ends: 154130 [2019-12-28 05:29:17,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 05:29:18,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154130 states. [2019-12-28 05:29:21,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154130 to 132942. [2019-12-28 05:29:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132942 states. [2019-12-28 05:29:22,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132942 states to 132942 states and 585323 transitions. [2019-12-28 05:29:22,100 INFO L78 Accepts]: Start accepts. Automaton has 132942 states and 585323 transitions. Word has length 54 [2019-12-28 05:29:22,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:29:22,101 INFO L462 AbstractCegarLoop]: Abstraction has 132942 states and 585323 transitions. [2019-12-28 05:29:22,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:29:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 132942 states and 585323 transitions. [2019-12-28 05:29:22,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 05:29:22,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:29:22,145 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] [2019-12-28 05:29:22,146 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:29:22,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:29:22,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1060971801, now seen corresponding path program 1 times [2019-12-28 05:29:22,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:29:22,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476737329] [2019-12-28 05:29:22,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:29:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:29:22,235 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-28 05:29:22,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476737329] [2019-12-28 05:29:22,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:29:22,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 05:29:22,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [341345375] [2019-12-28 05:29:22,237 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:29:22,243 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:29:22,257 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 144 transitions. [2019-12-28 05:29:22,257 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:29:22,312 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 05:29:22,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:29:22,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:29:22,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:29:22,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:29:22,314 INFO L87 Difference]: Start difference. First operand 132942 states and 585323 transitions. Second operand 5 states. [2019-12-28 05:29:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:29:27,735 INFO L93 Difference]: Finished difference Result 171274 states and 741340 transitions. [2019-12-28 05:29:27,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 05:29:27,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-28 05:29:27,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:29:28,320 INFO L225 Difference]: With dead ends: 171274 [2019-12-28 05:29:28,320 INFO L226 Difference]: Without dead ends: 171274 [2019-12-28 05:29:28,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:29:29,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171274 states. [2019-12-28 05:29:32,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171274 to 151998. [2019-12-28 05:29:32,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151998 states. [2019-12-28 05:29:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151998 states to 151998 states and 663351 transitions. [2019-12-28 05:29:33,166 INFO L78 Accepts]: Start accepts. Automaton has 151998 states and 663351 transitions. Word has length 56 [2019-12-28 05:29:33,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:29:33,166 INFO L462 AbstractCegarLoop]: Abstraction has 151998 states and 663351 transitions. [2019-12-28 05:29:33,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:29:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 151998 states and 663351 transitions. [2019-12-28 05:29:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 05:29:33,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:29:33,214 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-28 05:29:33,214 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:29:33,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:29:33,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1957923899, now seen corresponding path program 1 times [2019-12-28 05:29:33,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:29:33,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344720626] [2019-12-28 05:29:33,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:29:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:29:33,365 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-28 05:29:33,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344720626] [2019-12-28 05:29:33,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:29:33,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:29:33,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [719885717] [2019-12-28 05:29:33,366 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:29:33,373 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:29:33,384 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 64 transitions. [2019-12-28 05:29:33,384 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:29:33,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:29:33,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:29:33,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:29:33,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:29:33,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:29:33,387 INFO L87 Difference]: Start difference. First operand 151998 states and 663351 transitions. Second operand 6 states. [2019-12-28 05:29:40,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:29:40,607 INFO L93 Difference]: Finished difference Result 208582 states and 902701 transitions. [2019-12-28 05:29:40,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:29:40,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-28 05:29:40,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:29:41,245 INFO L225 Difference]: With dead ends: 208582 [2019-12-28 05:29:41,246 INFO L226 Difference]: Without dead ends: 205382 [2019-12-28 05:29:41,246 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-28 05:29:42,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205382 states. [2019-12-28 05:29:50,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205382 to 193070. [2019-12-28 05:29:50,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193070 states. [2019-12-28 05:29:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193070 states to 193070 states and 837871 transitions. [2019-12-28 05:29:52,286 INFO L78 Accepts]: Start accepts. Automaton has 193070 states and 837871 transitions. Word has length 60 [2019-12-28 05:29:52,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:29:52,287 INFO L462 AbstractCegarLoop]: Abstraction has 193070 states and 837871 transitions. [2019-12-28 05:29:52,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:29:52,287 INFO L276 IsEmpty]: Start isEmpty. Operand 193070 states and 837871 transitions. [2019-12-28 05:29:52,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 05:29:52,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:29:52,338 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-28 05:29:52,338 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:29:52,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:29:52,339 INFO L82 PathProgramCache]: Analyzing trace with hash 540092038, now seen corresponding path program 1 times [2019-12-28 05:29:52,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:29:52,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211458776] [2019-12-28 05:29:52,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:29:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:29:52,457 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-28 05:29:52,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211458776] [2019-12-28 05:29:52,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:29:52,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 05:29:52,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [132118380] [2019-12-28 05:29:52,459 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:29:52,465 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:29:52,473 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 64 transitions. [2019-12-28 05:29:52,474 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:29:52,474 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:29:52,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:29:52,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:29:52,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:29:52,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:29:52,475 INFO L87 Difference]: Start difference. First operand 193070 states and 837871 transitions. Second operand 7 states. [2019-12-28 05:30:01,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:01,436 INFO L93 Difference]: Finished difference Result 275526 states and 1157813 transitions. [2019-12-28 05:30:01,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 05:30:01,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-28 05:30:01,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:02,394 INFO L225 Difference]: With dead ends: 275526 [2019-12-28 05:30:02,394 INFO L226 Difference]: Without dead ends: 275526 [2019-12-28 05:30:02,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 05:30:03,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275526 states. [2019-12-28 05:30:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275526 to 228422. [2019-12-28 05:30:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228422 states. [2019-12-28 05:30:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228422 states to 228422 states and 972797 transitions. [2019-12-28 05:30:16,427 INFO L78 Accepts]: Start accepts. Automaton has 228422 states and 972797 transitions. Word has length 60 [2019-12-28 05:30:16,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:16,428 INFO L462 AbstractCegarLoop]: Abstraction has 228422 states and 972797 transitions. [2019-12-28 05:30:16,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:30:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 228422 states and 972797 transitions. [2019-12-28 05:30:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 05:30:16,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:16,479 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-28 05:30:16,479 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:16,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:16,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1427595719, now seen corresponding path program 1 times [2019-12-28 05:30:16,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:16,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118529356] [2019-12-28 05:30:16,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:16,555 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-28 05:30:16,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118529356] [2019-12-28 05:30:16,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:16,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:30:16,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1950068372] [2019-12-28 05:30:16,556 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:16,563 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:16,572 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 64 transitions. [2019-12-28 05:30:16,572 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:16,580 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 05:30:16,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:30:16,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:16,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:30:16,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:30:16,582 INFO L87 Difference]: Start difference. First operand 228422 states and 972797 transitions. Second operand 4 states. [2019-12-28 05:30:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:25,220 INFO L93 Difference]: Finished difference Result 185894 states and 771106 transitions. [2019-12-28 05:30:25,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 05:30:25,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-28 05:30:25,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:25,766 INFO L225 Difference]: With dead ends: 185894 [2019-12-28 05:30:25,767 INFO L226 Difference]: Without dead ends: 180910 [2019-12-28 05:30:25,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-28 05:30:26,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180910 states. [2019-12-28 05:30:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180910 to 180910. [2019-12-28 05:30:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180910 states. [2019-12-28 05:30:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180910 states to 180910 states and 753597 transitions. [2019-12-28 05:30:31,282 INFO L78 Accepts]: Start accepts. Automaton has 180910 states and 753597 transitions. Word has length 60 [2019-12-28 05:30:31,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:31,283 INFO L462 AbstractCegarLoop]: Abstraction has 180910 states and 753597 transitions. [2019-12-28 05:30:31,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:30:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 180910 states and 753597 transitions. [2019-12-28 05:30:31,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 05:30:31,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:31,314 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-28 05:30:31,314 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:31,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:31,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1792364402, now seen corresponding path program 1 times [2019-12-28 05:30:31,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:31,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923631851] [2019-12-28 05:30:31,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:31,389 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-28 05:30:31,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923631851] [2019-12-28 05:30:31,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:31,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:30:31,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1657224473] [2019-12-28 05:30:31,391 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:31,399 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:31,415 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 180 transitions. [2019-12-28 05:30:31,415 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:31,455 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 05:30:31,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 05:30:31,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:31,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 05:30:31,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:30:31,456 INFO L87 Difference]: Start difference. First operand 180910 states and 753597 transitions. Second operand 8 states. [2019-12-28 05:30:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:39,275 INFO L93 Difference]: Finished difference Result 234266 states and 959370 transitions. [2019-12-28 05:30:39,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 05:30:39,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-12-28 05:30:39,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:39,972 INFO L225 Difference]: With dead ends: 234266 [2019-12-28 05:30:39,972 INFO L226 Difference]: Without dead ends: 229388 [2019-12-28 05:30:39,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 05:30:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229388 states. [2019-12-28 05:30:45,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229388 to 183769. [2019-12-28 05:30:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183769 states. [2019-12-28 05:30:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183769 states to 183769 states and 765836 transitions. [2019-12-28 05:30:45,917 INFO L78 Accepts]: Start accepts. Automaton has 183769 states and 765836 transitions. Word has length 60 [2019-12-28 05:30:45,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:45,917 INFO L462 AbstractCegarLoop]: Abstraction has 183769 states and 765836 transitions. [2019-12-28 05:30:45,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 05:30:45,918 INFO L276 IsEmpty]: Start isEmpty. Operand 183769 states and 765836 transitions. [2019-12-28 05:30:45,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-28 05:30:45,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:45,958 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] [2019-12-28 05:30:45,958 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:45,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:45,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2025804751, now seen corresponding path program 1 times [2019-12-28 05:30:45,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:45,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660524796] [2019-12-28 05:30:45,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:46,034 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-28 05:30:46,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660524796] [2019-12-28 05:30:46,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:46,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:30:46,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [907341800] [2019-12-28 05:30:46,035 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:46,042 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:46,052 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 83 transitions. [2019-12-28 05:30:46,052 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:46,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 05:30:46,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:30:46,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:46,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:30:46,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:30:46,075 INFO L87 Difference]: Start difference. First operand 183769 states and 765836 transitions. Second operand 6 states. [2019-12-28 05:30:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:47,487 INFO L93 Difference]: Finished difference Result 34882 states and 130106 transitions. [2019-12-28 05:30:47,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 05:30:47,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-28 05:30:47,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:47,552 INFO L225 Difference]: With dead ends: 34882 [2019-12-28 05:30:47,553 INFO L226 Difference]: Without dead ends: 30055 [2019-12-28 05:30:47,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:30:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30055 states. [2019-12-28 05:30:47,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30055 to 29863. [2019-12-28 05:30:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29863 states. [2019-12-28 05:30:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29863 states to 29863 states and 110396 transitions. [2019-12-28 05:30:48,051 INFO L78 Accepts]: Start accepts. Automaton has 29863 states and 110396 transitions. Word has length 61 [2019-12-28 05:30:48,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:48,051 INFO L462 AbstractCegarLoop]: Abstraction has 29863 states and 110396 transitions. [2019-12-28 05:30:48,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:30:48,051 INFO L276 IsEmpty]: Start isEmpty. Operand 29863 states and 110396 transitions. [2019-12-28 05:30:48,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 05:30:48,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:48,068 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] [2019-12-28 05:30:48,068 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:48,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:48,068 INFO L82 PathProgramCache]: Analyzing trace with hash -565208698, now seen corresponding path program 1 times [2019-12-28 05:30:48,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:48,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621418626] [2019-12-28 05:30:48,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:48,128 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-28 05:30:48,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621418626] [2019-12-28 05:30:48,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:48,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:30:48,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1284695195] [2019-12-28 05:30:48,129 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:48,141 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:48,177 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 223 transitions. [2019-12-28 05:30:48,177 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:48,193 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 05:30:48,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:30:48,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:48,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:30:48,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:30:48,194 INFO L87 Difference]: Start difference. First operand 29863 states and 110396 transitions. Second operand 5 states. [2019-12-28 05:30:48,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:48,498 INFO L93 Difference]: Finished difference Result 34924 states and 128758 transitions. [2019-12-28 05:30:48,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 05:30:48,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-28 05:30:48,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:48,575 INFO L225 Difference]: With dead ends: 34924 [2019-12-28 05:30:48,575 INFO L226 Difference]: Without dead ends: 34924 [2019-12-28 05:30:48,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:30:48,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34924 states. [2019-12-28 05:30:51,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34924 to 31801. [2019-12-28 05:30:51,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31801 states. [2019-12-28 05:30:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31801 states to 31801 states and 117322 transitions. [2019-12-28 05:30:51,658 INFO L78 Accepts]: Start accepts. Automaton has 31801 states and 117322 transitions. Word has length 71 [2019-12-28 05:30:51,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:51,658 INFO L462 AbstractCegarLoop]: Abstraction has 31801 states and 117322 transitions. [2019-12-28 05:30:51,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:30:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 31801 states and 117322 transitions. [2019-12-28 05:30:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 05:30:51,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:51,675 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] [2019-12-28 05:30:51,675 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:51,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:51,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1177601637, now seen corresponding path program 1 times [2019-12-28 05:30:51,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:51,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740223236] [2019-12-28 05:30:51,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:51,746 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-28 05:30:51,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740223236] [2019-12-28 05:30:51,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:51,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:30:51,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [174492559] [2019-12-28 05:30:51,748 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:51,759 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:51,802 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 223 transitions. [2019-12-28 05:30:51,802 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:51,823 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 05:30:51,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:30:51,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:51,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:30:51,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:30:51,825 INFO L87 Difference]: Start difference. First operand 31801 states and 117322 transitions. Second operand 7 states. [2019-12-28 05:30:52,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:52,522 INFO L93 Difference]: Finished difference Result 40977 states and 149241 transitions. [2019-12-28 05:30:52,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 05:30:52,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-12-28 05:30:52,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:52,605 INFO L225 Difference]: With dead ends: 40977 [2019-12-28 05:30:52,605 INFO L226 Difference]: Without dead ends: 40797 [2019-12-28 05:30:52,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-28 05:30:52,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40797 states. [2019-12-28 05:30:53,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40797 to 34292. [2019-12-28 05:30:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34292 states. [2019-12-28 05:30:53,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34292 states to 34292 states and 125836 transitions. [2019-12-28 05:30:53,652 INFO L78 Accepts]: Start accepts. Automaton has 34292 states and 125836 transitions. Word has length 71 [2019-12-28 05:30:53,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:53,652 INFO L462 AbstractCegarLoop]: Abstraction has 34292 states and 125836 transitions. [2019-12-28 05:30:53,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:30:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 34292 states and 125836 transitions. [2019-12-28 05:30:53,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-28 05:30:53,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:53,673 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] [2019-12-28 05:30:53,673 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:53,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:53,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1556409345, now seen corresponding path program 1 times [2019-12-28 05:30:53,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:53,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767526207] [2019-12-28 05:30:53,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:53,740 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-28 05:30:53,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767526207] [2019-12-28 05:30:53,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:53,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:30:53,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [297713314] [2019-12-28 05:30:53,741 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:53,754 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:53,776 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 103 transitions. [2019-12-28 05:30:53,776 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:53,777 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:30:53,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:30:53,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:53,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:30:53,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:30:53,778 INFO L87 Difference]: Start difference. First operand 34292 states and 125836 transitions. Second operand 4 states. [2019-12-28 05:30:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:54,170 INFO L93 Difference]: Finished difference Result 43210 states and 156685 transitions. [2019-12-28 05:30:54,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 05:30:54,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-28 05:30:54,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:54,260 INFO L225 Difference]: With dead ends: 43210 [2019-12-28 05:30:54,260 INFO L226 Difference]: Without dead ends: 43210 [2019-12-28 05:30:54,260 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-28 05:30:54,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43210 states. [2019-12-28 05:30:54,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43210 to 39520. [2019-12-28 05:30:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39520 states. [2019-12-28 05:30:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39520 states to 39520 states and 143617 transitions. [2019-12-28 05:30:54,937 INFO L78 Accepts]: Start accepts. Automaton has 39520 states and 143617 transitions. Word has length 73 [2019-12-28 05:30:54,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:54,938 INFO L462 AbstractCegarLoop]: Abstraction has 39520 states and 143617 transitions. [2019-12-28 05:30:54,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:30:54,938 INFO L276 IsEmpty]: Start isEmpty. Operand 39520 states and 143617 transitions. [2019-12-28 05:30:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-28 05:30:54,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:54,965 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] [2019-12-28 05:30:54,965 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:54,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:54,965 INFO L82 PathProgramCache]: Analyzing trace with hash -520799998, now seen corresponding path program 1 times [2019-12-28 05:30:54,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:54,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244903526] [2019-12-28 05:30:54,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:55,011 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-28 05:30:55,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244903526] [2019-12-28 05:30:55,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:55,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 05:30:55,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1827301669] [2019-12-28 05:30:55,012 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:55,025 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:55,403 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 103 transitions. [2019-12-28 05:30:55,403 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:55,404 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:30:55,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 05:30:55,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:55,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 05:30:55,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 05:30:55,405 INFO L87 Difference]: Start difference. First operand 39520 states and 143617 transitions. Second operand 3 states. [2019-12-28 05:30:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:55,724 INFO L93 Difference]: Finished difference Result 41333 states and 149658 transitions. [2019-12-28 05:30:55,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 05:30:55,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-28 05:30:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:55,807 INFO L225 Difference]: With dead ends: 41333 [2019-12-28 05:30:55,807 INFO L226 Difference]: Without dead ends: 41333 [2019-12-28 05:30:55,807 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-28 05:30:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41333 states. [2019-12-28 05:30:56,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41333 to 40522. [2019-12-28 05:30:56,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40522 states. [2019-12-28 05:30:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40522 states to 40522 states and 146939 transitions. [2019-12-28 05:30:56,494 INFO L78 Accepts]: Start accepts. Automaton has 40522 states and 146939 transitions. Word has length 73 [2019-12-28 05:30:56,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:56,494 INFO L462 AbstractCegarLoop]: Abstraction has 40522 states and 146939 transitions. [2019-12-28 05:30:56,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 05:30:56,494 INFO L276 IsEmpty]: Start isEmpty. Operand 40522 states and 146939 transitions. [2019-12-28 05:30:56,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 05:30:56,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:56,526 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] [2019-12-28 05:30:56,527 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:56,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:56,527 INFO L82 PathProgramCache]: Analyzing trace with hash 239718800, now seen corresponding path program 1 times [2019-12-28 05:30:56,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:56,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910899815] [2019-12-28 05:30:56,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:56,631 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-28 05:30:56,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910899815] [2019-12-28 05:30:56,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:56,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:30:56,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1377269186] [2019-12-28 05:30:56,632 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:56,659 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:56,685 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 105 transitions. [2019-12-28 05:30:56,685 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:56,689 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:30:56,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:30:56,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:56,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:30:56,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:30:56,690 INFO L87 Difference]: Start difference. First operand 40522 states and 146939 transitions. Second operand 6 states. [2019-12-28 05:30:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:57,657 INFO L93 Difference]: Finished difference Result 45111 states and 161731 transitions. [2019-12-28 05:30:57,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:30:57,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-28 05:30:57,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:57,748 INFO L225 Difference]: With dead ends: 45111 [2019-12-28 05:30:57,748 INFO L226 Difference]: Without dead ends: 45111 [2019-12-28 05:30:57,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-28 05:30:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45111 states. [2019-12-28 05:30:58,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45111 to 43398. [2019-12-28 05:30:58,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43398 states. [2019-12-28 05:30:58,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43398 states to 43398 states and 156062 transitions. [2019-12-28 05:30:58,455 INFO L78 Accepts]: Start accepts. Automaton has 43398 states and 156062 transitions. Word has length 75 [2019-12-28 05:30:58,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:58,455 INFO L462 AbstractCegarLoop]: Abstraction has 43398 states and 156062 transitions. [2019-12-28 05:30:58,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:30:58,455 INFO L276 IsEmpty]: Start isEmpty. Operand 43398 states and 156062 transitions. [2019-12-28 05:30:58,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 05:30:58,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:58,492 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] [2019-12-28 05:30:58,492 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:58,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:58,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1837490543, now seen corresponding path program 1 times [2019-12-28 05:30:58,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:58,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992815075] [2019-12-28 05:30:58,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:58,599 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-28 05:30:58,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992815075] [2019-12-28 05:30:58,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:58,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:30:58,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1766623010] [2019-12-28 05:30:58,601 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:58,618 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:58,648 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 105 transitions. [2019-12-28 05:30:58,649 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:58,649 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:30:58,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:30:58,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:58,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:30:58,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:30:58,651 INFO L87 Difference]: Start difference. First operand 43398 states and 156062 transitions. Second operand 6 states. [2019-12-28 05:30:59,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:59,616 INFO L93 Difference]: Finished difference Result 51187 states and 179497 transitions. [2019-12-28 05:30:59,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 05:30:59,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-28 05:30:59,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:59,720 INFO L225 Difference]: With dead ends: 51187 [2019-12-28 05:30:59,721 INFO L226 Difference]: Without dead ends: 51187 [2019-12-28 05:30:59,721 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-28 05:30:59,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51187 states. [2019-12-28 05:31:00,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51187 to 45430. [2019-12-28 05:31:00,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45430 states. [2019-12-28 05:31:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45430 states to 45430 states and 160426 transitions. [2019-12-28 05:31:00,479 INFO L78 Accepts]: Start accepts. Automaton has 45430 states and 160426 transitions. Word has length 75 [2019-12-28 05:31:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:00,479 INFO L462 AbstractCegarLoop]: Abstraction has 45430 states and 160426 transitions. [2019-12-28 05:31:00,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:31:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 45430 states and 160426 transitions. [2019-12-28 05:31:00,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 05:31:00,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:00,516 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] [2019-12-28 05:31:00,516 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:00,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:00,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1626139630, now seen corresponding path program 1 times [2019-12-28 05:31:00,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:00,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078251341] [2019-12-28 05:31:00,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:00,585 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-28 05:31:00,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078251341] [2019-12-28 05:31:00,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:00,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:31:00,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [533360671] [2019-12-28 05:31:00,587 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:00,599 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:00,623 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 105 transitions. [2019-12-28 05:31:00,623 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:00,624 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:31:00,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:31:00,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:00,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:31:00,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:31:00,625 INFO L87 Difference]: Start difference. First operand 45430 states and 160426 transitions. Second operand 5 states. [2019-12-28 05:31:01,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:01,460 INFO L93 Difference]: Finished difference Result 57019 states and 200691 transitions. [2019-12-28 05:31:01,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 05:31:01,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-28 05:31:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:01,583 INFO L225 Difference]: With dead ends: 57019 [2019-12-28 05:31:01,583 INFO L226 Difference]: Without dead ends: 57019 [2019-12-28 05:31:01,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-28 05:31:01,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57019 states. [2019-12-28 05:31:02,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57019 to 49069. [2019-12-28 05:31:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49069 states. [2019-12-28 05:31:02,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49069 states to 49069 states and 172037 transitions. [2019-12-28 05:31:02,400 INFO L78 Accepts]: Start accepts. Automaton has 49069 states and 172037 transitions. Word has length 75 [2019-12-28 05:31:02,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:02,400 INFO L462 AbstractCegarLoop]: Abstraction has 49069 states and 172037 transitions. [2019-12-28 05:31:02,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:31:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 49069 states and 172037 transitions. [2019-12-28 05:31:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 05:31:02,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:02,439 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] [2019-12-28 05:31:02,440 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:02,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:02,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2136673807, now seen corresponding path program 1 times [2019-12-28 05:31:02,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:02,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84583423] [2019-12-28 05:31:02,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:02,504 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-28 05:31:02,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84583423] [2019-12-28 05:31:02,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:02,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:31:02,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [311481410] [2019-12-28 05:31:02,505 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:02,517 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:02,545 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 105 transitions. [2019-12-28 05:31:02,545 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:02,546 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:31:02,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:31:02,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:02,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:31:02,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:31:02,547 INFO L87 Difference]: Start difference. First operand 49069 states and 172037 transitions. Second operand 5 states. [2019-12-28 05:31:03,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:03,550 INFO L93 Difference]: Finished difference Result 64393 states and 225636 transitions. [2019-12-28 05:31:03,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:31:03,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-28 05:31:03,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:03,687 INFO L225 Difference]: With dead ends: 64393 [2019-12-28 05:31:03,687 INFO L226 Difference]: Without dead ends: 64393 [2019-12-28 05:31:03,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-28 05:31:03,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64393 states. [2019-12-28 05:31:04,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64393 to 51957. [2019-12-28 05:31:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51957 states. [2019-12-28 05:31:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51957 states to 51957 states and 182151 transitions. [2019-12-28 05:31:04,641 INFO L78 Accepts]: Start accepts. Automaton has 51957 states and 182151 transitions. Word has length 75 [2019-12-28 05:31:04,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:04,641 INFO L462 AbstractCegarLoop]: Abstraction has 51957 states and 182151 transitions. [2019-12-28 05:31:04,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:31:04,641 INFO L276 IsEmpty]: Start isEmpty. Operand 51957 states and 182151 transitions. [2019-12-28 05:31:04,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 05:31:04,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:04,681 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] [2019-12-28 05:31:04,681 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:04,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:04,682 INFO L82 PathProgramCache]: Analyzing trace with hash 350839026, now seen corresponding path program 1 times [2019-12-28 05:31:04,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:04,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497061028] [2019-12-28 05:31:04,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:04,773 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-28 05:31:04,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497061028] [2019-12-28 05:31:04,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:04,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:31:04,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1500202240] [2019-12-28 05:31:04,774 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:04,786 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:04,810 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 105 transitions. [2019-12-28 05:31:04,810 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:04,811 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:31:04,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:31:04,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:04,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:31:04,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:31:04,812 INFO L87 Difference]: Start difference. First operand 51957 states and 182151 transitions. Second operand 6 states. [2019-12-28 05:31:05,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:05,434 INFO L93 Difference]: Finished difference Result 49842 states and 167712 transitions. [2019-12-28 05:31:05,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 05:31:05,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-28 05:31:05,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:05,531 INFO L225 Difference]: With dead ends: 49842 [2019-12-28 05:31:05,531 INFO L226 Difference]: Without dead ends: 49842 [2019-12-28 05:31:05,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-28 05:31:05,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49842 states. [2019-12-28 05:31:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49842 to 36559. [2019-12-28 05:31:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36559 states. [2019-12-28 05:31:06,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36559 states to 36559 states and 123944 transitions. [2019-12-28 05:31:06,192 INFO L78 Accepts]: Start accepts. Automaton has 36559 states and 123944 transitions. Word has length 75 [2019-12-28 05:31:06,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:06,193 INFO L462 AbstractCegarLoop]: Abstraction has 36559 states and 123944 transitions. [2019-12-28 05:31:06,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:31:06,193 INFO L276 IsEmpty]: Start isEmpty. Operand 36559 states and 123944 transitions. [2019-12-28 05:31:06,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 05:31:06,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:06,229 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] [2019-12-28 05:31:06,229 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:06,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:06,230 INFO L82 PathProgramCache]: Analyzing trace with hash -558608652, now seen corresponding path program 1 times [2019-12-28 05:31:06,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:06,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872613238] [2019-12-28 05:31:06,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:06,312 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-28 05:31:06,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872613238] [2019-12-28 05:31:06,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:06,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:31:06,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [267271956] [2019-12-28 05:31:06,313 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:06,325 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:06,355 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 105 transitions. [2019-12-28 05:31:06,355 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:06,380 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 05:31:06,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:31:06,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:06,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:31:06,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:31:06,384 INFO L87 Difference]: Start difference. First operand 36559 states and 123944 transitions. Second operand 7 states. [2019-12-28 05:31:06,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:06,531 INFO L93 Difference]: Finished difference Result 13933 states and 42710 transitions. [2019-12-28 05:31:06,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 05:31:06,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-28 05:31:06,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:06,556 INFO L225 Difference]: With dead ends: 13933 [2019-12-28 05:31:06,556 INFO L226 Difference]: Without dead ends: 12115 [2019-12-28 05:31:06,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-28 05:31:06,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12115 states. [2019-12-28 05:31:06,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12115 to 10863. [2019-12-28 05:31:06,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10863 states. [2019-12-28 05:31:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10863 states to 10863 states and 33106 transitions. [2019-12-28 05:31:06,723 INFO L78 Accepts]: Start accepts. Automaton has 10863 states and 33106 transitions. Word has length 75 [2019-12-28 05:31:06,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:06,723 INFO L462 AbstractCegarLoop]: Abstraction has 10863 states and 33106 transitions. [2019-12-28 05:31:06,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:31:06,723 INFO L276 IsEmpty]: Start isEmpty. Operand 10863 states and 33106 transitions. [2019-12-28 05:31:06,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 05:31:06,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:06,736 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] [2019-12-28 05:31:06,736 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:06,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:06,736 INFO L82 PathProgramCache]: Analyzing trace with hash -11366195, now seen corresponding path program 1 times [2019-12-28 05:31:06,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:06,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253724236] [2019-12-28 05:31:06,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:06,839 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-28 05:31:06,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253724236] [2019-12-28 05:31:06,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:06,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 05:31:06,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [402723105] [2019-12-28 05:31:06,840 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:06,861 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:06,945 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 209 transitions. [2019-12-28 05:31:06,946 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:07,024 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-28 05:31:07,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 05:31:07,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:07,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 05:31:07,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-28 05:31:07,025 INFO L87 Difference]: Start difference. First operand 10863 states and 33106 transitions. Second operand 11 states. [2019-12-28 05:31:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:08,469 INFO L93 Difference]: Finished difference Result 16541 states and 49584 transitions. [2019-12-28 05:31:08,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-28 05:31:08,470 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 92 [2019-12-28 05:31:08,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:08,493 INFO L225 Difference]: With dead ends: 16541 [2019-12-28 05:31:08,494 INFO L226 Difference]: Without dead ends: 16421 [2019-12-28 05:31:08,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=709, Unknown=0, NotChecked=0, Total=930 [2019-12-28 05:31:08,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16421 states. [2019-12-28 05:31:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16421 to 13503. [2019-12-28 05:31:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13503 states. [2019-12-28 05:31:08,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13503 states to 13503 states and 40722 transitions. [2019-12-28 05:31:08,691 INFO L78 Accepts]: Start accepts. Automaton has 13503 states and 40722 transitions. Word has length 92 [2019-12-28 05:31:08,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:08,692 INFO L462 AbstractCegarLoop]: Abstraction has 13503 states and 40722 transitions. [2019-12-28 05:31:08,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 05:31:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 13503 states and 40722 transitions. [2019-12-28 05:31:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 05:31:08,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:08,707 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] [2019-12-28 05:31:08,707 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:08,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:08,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2088575538, now seen corresponding path program 1 times [2019-12-28 05:31:08,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:08,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843294773] [2019-12-28 05:31:08,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:08,822 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-28 05:31:08,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843294773] [2019-12-28 05:31:08,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:08,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 05:31:08,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1432057908] [2019-12-28 05:31:08,824 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:08,845 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:08,926 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 209 transitions. [2019-12-28 05:31:08,927 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:08,927 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:31:08,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:31:08,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:08,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:31:08,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:31:08,929 INFO L87 Difference]: Start difference. First operand 13503 states and 40722 transitions. Second operand 7 states. [2019-12-28 05:31:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:09,100 INFO L93 Difference]: Finished difference Result 22233 states and 66561 transitions. [2019-12-28 05:31:09,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 05:31:09,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-28 05:31:09,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:09,126 INFO L225 Difference]: With dead ends: 22233 [2019-12-28 05:31:09,126 INFO L226 Difference]: Without dead ends: 12057 [2019-12-28 05:31:09,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-28 05:31:09,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12057 states. [2019-12-28 05:31:09,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12057 to 12057. [2019-12-28 05:31:09,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12057 states. [2019-12-28 05:31:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12057 states to 12057 states and 36150 transitions. [2019-12-28 05:31:09,351 INFO L78 Accepts]: Start accepts. Automaton has 12057 states and 36150 transitions. Word has length 92 [2019-12-28 05:31:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:09,351 INFO L462 AbstractCegarLoop]: Abstraction has 12057 states and 36150 transitions. [2019-12-28 05:31:09,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:31:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 12057 states and 36150 transitions. [2019-12-28 05:31:09,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 05:31:09,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:09,370 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] [2019-12-28 05:31:09,370 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:09,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:09,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1620378800, now seen corresponding path program 2 times [2019-12-28 05:31:09,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:09,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173917454] [2019-12-28 05:31:09,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:09,532 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-28 05:31:09,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173917454] [2019-12-28 05:31:09,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:09,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 05:31:09,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1918815581] [2019-12-28 05:31:09,535 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:09,551 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:09,627 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 212 transitions. [2019-12-28 05:31:09,627 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:09,645 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:31:09,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 05:31:09,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:09,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 05:31:09,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-28 05:31:09,646 INFO L87 Difference]: Start difference. First operand 12057 states and 36150 transitions. Second operand 11 states. [2019-12-28 05:31:12,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:12,144 INFO L93 Difference]: Finished difference Result 44957 states and 134432 transitions. [2019-12-28 05:31:12,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-28 05:31:12,144 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 92 [2019-12-28 05:31:12,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:12,193 INFO L225 Difference]: With dead ends: 44957 [2019-12-28 05:31:12,194 INFO L226 Difference]: Without dead ends: 32354 [2019-12-28 05:31:12,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=871, Unknown=0, NotChecked=0, Total=1056 [2019-12-28 05:31:12,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32354 states. [2019-12-28 05:31:12,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32354 to 15087. [2019-12-28 05:31:12,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15087 states. [2019-12-28 05:31:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15087 states to 15087 states and 43821 transitions. [2019-12-28 05:31:12,498 INFO L78 Accepts]: Start accepts. Automaton has 15087 states and 43821 transitions. Word has length 92 [2019-12-28 05:31:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:12,498 INFO L462 AbstractCegarLoop]: Abstraction has 15087 states and 43821 transitions. [2019-12-28 05:31:12,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 05:31:12,499 INFO L276 IsEmpty]: Start isEmpty. Operand 15087 states and 43821 transitions. [2019-12-28 05:31:12,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 05:31:12,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:12,514 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] [2019-12-28 05:31:12,514 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:12,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:12,515 INFO L82 PathProgramCache]: Analyzing trace with hash 380772358, now seen corresponding path program 3 times [2019-12-28 05:31:12,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:12,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546531238] [2019-12-28 05:31:12,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:12,645 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-28 05:31:12,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546531238] [2019-12-28 05:31:12,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:12,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 05:31:12,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1489723386] [2019-12-28 05:31:12,646 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:12,670 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:12,801 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 348 transitions. [2019-12-28 05:31:12,801 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:13,136 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-28 05:31:13,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-28 05:31:13,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:13,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-28 05:31:13,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-28 05:31:13,138 INFO L87 Difference]: Start difference. First operand 15087 states and 43821 transitions. Second operand 16 states. [2019-12-28 05:31:16,102 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-12-28 05:31:16,304 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-12-28 05:31:16,494 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-12-28 05:31:16,671 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-12-28 05:31:16,867 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-12-28 05:31:17,098 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-12-28 05:31:17,369 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-12-28 05:31:18,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:18,264 INFO L93 Difference]: Finished difference Result 54449 states and 159520 transitions. [2019-12-28 05:31:18,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-28 05:31:18,265 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 92 [2019-12-28 05:31:18,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:18,338 INFO L225 Difference]: With dead ends: 54449 [2019-12-28 05:31:18,339 INFO L226 Difference]: Without dead ends: 47056 [2019-12-28 05:31:18,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1488 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1052, Invalid=3918, Unknown=0, NotChecked=0, Total=4970 [2019-12-28 05:31:18,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47056 states. [2019-12-28 05:31:18,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47056 to 17708. [2019-12-28 05:31:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17708 states. [2019-12-28 05:31:18,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17708 states to 17708 states and 52719 transitions. [2019-12-28 05:31:18,772 INFO L78 Accepts]: Start accepts. Automaton has 17708 states and 52719 transitions. Word has length 92 [2019-12-28 05:31:18,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:18,772 INFO L462 AbstractCegarLoop]: Abstraction has 17708 states and 52719 transitions. [2019-12-28 05:31:18,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-28 05:31:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 17708 states and 52719 transitions. [2019-12-28 05:31:18,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 05:31:18,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:18,793 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] [2019-12-28 05:31:18,793 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:18,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:18,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1218439478, now seen corresponding path program 4 times [2019-12-28 05:31:18,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:18,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630133774] [2019-12-28 05:31:18,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 05:31:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 05:31:18,874 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 05:31:18,875 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 05:31:19,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 05:31:19 BasicIcfg [2019-12-28 05:31:19,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 05:31:19,049 INFO L168 Benchmark]: Toolchain (without parser) took 173798.66 ms. Allocated memory was 136.8 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.1 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-28 05:31:19,050 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-28 05:31:19,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.74 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 99.7 MB in the beginning and 154.6 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-28 05:31:19,051 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.12 ms. Allocated memory is still 200.3 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 05:31:19,051 INFO L168 Benchmark]: Boogie Preprocessor took 35.90 ms. Allocated memory is still 200.3 MB. Free memory was 151.9 MB in the beginning and 149.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-28 05:31:19,052 INFO L168 Benchmark]: RCFGBuilder took 745.77 ms. Allocated memory is still 200.3 MB. Free memory was 149.9 MB in the beginning and 106.1 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-28 05:31:19,052 INFO L168 Benchmark]: TraceAbstraction took 172192.46 ms. Allocated memory was 200.3 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 106.1 MB in the beginning and 2.4 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-28 05:31:19,055 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 753.74 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 99.7 MB in the beginning and 154.6 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.12 ms. Allocated memory is still 200.3 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.90 ms. Allocated memory is still 200.3 MB. Free memory was 151.9 MB in the beginning and 149.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 745.77 ms. Allocated memory is still 200.3 MB. Free memory was 149.9 MB in the beginning and 106.1 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 172192.46 ms. Allocated memory was 200.3 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 106.1 MB in the beginning and 2.4 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.2 GB. 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: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L701] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L703] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L705] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L706] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L707] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L708] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L709] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L710] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L711] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0] [L712] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0] [L713] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L714] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L715] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L813] 0 pthread_t t2586; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L814] FCALL, FORK 0 pthread_create(&t2586, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L815] 0 pthread_t t2587; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L816] FCALL, FORK 0 pthread_create(&t2587, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L817] 0 pthread_t t2588; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L818] FCALL, FORK 0 pthread_create(&t2588, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 1 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 3 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L729] 1 z = 2 [L734] 1 __unbuffered_p0_EAX = x [L739] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L755] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L755] 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) [L756] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L756] 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)) [L757] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L757] 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)) [L758] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L758] 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)) [L759] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L759] 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)) [L760] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L760] 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)) [L761] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L761] 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)) [L762] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L763] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L763] 2 y = y$flush_delayed ? y$mem_tmp : y [L764] 2 y$flush_delayed = (_Bool)0 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L824] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L824] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L824] 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) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L826] 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 [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L828] 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 [L831] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 171.7s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 73.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6839 SDtfs, 12087 SDslu, 19066 SDs, 0 SdLazy, 6960 SolverSat, 716 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 387 GetRequests, 131 SyntacticMatches, 7 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1963 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228422occurred 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: 73.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 258260 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1707 NumberOfCodeBlocks, 1707 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1592 ConstructedInterpolants, 0 QuantifiedInterpolants, 342047 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...