/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-12 17:04:40,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-12 17:04:40,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-12 17:04:40,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-12 17:04:40,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-12 17:04:40,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-12 17:04:40,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-12 17:04:40,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-12 17:04:40,873 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-12 17:04:40,874 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-12 17:04:40,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-12 17:04:40,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-12 17:04:40,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-12 17:04:40,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-12 17:04:40,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-12 17:04:40,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-12 17:04:40,878 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-12 17:04:40,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-12 17:04:40,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-12 17:04:40,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-12 17:04:40,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-12 17:04:40,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-12 17:04:40,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-12 17:04:40,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-12 17:04:40,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-12 17:04:40,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-12 17:04:40,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-12 17:04:40,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-12 17:04:40,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-12 17:04:40,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-12 17:04:40,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-12 17:04:40,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-12 17:04:40,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-12 17:04:40,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-12 17:04:40,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-12 17:04:40,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-12 17:04:40,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-12 17:04:40,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-12 17:04:40,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-12 17:04:40,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-12 17:04:40,892 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-12 17:04:40,893 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-08-12 17:04:40,907 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-12 17:04:40,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-12 17:04:40,908 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-12 17:04:40,908 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-12 17:04:40,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-12 17:04:40,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-12 17:04:40,909 INFO L138 SettingsManager]: * Use SBE=true [2021-08-12 17:04:40,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-12 17:04:40,909 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-12 17:04:40,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-12 17:04:40,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-12 17:04:40,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-12 17:04:40,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-12 17:04:40,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-12 17:04:40,910 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-12 17:04:40,910 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-12 17:04:40,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-12 17:04:40,910 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-12 17:04:40,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-12 17:04:40,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-12 17:04:40,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-12 17:04:40,910 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-12 17:04:40,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-12 17:04:40,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 17:04:40,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-12 17:04:40,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-12 17:04:40,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-12 17:04:40,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-12 17:04:40,911 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-12 17:04:40,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-12 17:04:40,911 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-08-12 17:04:41,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-12 17:04:41,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-12 17:04:41,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-12 17:04:41,171 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-12 17:04:41,172 INFO L275 PluginConnector]: CDTParser initialized [2021-08-12 17:04:41,172 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2021-08-12 17:04:41,213 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f45e400b/fc0efd3f243046aba57c0712e4bed4ff/FLAG68d32f5fc [2021-08-12 17:04:41,647 INFO L306 CDTParser]: Found 1 translation units. [2021-08-12 17:04:41,647 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2021-08-12 17:04:41,670 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f45e400b/fc0efd3f243046aba57c0712e4bed4ff/FLAG68d32f5fc [2021-08-12 17:04:41,680 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f45e400b/fc0efd3f243046aba57c0712e4bed4ff [2021-08-12 17:04:41,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-12 17:04:41,685 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-12 17:04:41,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-12 17:04:41,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-12 17:04:41,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-12 17:04:41,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 05:04:41" (1/1) ... [2021-08-12 17:04:41,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3559ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:04:41, skipping insertion in model container [2021-08-12 17:04:41,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 05:04:41" (1/1) ... [2021-08-12 17:04:41,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-12 17:04:41,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-12 17:04:41,955 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i[948,961] [2021-08-12 17:04:42,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 17:04:42,063 INFO L203 MainTranslator]: Completed pre-run [2021-08-12 17:04:42,072 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i[948,961] [2021-08-12 17:04:42,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 17:04:42,149 INFO L208 MainTranslator]: Completed translation [2021-08-12 17:04:42,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:04:42 WrapperNode [2021-08-12 17:04:42,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-12 17:04:42,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-12 17:04:42,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-12 17:04:42,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-12 17:04:42,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:04:42" (1/1) ... [2021-08-12 17:04:42,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:04:42" (1/1) ... [2021-08-12 17:04:42,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-12 17:04:42,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-12 17:04:42,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-12 17:04:42,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-12 17:04:42,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:04:42" (1/1) ... [2021-08-12 17:04:42,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:04:42" (1/1) ... [2021-08-12 17:04:42,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:04:42" (1/1) ... [2021-08-12 17:04:42,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:04:42" (1/1) ... [2021-08-12 17:04:42,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:04:42" (1/1) ... [2021-08-12 17:04:42,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:04:42" (1/1) ... [2021-08-12 17:04:42,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:04:42" (1/1) ... [2021-08-12 17:04:42,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-12 17:04:42,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-12 17:04:42,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-12 17:04:42,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-12 17:04:42,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:04:42" (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 [2021-08-12 17:04:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-12 17:04:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-12 17:04:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-12 17:04:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-12 17:04:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-12 17:04:42,300 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-12 17:04:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-12 17:04:42,300 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-12 17:04:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-12 17:04:42,301 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-12 17:04:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-08-12 17:04:42,301 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-08-12 17:04:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-12 17:04:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-12 17:04:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-12 17:04:42,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-12 17:04:42,302 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-12 17:04:43,591 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-12 17:04:43,591 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-12 17:04:43,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 05:04:43 BoogieIcfgContainer [2021-08-12 17:04:43,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-12 17:04:43,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-12 17:04:43,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-12 17:04:43,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-12 17:04:43,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.08 05:04:41" (1/3) ... [2021-08-12 17:04:43,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7485a252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 05:04:43, skipping insertion in model container [2021-08-12 17:04:43,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:04:42" (2/3) ... [2021-08-12 17:04:43,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7485a252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 05:04:43, skipping insertion in model container [2021-08-12 17:04:43,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 05:04:43" (3/3) ... [2021-08-12 17:04:43,598 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_rmo.opt.i [2021-08-12 17:04:43,602 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-12 17:04:43,602 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-12 17:04:43,603 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-12 17:04:43,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,626 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,626 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,626 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,626 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,627 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,627 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,627 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,628 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,628 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,629 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,629 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,629 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,631 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,632 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,632 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,632 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,632 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,632 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,632 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,633 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,636 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,637 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,638 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,638 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,639 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,639 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,640 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,641 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,641 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:04:43,642 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-12 17:04:43,655 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-12 17:04:43,666 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-12 17:04:43,666 INFO L379 AbstractCegarLoop]: Hoare is true [2021-08-12 17:04:43,667 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-12 17:04:43,667 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-12 17:04:43,667 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-12 17:04:43,667 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-12 17:04:43,667 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-12 17:04:43,667 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-12 17:04:43,673 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 128 transitions, 276 flow [2021-08-12 17:05:15,489 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 128228 states, 128224 states have (on average 4.5057087596705765) internal successors, (577740), 128227 states have internal predecessors, (577740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:15,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 128228 states, 128224 states have (on average 4.5057087596705765) internal successors, (577740), 128227 states have internal predecessors, (577740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:15,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-12 17:05:15,956 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:05:15,957 INFO L550 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] [2021-08-12 17:05:15,958 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:05:15,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:05:15,964 INFO L82 PathProgramCache]: Analyzing trace with hash 469574097, now seen corresponding path program 1 times [2021-08-12 17:05:15,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:05:15,985 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760134035] [2021-08-12 17:05:15,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:05:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:05:16,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:05:16,395 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:05:16,395 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760134035] [2021-08-12 17:05:16,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760134035] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:05:16,396 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:05:16,396 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-12 17:05:16,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893077029] [2021-08-12 17:05:16,399 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 17:05:16,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:05:16,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 17:05:16,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 17:05:16,706 INFO L87 Difference]: Start difference. First operand has 128228 states, 128224 states have (on average 4.5057087596705765) internal successors, (577740), 128227 states have internal predecessors, (577740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 33.5) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:05:20,808 INFO L93 Difference]: Finished difference Result 206628 states and 937540 transitions. [2021-08-12 17:05:20,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 17:05:20,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 33.5) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-08-12 17:05:20,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:05:21,735 INFO L225 Difference]: With dead ends: 206628 [2021-08-12 17:05:21,735 INFO L226 Difference]: Without dead ends: 61980 [2021-08-12 17:05:22,351 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 17:05:22,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61980 states. [2021-08-12 17:05:25,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61980 to 61980. [2021-08-12 17:05:25,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61980 states, 61979 states have (on average 4.371884025234354) internal successors, (270965), 61979 states have internal predecessors, (270965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61980 states to 61980 states and 270965 transitions. [2021-08-12 17:05:26,506 INFO L78 Accepts]: Start accepts. Automaton has 61980 states and 270965 transitions. Word has length 67 [2021-08-12 17:05:26,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:05:26,507 INFO L482 AbstractCegarLoop]: Abstraction has 61980 states and 270965 transitions. [2021-08-12 17:05:26,507 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 33.5) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:26,507 INFO L276 IsEmpty]: Start isEmpty. Operand 61980 states and 270965 transitions. [2021-08-12 17:05:26,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-12 17:05:26,587 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:05:26,588 INFO L550 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] [2021-08-12 17:05:26,588 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-12 17:05:26,588 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:05:26,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:05:26,591 INFO L82 PathProgramCache]: Analyzing trace with hash -988087535, now seen corresponding path program 1 times [2021-08-12 17:05:26,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:05:26,591 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938418778] [2021-08-12 17:05:26,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:05:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:05:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:05:26,726 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:05:26,727 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938418778] [2021-08-12 17:05:26,727 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938418778] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:05:26,727 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:05:26,727 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:05:26,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182176671] [2021-08-12 17:05:26,728 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:05:26,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:05:26,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:05:26,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:05:26,729 INFO L87 Difference]: Start difference. First operand 61980 states and 270965 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:05:28,912 INFO L93 Difference]: Finished difference Result 76092 states and 331025 transitions. [2021-08-12 17:05:28,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:05:28,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-08-12 17:05:28,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:05:29,487 INFO L225 Difference]: With dead ends: 76092 [2021-08-12 17:05:29,487 INFO L226 Difference]: Without dead ends: 52572 [2021-08-12 17:05:29,548 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 71.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:05:30,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52572 states. [2021-08-12 17:05:31,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52572 to 52572. [2021-08-12 17:05:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52572 states, 52571 states have (on average 4.332978257974929) internal successors, (227789), 52571 states have internal predecessors, (227789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52572 states to 52572 states and 227789 transitions. [2021-08-12 17:05:32,457 INFO L78 Accepts]: Start accepts. Automaton has 52572 states and 227789 transitions. Word has length 79 [2021-08-12 17:05:32,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:05:32,458 INFO L482 AbstractCegarLoop]: Abstraction has 52572 states and 227789 transitions. [2021-08-12 17:05:32,458 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 52572 states and 227789 transitions. [2021-08-12 17:05:32,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-12 17:05:32,574 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:05:32,574 INFO L550 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] [2021-08-12 17:05:32,575 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-12 17:05:32,575 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:05:32,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:05:32,575 INFO L82 PathProgramCache]: Analyzing trace with hash 780855984, now seen corresponding path program 1 times [2021-08-12 17:05:32,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:05:32,575 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118563064] [2021-08-12 17:05:32,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:05:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:05:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:05:32,690 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:05:32,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118563064] [2021-08-12 17:05:32,690 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118563064] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:05:32,691 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:05:32,691 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:05:32,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524411196] [2021-08-12 17:05:32,691 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:05:32,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:05:32,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:05:32,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:05:32,692 INFO L87 Difference]: Start difference. First operand 52572 states and 227789 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:05:34,333 INFO L93 Difference]: Finished difference Result 65172 states and 281009 transitions. [2021-08-12 17:05:34,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:05:34,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-08-12 17:05:34,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:05:34,764 INFO L225 Difference]: With dead ends: 65172 [2021-08-12 17:05:34,764 INFO L226 Difference]: Without dead ends: 51060 [2021-08-12 17:05:34,797 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 70.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:05:35,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51060 states. [2021-08-12 17:05:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51060 to 51060. [2021-08-12 17:05:36,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51060 states, 51059 states have (on average 4.3223917428856815) internal successors, (220697), 51059 states have internal predecessors, (220697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51060 states to 51060 states and 220697 transitions. [2021-08-12 17:05:37,250 INFO L78 Accepts]: Start accepts. Automaton has 51060 states and 220697 transitions. Word has length 83 [2021-08-12 17:05:37,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:05:37,251 INFO L482 AbstractCegarLoop]: Abstraction has 51060 states and 220697 transitions. [2021-08-12 17:05:37,251 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 51060 states and 220697 transitions. [2021-08-12 17:05:37,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-12 17:05:37,325 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:05:37,326 INFO L550 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] [2021-08-12 17:05:37,326 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-12 17:05:37,326 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:05:37,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:05:37,327 INFO L82 PathProgramCache]: Analyzing trace with hash -2127061041, now seen corresponding path program 1 times [2021-08-12 17:05:37,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:05:37,327 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910800543] [2021-08-12 17:05:37,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:05:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:05:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:05:37,530 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:05:37,530 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910800543] [2021-08-12 17:05:37,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910800543] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:05:37,530 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:05:37,530 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:05:37,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221523324] [2021-08-12 17:05:37,531 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:05:37,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:05:37,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:05:37,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:05:37,531 INFO L87 Difference]: Start difference. First operand 51060 states and 220697 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:38,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:05:38,805 INFO L93 Difference]: Finished difference Result 60348 states and 259469 transitions. [2021-08-12 17:05:38,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:05:38,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-12 17:05:38,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:05:39,123 INFO L225 Difference]: With dead ends: 60348 [2021-08-12 17:05:39,123 INFO L226 Difference]: Without dead ends: 49764 [2021-08-12 17:05:39,149 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 90.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:05:39,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49764 states. [2021-08-12 17:05:40,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49764 to 49764. [2021-08-12 17:05:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49764 states, 49763 states have (on average 4.313425637521854) internal successors, (214649), 49763 states have internal predecessors, (214649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:41,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49764 states to 49764 states and 214649 transitions. [2021-08-12 17:05:41,450 INFO L78 Accepts]: Start accepts. Automaton has 49764 states and 214649 transitions. Word has length 85 [2021-08-12 17:05:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:05:41,451 INFO L482 AbstractCegarLoop]: Abstraction has 49764 states and 214649 transitions. [2021-08-12 17:05:41,451 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:41,451 INFO L276 IsEmpty]: Start isEmpty. Operand 49764 states and 214649 transitions. [2021-08-12 17:05:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-12 17:05:41,526 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:05:41,526 INFO L550 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] [2021-08-12 17:05:41,526 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-12 17:05:41,527 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:05:41,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:05:41,527 INFO L82 PathProgramCache]: Analyzing trace with hash -841553371, now seen corresponding path program 1 times [2021-08-12 17:05:41,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:05:41,527 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282407252] [2021-08-12 17:05:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:05:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:05:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:05:41,595 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:05:41,595 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282407252] [2021-08-12 17:05:41,595 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282407252] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:05:41,595 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:05:41,595 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:05:41,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465319821] [2021-08-12 17:05:41,596 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:05:41,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:05:41,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:05:41,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:05:41,597 INFO L87 Difference]: Start difference. First operand 49764 states and 214649 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:43,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:05:43,396 INFO L93 Difference]: Finished difference Result 82188 states and 350563 transitions. [2021-08-12 17:05:43,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:05:43,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-08-12 17:05:43,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:05:43,760 INFO L225 Difference]: With dead ends: 82188 [2021-08-12 17:05:43,760 INFO L226 Difference]: Without dead ends: 53796 [2021-08-12 17:05:43,806 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 67.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:05:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53796 states. [2021-08-12 17:05:45,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53796 to 47748. [2021-08-12 17:05:45,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47748 states, 47747 states have (on average 4.222736507005676) internal successors, (201623), 47747 states have internal predecessors, (201623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:46,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47748 states to 47748 states and 201623 transitions. [2021-08-12 17:05:46,249 INFO L78 Accepts]: Start accepts. Automaton has 47748 states and 201623 transitions. Word has length 86 [2021-08-12 17:05:46,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:05:46,250 INFO L482 AbstractCegarLoop]: Abstraction has 47748 states and 201623 transitions. [2021-08-12 17:05:46,250 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:46,250 INFO L276 IsEmpty]: Start isEmpty. Operand 47748 states and 201623 transitions. [2021-08-12 17:05:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-12 17:05:46,358 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:05:46,358 INFO L550 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] [2021-08-12 17:05:46,358 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-12 17:05:46,358 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:05:46,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:05:46,359 INFO L82 PathProgramCache]: Analyzing trace with hash 2022519278, now seen corresponding path program 1 times [2021-08-12 17:05:46,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:05:46,359 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388915408] [2021-08-12 17:05:46,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:05:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:05:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:05:46,500 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:05:46,500 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388915408] [2021-08-12 17:05:46,500 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388915408] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:05:46,500 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:05:46,500 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 17:05:46,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36068508] [2021-08-12 17:05:46,501 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 17:05:46,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:05:46,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 17:05:46,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-12 17:05:46,501 INFO L87 Difference]: Start difference. First operand 47748 states and 201623 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:48,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:05:48,134 INFO L93 Difference]: Finished difference Result 56520 states and 238069 transitions. [2021-08-12 17:05:48,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-12 17:05:48,135 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-08-12 17:05:48,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:05:48,612 INFO L225 Difference]: With dead ends: 56520 [2021-08-12 17:05:48,612 INFO L226 Difference]: Without dead ends: 47232 [2021-08-12 17:05:48,643 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 208.9ms TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-08-12 17:05:48,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47232 states. [2021-08-12 17:05:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47232 to 47232. [2021-08-12 17:05:50,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47232 states, 47231 states have (on average 4.217801867417586) internal successors, (199211), 47231 states have internal predecessors, (199211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47232 states to 47232 states and 199211 transitions. [2021-08-12 17:05:50,785 INFO L78 Accepts]: Start accepts. Automaton has 47232 states and 199211 transitions. Word has length 87 [2021-08-12 17:05:50,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:05:50,786 INFO L482 AbstractCegarLoop]: Abstraction has 47232 states and 199211 transitions. [2021-08-12 17:05:50,786 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:50,786 INFO L276 IsEmpty]: Start isEmpty. Operand 47232 states and 199211 transitions. [2021-08-12 17:05:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-12 17:05:50,861 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:05:50,861 INFO L550 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] [2021-08-12 17:05:50,861 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-12 17:05:50,861 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:05:50,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:05:50,861 INFO L82 PathProgramCache]: Analyzing trace with hash 55619806, now seen corresponding path program 1 times [2021-08-12 17:05:50,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:05:50,862 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067381208] [2021-08-12 17:05:50,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:05:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:05:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:05:51,171 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:05:51,171 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067381208] [2021-08-12 17:05:51,172 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067381208] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:05:51,172 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:05:51,172 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 17:05:51,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116428464] [2021-08-12 17:05:51,172 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 17:05:51,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:05:51,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 17:05:51,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-08-12 17:05:51,173 INFO L87 Difference]: Start difference. First operand 47232 states and 199211 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:52,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:05:52,666 INFO L93 Difference]: Finished difference Result 56834 states and 239567 transitions. [2021-08-12 17:05:52,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-12 17:05:52,667 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-12 17:05:52,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:05:53,032 INFO L225 Difference]: With dead ends: 56834 [2021-08-12 17:05:53,032 INFO L226 Difference]: Without dead ends: 49094 [2021-08-12 17:05:53,063 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 145.5ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-08-12 17:05:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49094 states. [2021-08-12 17:05:54,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49094 to 49094. [2021-08-12 17:05:54,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49094 states, 49093 states have (on average 4.2252255922432935) internal successors, (207429), 49093 states have internal predecessors, (207429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49094 states to 49094 states and 207429 transitions. [2021-08-12 17:05:55,237 INFO L78 Accepts]: Start accepts. Automaton has 49094 states and 207429 transitions. Word has length 88 [2021-08-12 17:05:55,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:05:55,237 INFO L482 AbstractCegarLoop]: Abstraction has 49094 states and 207429 transitions. [2021-08-12 17:05:55,238 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:55,238 INFO L276 IsEmpty]: Start isEmpty. Operand 49094 states and 207429 transitions. [2021-08-12 17:05:55,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-12 17:05:55,568 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:05:55,584 INFO L550 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] [2021-08-12 17:05:55,585 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-12 17:05:55,585 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:05:55,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:05:55,585 INFO L82 PathProgramCache]: Analyzing trace with hash -645354970, now seen corresponding path program 2 times [2021-08-12 17:05:55,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:05:55,585 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505223973] [2021-08-12 17:05:55,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:05:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:05:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:05:55,744 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:05:55,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505223973] [2021-08-12 17:05:55,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505223973] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:05:55,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:05:55,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 17:05:55,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162681481] [2021-08-12 17:05:55,745 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 17:05:55,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:05:55,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 17:05:55,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-12 17:05:55,748 INFO L87 Difference]: Start difference. First operand 49094 states and 207429 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:05:57,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:05:57,154 INFO L93 Difference]: Finished difference Result 60022 states and 253046 transitions. [2021-08-12 17:05:57,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 17:05:57,155 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-12 17:05:57,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:05:57,690 INFO L225 Difference]: With dead ends: 60022 [2021-08-12 17:05:57,690 INFO L226 Difference]: Without dead ends: 52282 [2021-08-12 17:05:57,715 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 206.4ms TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-08-12 17:05:57,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52282 states. [2021-08-12 17:05:59,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52282 to 48996. [2021-08-12 17:05:59,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48996 states, 48995 states have (on average 4.226533319726503) internal successors, (207079), 48995 states have internal predecessors, (207079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48996 states to 48996 states and 207079 transitions. [2021-08-12 17:06:00,306 INFO L78 Accepts]: Start accepts. Automaton has 48996 states and 207079 transitions. Word has length 88 [2021-08-12 17:06:00,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:06:00,307 INFO L482 AbstractCegarLoop]: Abstraction has 48996 states and 207079 transitions. [2021-08-12 17:06:00,307 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:00,307 INFO L276 IsEmpty]: Start isEmpty. Operand 48996 states and 207079 transitions. [2021-08-12 17:06:00,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-12 17:06:00,421 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:06:00,421 INFO L550 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] [2021-08-12 17:06:00,422 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-12 17:06:00,422 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:06:00,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:06:00,422 INFO L82 PathProgramCache]: Analyzing trace with hash -586625726, now seen corresponding path program 3 times [2021-08-12 17:06:00,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:06:00,422 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57462727] [2021-08-12 17:06:00,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:06:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:06:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:06:00,547 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:06:00,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57462727] [2021-08-12 17:06:00,548 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57462727] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:06:00,548 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:06:00,548 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 17:06:00,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367801081] [2021-08-12 17:06:00,548 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 17:06:00,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:06:00,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 17:06:00,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-08-12 17:06:00,549 INFO L87 Difference]: Start difference. First operand 48996 states and 207079 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:06:02,502 INFO L93 Difference]: Finished difference Result 59704 states and 251842 transitions. [2021-08-12 17:06:02,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-12 17:06:02,503 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-12 17:06:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:06:03,005 INFO L225 Difference]: With dead ends: 59704 [2021-08-12 17:06:03,006 INFO L226 Difference]: Without dead ends: 51276 [2021-08-12 17:06:03,034 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 143.4ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-08-12 17:06:03,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51276 states. [2021-08-12 17:06:05,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51276 to 48480. [2021-08-12 17:06:05,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48480 states, 48479 states have (on average 4.212669403246767) internal successors, (204226), 48479 states have internal predecessors, (204226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48480 states to 48480 states and 204226 transitions. [2021-08-12 17:06:05,466 INFO L78 Accepts]: Start accepts. Automaton has 48480 states and 204226 transitions. Word has length 88 [2021-08-12 17:06:05,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:06:05,467 INFO L482 AbstractCegarLoop]: Abstraction has 48480 states and 204226 transitions. [2021-08-12 17:06:05,467 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:05,467 INFO L276 IsEmpty]: Start isEmpty. Operand 48480 states and 204226 transitions. [2021-08-12 17:06:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-12 17:06:05,544 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:06:05,544 INFO L550 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] [2021-08-12 17:06:05,544 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-12 17:06:05,544 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:06:05,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:06:05,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1043458227, now seen corresponding path program 1 times [2021-08-12 17:06:05,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:06:05,545 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441762466] [2021-08-12 17:06:05,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:06:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:06:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:06:05,668 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:06:05,668 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441762466] [2021-08-12 17:06:05,668 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441762466] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:06:05,668 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:06:05,668 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 17:06:05,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658639111] [2021-08-12 17:06:05,669 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 17:06:05,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:06:05,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 17:06:05,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:06:05,669 INFO L87 Difference]: Start difference. First operand 48480 states and 204226 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:06:08,654 INFO L93 Difference]: Finished difference Result 77374 states and 322999 transitions. [2021-08-12 17:06:08,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 17:06:08,654 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-08-12 17:06:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:06:09,153 INFO L225 Difference]: With dead ends: 77374 [2021-08-12 17:06:09,154 INFO L226 Difference]: Without dead ends: 71182 [2021-08-12 17:06:09,191 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 165.7ms TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2021-08-12 17:06:09,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71182 states. [2021-08-12 17:06:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71182 to 57790. [2021-08-12 17:06:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57790 states, 57789 states have (on average 4.212808666009102) internal successors, (243454), 57789 states have internal predecessors, (243454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:12,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57790 states to 57790 states and 243454 transitions. [2021-08-12 17:06:12,222 INFO L78 Accepts]: Start accepts. Automaton has 57790 states and 243454 transitions. Word has length 89 [2021-08-12 17:06:12,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:06:12,222 INFO L482 AbstractCegarLoop]: Abstraction has 57790 states and 243454 transitions. [2021-08-12 17:06:12,222 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:12,223 INFO L276 IsEmpty]: Start isEmpty. Operand 57790 states and 243454 transitions. [2021-08-12 17:06:12,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-12 17:06:12,668 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:06:12,668 INFO L550 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] [2021-08-12 17:06:12,668 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-12 17:06:12,668 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:06:12,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:06:12,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1744433003, now seen corresponding path program 2 times [2021-08-12 17:06:12,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:06:12,669 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092456844] [2021-08-12 17:06:12,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:06:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:06:12,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:06:12,884 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:06:12,884 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092456844] [2021-08-12 17:06:12,884 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092456844] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:06:12,884 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:06:12,884 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-12 17:06:12,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775720947] [2021-08-12 17:06:12,885 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-08-12 17:06:12,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:06:12,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-12 17:06:12,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-08-12 17:06:12,885 INFO L87 Difference]: Start difference. First operand 57790 states and 243454 transitions. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:15,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:06:15,854 INFO L93 Difference]: Finished difference Result 64962 states and 272434 transitions. [2021-08-12 17:06:15,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-12 17:06:15,855 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-08-12 17:06:15,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:06:16,445 INFO L225 Difference]: With dead ends: 64962 [2021-08-12 17:06:16,445 INFO L226 Difference]: Without dead ends: 58770 [2021-08-12 17:06:16,475 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 314.7ms TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2021-08-12 17:06:16,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58770 states. [2021-08-12 17:06:18,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58770 to 57300. [2021-08-12 17:06:19,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57300 states, 57299 states have (on average 4.220003839508543) internal successors, (241802), 57299 states have internal predecessors, (241802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57300 states to 57300 states and 241802 transitions. [2021-08-12 17:06:19,407 INFO L78 Accepts]: Start accepts. Automaton has 57300 states and 241802 transitions. Word has length 89 [2021-08-12 17:06:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:06:19,409 INFO L482 AbstractCegarLoop]: Abstraction has 57300 states and 241802 transitions. [2021-08-12 17:06:19,409 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 57300 states and 241802 transitions. [2021-08-12 17:06:19,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-12 17:06:19,500 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:06:19,500 INFO L550 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] [2021-08-12 17:06:19,500 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-12 17:06:19,500 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:06:19,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:06:19,501 INFO L82 PathProgramCache]: Analyzing trace with hash -371300851, now seen corresponding path program 3 times [2021-08-12 17:06:19,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:06:19,501 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815643731] [2021-08-12 17:06:19,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:06:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:06:20,124 WARN L205 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2021-08-12 17:06:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:06:20,231 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:06:20,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815643731] [2021-08-12 17:06:20,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815643731] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:06:20,231 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:06:20,231 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-12 17:06:20,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845941650] [2021-08-12 17:06:20,232 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-08-12 17:06:20,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:06:20,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-12 17:06:20,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-08-12 17:06:20,232 INFO L87 Difference]: Start difference. First operand 57300 states and 241802 transitions. Second operand has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:22,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:06:22,756 INFO L93 Difference]: Finished difference Result 61428 states and 258346 transitions. [2021-08-12 17:06:22,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-12 17:06:22,757 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-08-12 17:06:22,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:06:23,328 INFO L225 Difference]: With dead ends: 61428 [2021-08-12 17:06:23,328 INFO L226 Difference]: Without dead ends: 55236 [2021-08-12 17:06:23,351 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 667.6ms TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-08-12 17:06:23,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55236 states. [2021-08-12 17:06:25,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55236 to 46416. [2021-08-12 17:06:25,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46416 states, 46415 states have (on average 4.203253258644835) internal successors, (195094), 46415 states have internal predecessors, (195094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46416 states to 46416 states and 195094 transitions. [2021-08-12 17:06:25,631 INFO L78 Accepts]: Start accepts. Automaton has 46416 states and 195094 transitions. Word has length 89 [2021-08-12 17:06:25,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:06:25,631 INFO L482 AbstractCegarLoop]: Abstraction has 46416 states and 195094 transitions. [2021-08-12 17:06:25,631 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:25,631 INFO L276 IsEmpty]: Start isEmpty. Operand 46416 states and 195094 transitions. [2021-08-12 17:06:25,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-12 17:06:25,708 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:06:25,708 INFO L550 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] [2021-08-12 17:06:25,708 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-12 17:06:25,708 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:06:25,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:06:25,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1627137647, now seen corresponding path program 1 times [2021-08-12 17:06:25,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:06:25,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221954102] [2021-08-12 17:06:25,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:06:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:06:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:06:25,775 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:06:25,775 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221954102] [2021-08-12 17:06:25,775 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221954102] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:06:25,775 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:06:25,775 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:06:25,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722673732] [2021-08-12 17:06:25,775 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:06:25,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:06:25,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:06:25,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:06:25,776 INFO L87 Difference]: Start difference. First operand 46416 states and 195094 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:28,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:06:28,954 INFO L93 Difference]: Finished difference Result 73668 states and 308416 transitions. [2021-08-12 17:06:28,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:06:28,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-08-12 17:06:28,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:06:29,355 INFO L225 Difference]: With dead ends: 73668 [2021-08-12 17:06:29,355 INFO L226 Difference]: Without dead ends: 42780 [2021-08-12 17:06:29,413 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 57.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:06:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42780 states. [2021-08-12 17:06:31,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42780 to 42780. [2021-08-12 17:06:31,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42780 states, 42779 states have (on average 4.1478762944435354) internal successors, (177442), 42779 states have internal predecessors, (177442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:31,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42780 states to 42780 states and 177442 transitions. [2021-08-12 17:06:31,972 INFO L78 Accepts]: Start accepts. Automaton has 42780 states and 177442 transitions. Word has length 89 [2021-08-12 17:06:31,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:06:31,973 INFO L482 AbstractCegarLoop]: Abstraction has 42780 states and 177442 transitions. [2021-08-12 17:06:31,973 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:31,973 INFO L276 IsEmpty]: Start isEmpty. Operand 42780 states and 177442 transitions. [2021-08-12 17:06:32,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-08-12 17:06:32,093 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:06:32,093 INFO L550 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] [2021-08-12 17:06:32,093 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-12 17:06:32,093 INFO L430 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:06:32,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:06:32,093 INFO L82 PathProgramCache]: Analyzing trace with hash -966078751, now seen corresponding path program 1 times [2021-08-12 17:06:32,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:06:32,093 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357898706] [2021-08-12 17:06:32,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:06:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:06:32,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:06:32,178 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:06:32,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357898706] [2021-08-12 17:06:32,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357898706] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:06:32,178 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:06:32,178 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 17:06:32,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147946576] [2021-08-12 17:06:32,178 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 17:06:32,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:06:32,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 17:06:32,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 17:06:32,179 INFO L87 Difference]: Start difference. First operand 42780 states and 177442 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:32,979 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-08-12 17:06:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:06:34,873 INFO L93 Difference]: Finished difference Result 59952 states and 246400 transitions. [2021-08-12 17:06:34,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 17:06:34,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-08-12 17:06:34,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:06:35,435 INFO L225 Difference]: With dead ends: 59952 [2021-08-12 17:06:35,435 INFO L226 Difference]: Without dead ends: 32700 [2021-08-12 17:06:35,468 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 188.9ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-12 17:06:35,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32700 states. [2021-08-12 17:06:36,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32700 to 32700. [2021-08-12 17:06:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32700 states, 32699 states have (on average 4.024282088137252) internal successors, (131590), 32699 states have internal predecessors, (131590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32700 states to 32700 states and 131590 transitions. [2021-08-12 17:06:37,151 INFO L78 Accepts]: Start accepts. Automaton has 32700 states and 131590 transitions. Word has length 90 [2021-08-12 17:06:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:06:37,151 INFO L482 AbstractCegarLoop]: Abstraction has 32700 states and 131590 transitions. [2021-08-12 17:06:37,151 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:37,151 INFO L276 IsEmpty]: Start isEmpty. Operand 32700 states and 131590 transitions. [2021-08-12 17:06:37,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-08-12 17:06:37,207 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:06:37,207 INFO L550 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] [2021-08-12 17:06:37,207 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-12 17:06:37,208 INFO L430 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:06:37,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:06:37,208 INFO L82 PathProgramCache]: Analyzing trace with hash -763895198, now seen corresponding path program 1 times [2021-08-12 17:06:37,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:06:37,208 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005557827] [2021-08-12 17:06:37,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:06:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:06:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:06:37,348 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:06:37,348 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005557827] [2021-08-12 17:06:37,348 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005557827] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:06:37,348 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:06:37,348 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:06:37,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298998415] [2021-08-12 17:06:37,348 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:06:37,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:06:37,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:06:37,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:06:37,349 INFO L87 Difference]: Start difference. First operand 32700 states and 131590 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:39,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:06:39,886 INFO L93 Difference]: Finished difference Result 52158 states and 207783 transitions. [2021-08-12 17:06:39,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:06:39,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-08-12 17:06:39,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:06:40,207 INFO L225 Difference]: With dead ends: 52158 [2021-08-12 17:06:40,207 INFO L226 Difference]: Without dead ends: 33780 [2021-08-12 17:06:40,240 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 64.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:06:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33780 states. [2021-08-12 17:06:41,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33780 to 31800. [2021-08-12 17:06:41,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31800 states, 31799 states have (on average 3.9402496933865843) internal successors, (125296), 31799 states have internal predecessors, (125296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31800 states to 31800 states and 125296 transitions. [2021-08-12 17:06:41,923 INFO L78 Accepts]: Start accepts. Automaton has 31800 states and 125296 transitions. Word has length 92 [2021-08-12 17:06:41,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:06:41,923 INFO L482 AbstractCegarLoop]: Abstraction has 31800 states and 125296 transitions. [2021-08-12 17:06:41,923 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:41,923 INFO L276 IsEmpty]: Start isEmpty. Operand 31800 states and 125296 transitions. [2021-08-12 17:06:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-08-12 17:06:41,975 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:06:41,975 INFO L550 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] [2021-08-12 17:06:41,975 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-12 17:06:41,975 INFO L430 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:06:41,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:06:41,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1065422082, now seen corresponding path program 1 times [2021-08-12 17:06:41,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:06:41,975 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694505689] [2021-08-12 17:06:41,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:06:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:06:42,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:06:42,038 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:06:42,038 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694505689] [2021-08-12 17:06:42,038 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694505689] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:06:42,038 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:06:42,038 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 17:06:42,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502601775] [2021-08-12 17:06:42,038 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 17:06:42,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:06:42,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 17:06:42,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-12 17:06:42,039 INFO L87 Difference]: Start difference. First operand 31800 states and 125296 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:06:43,767 INFO L93 Difference]: Finished difference Result 37794 states and 147976 transitions. [2021-08-12 17:06:43,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-12 17:06:43,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-08-12 17:06:43,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:06:44,002 INFO L225 Difference]: With dead ends: 37794 [2021-08-12 17:06:44,002 INFO L226 Difference]: Without dead ends: 20820 [2021-08-12 17:06:44,026 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 79.7ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-12 17:06:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20820 states. [2021-08-12 17:06:44,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20820 to 20460. [2021-08-12 17:06:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20460 states, 20459 states have (on average 3.8150447235935285) internal successors, (78052), 20459 states have internal predecessors, (78052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:44,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20460 states to 20460 states and 78052 transitions. [2021-08-12 17:06:45,089 INFO L78 Accepts]: Start accepts. Automaton has 20460 states and 78052 transitions. Word has length 92 [2021-08-12 17:06:45,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:06:45,090 INFO L482 AbstractCegarLoop]: Abstraction has 20460 states and 78052 transitions. [2021-08-12 17:06:45,090 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 20460 states and 78052 transitions. [2021-08-12 17:06:45,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-12 17:06:45,125 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:06:45,125 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:06:45,125 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-12 17:06:45,125 INFO L430 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:06:45,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:06:45,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1828217073, now seen corresponding path program 1 times [2021-08-12 17:06:45,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:06:45,125 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924263087] [2021-08-12 17:06:45,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:06:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:06:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:06:45,203 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:06:45,203 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924263087] [2021-08-12 17:06:45,203 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924263087] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:06:45,203 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:06:45,203 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-12 17:06:45,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129890055] [2021-08-12 17:06:45,204 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-12 17:06:45,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:06:45,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-12 17:06:45,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-12 17:06:45,205 INFO L87 Difference]: Start difference. First operand 20460 states and 78052 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:46,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:06:46,367 INFO L93 Difference]: Finished difference Result 21432 states and 81535 transitions. [2021-08-12 17:06:46,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-12 17:06:46,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-08-12 17:06:46,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:06:46,583 INFO L225 Difference]: With dead ends: 21432 [2021-08-12 17:06:46,584 INFO L226 Difference]: Without dead ends: 7563 [2021-08-12 17:06:46,602 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 101.4ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-08-12 17:06:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7563 states. [2021-08-12 17:06:46,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7563 to 7371. [2021-08-12 17:06:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7371 states, 7370 states have (on average 3.7048846675712346) internal successors, (27305), 7370 states have internal predecessors, (27305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7371 states to 7371 states and 27305 transitions. [2021-08-12 17:06:47,200 INFO L78 Accepts]: Start accepts. Automaton has 7371 states and 27305 transitions. Word has length 95 [2021-08-12 17:06:47,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:06:47,200 INFO L482 AbstractCegarLoop]: Abstraction has 7371 states and 27305 transitions. [2021-08-12 17:06:47,200 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:47,201 INFO L276 IsEmpty]: Start isEmpty. Operand 7371 states and 27305 transitions. [2021-08-12 17:06:47,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-12 17:06:47,217 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:06:47,217 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:06:47,217 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-12 17:06:47,217 INFO L430 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:06:47,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:06:47,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1037058479, now seen corresponding path program 1 times [2021-08-12 17:06:47,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:06:47,233 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713914465] [2021-08-12 17:06:47,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:06:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:06:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:06:47,438 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:06:47,438 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713914465] [2021-08-12 17:06:47,438 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713914465] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:06:47,438 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:06:47,439 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-12 17:06:47,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555365218] [2021-08-12 17:06:47,440 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-12 17:06:47,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:06:47,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-12 17:06:47,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-08-12 17:06:47,441 INFO L87 Difference]: Start difference. First operand 7371 states and 27305 transitions. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:48,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:06:48,227 INFO L93 Difference]: Finished difference Result 10683 states and 39791 transitions. [2021-08-12 17:06:48,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-12 17:06:48,228 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-08-12 17:06:48,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:06:48,402 INFO L225 Difference]: With dead ends: 10683 [2021-08-12 17:06:48,402 INFO L226 Difference]: Without dead ends: 3694 [2021-08-12 17:06:48,410 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 156.3ms TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-08-12 17:06:48,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2021-08-12 17:06:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3694. [2021-08-12 17:06:48,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3694 states, 3693 states have (on average 3.6672082317898727) internal successors, (13543), 3693 states have internal predecessors, (13543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 13543 transitions. [2021-08-12 17:06:48,689 INFO L78 Accepts]: Start accepts. Automaton has 3694 states and 13543 transitions. Word has length 99 [2021-08-12 17:06:48,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:06:48,689 INFO L482 AbstractCegarLoop]: Abstraction has 3694 states and 13543 transitions. [2021-08-12 17:06:48,689 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:06:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3694 states and 13543 transitions. [2021-08-12 17:06:48,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-12 17:06:48,695 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:06:48,695 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:06:48,695 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-12 17:06:48,695 INFO L430 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:06:48,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:06:48,696 INFO L82 PathProgramCache]: Analyzing trace with hash -534616835, now seen corresponding path program 2 times [2021-08-12 17:06:48,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:06:48,696 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004766619] [2021-08-12 17:06:48,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:06:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 17:06:48,774 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 17:06:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 17:06:48,815 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 17:06:48,890 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-12 17:06:48,890 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-12 17:06:48,891 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-12 17:06:48,893 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-12 17:06:49,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.08 05:06:49 BasicIcfg [2021-08-12 17:06:49,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-12 17:06:49,024 INFO L168 Benchmark]: Toolchain (without parser) took 127338.69 ms. Allocated memory was 185.6 MB in the beginning and 8.0 GB in the end (delta: 7.8 GB). Free memory was 148.3 MB in the beginning and 6.4 GB in the end (delta: -6.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 8.0 GB. [2021-08-12 17:06:49,024 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 185.6 MB. Free memory was 166.4 MB in the beginning and 166.4 MB in the end (delta: 78.4 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-12 17:06:49,024 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.73 ms. Allocated memory is still 185.6 MB. Free memory was 148.1 MB in the beginning and 144.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 9.2 MB. Max. memory is 8.0 GB. [2021-08-12 17:06:49,024 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.31 ms. Allocated memory is still 185.6 MB. Free memory was 144.1 MB in the beginning and 141.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-12 17:06:49,024 INFO L168 Benchmark]: Boogie Preprocessor took 26.89 ms. Allocated memory is still 185.6 MB. Free memory was 141.0 MB in the beginning and 138.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-12 17:06:49,024 INFO L168 Benchmark]: RCFGBuilder took 1370.13 ms. Allocated memory was 185.6 MB in the beginning and 264.2 MB in the end (delta: 78.6 MB). Free memory was 138.3 MB in the beginning and 174.0 MB in the end (delta: -35.7 MB). Peak memory consumption was 65.0 MB. Max. memory is 8.0 GB. [2021-08-12 17:06:49,025 INFO L168 Benchmark]: TraceAbstraction took 125429.47 ms. Allocated memory was 264.2 MB in the beginning and 8.0 GB in the end (delta: 7.7 GB). Free memory was 173.4 MB in the beginning and 6.4 GB in the end (delta: -6.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 8.0 GB. [2021-08-12 17:06:49,025 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 185.6 MB. Free memory was 166.4 MB in the beginning and 166.4 MB in the end (delta: 78.4 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 460.73 ms. Allocated memory is still 185.6 MB. Free memory was 148.1 MB in the beginning and 144.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 9.2 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 44.31 ms. Allocated memory is still 185.6 MB. Free memory was 144.1 MB in the beginning and 141.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 26.89 ms. Allocated memory is still 185.6 MB. Free memory was 141.0 MB in the beginning and 138.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1370.13 ms. Allocated memory was 185.6 MB in the beginning and 264.2 MB in the end (delta: 78.6 MB). Free memory was 138.3 MB in the beginning and 174.0 MB in the end (delta: -35.7 MB). Peak memory consumption was 65.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 125429.47 ms. Allocated memory was 264.2 MB in the beginning and 8.0 GB in the end (delta: 7.7 GB). Free memory was 173.4 MB in the beginning and 6.4 GB in the end (delta: -6.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L718] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L728] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L729] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L730] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L731] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L732] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L733] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L738] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L739] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L740] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L741] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L742] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L743] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L744] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] 0 pthread_t t1269; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1270; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1271; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1272; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1272, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 164 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 125226.3ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 2210.7ms, AutomataDifference: 47591.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 32024.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3260 SDtfs, 5101 SDslu, 12670 SDs, 0 SdLazy, 1241 SolverSat, 274 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1068.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 2806.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=128228occurred in iteration=0, InterpolantAutomatonStates: 195, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 36680.9ms AutomataMinimizationTime, 18 MinimizatonAttempts, 38344 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 68.7ms SsaConstructionTime, 643.8ms SatisfiabilityAnalysisTime, 2498.9ms InterpolantComputationTime, 1674 NumberOfCodeBlocks, 1674 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1557 ConstructedInterpolants, 0 QuantifiedInterpolants, 7665 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...