/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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-bc289cb [2022-01-28 12:15:18,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-28 12:15:18,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-28 12:15:18,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-28 12:15:18,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-28 12:15:18,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-28 12:15:18,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-28 12:15:18,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-28 12:15:18,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-28 12:15:18,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-28 12:15:18,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-28 12:15:18,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-28 12:15:18,278 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-28 12:15:18,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-28 12:15:18,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-28 12:15:18,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-28 12:15:18,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-28 12:15:18,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-28 12:15:18,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-28 12:15:18,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-28 12:15:18,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-28 12:15:18,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-28 12:15:18,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-28 12:15:18,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-28 12:15:18,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-28 12:15:18,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-28 12:15:18,336 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-28 12:15:18,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-28 12:15:18,337 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-28 12:15:18,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-28 12:15:18,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-28 12:15:18,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-28 12:15:18,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-28 12:15:18,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-28 12:15:18,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-28 12:15:18,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-28 12:15:18,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-28 12:15:18,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-28 12:15:18,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-28 12:15:18,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-28 12:15:18,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-28 12:15:18,360 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 [2022-01-28 12:15:18,397 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-28 12:15:18,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-28 12:15:18,397 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-28 12:15:18,397 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-28 12:15:18,398 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-28 12:15:18,398 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-28 12:15:18,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-28 12:15:18,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-28 12:15:18,399 INFO L138 SettingsManager]: * Use SBE=true [2022-01-28 12:15:18,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-28 12:15:18,400 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-28 12:15:18,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-28 12:15:18,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-28 12:15:18,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-28 12:15:18,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-28 12:15:18,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-28 12:15:18,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-28 12:15:18,401 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-28 12:15:18,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-28 12:15:18,401 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-28 12:15:18,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-28 12:15:18,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-28 12:15:18,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-28 12:15:18,401 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-28 12:15:18,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-28 12:15:18,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 12:15:18,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-28 12:15:18,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-28 12:15:18,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-28 12:15:18,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-28 12:15:18,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-28 12:15:18,402 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-28 12:15:18,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-28 12:15:18,402 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 [2022-01-28 12:15:18,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-28 12:15:18,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-28 12:15:18,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-28 12:15:18,671 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-28 12:15:18,672 INFO L275 PluginConnector]: CDTParser initialized [2022-01-28 12:15:18,672 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-01-28 12:15:18,723 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945668ed9/3ebd5e158d954b98be41afdae0df4deb/FLAGfade4ca7b [2022-01-28 12:15:19,127 INFO L306 CDTParser]: Found 1 translation units. [2022-01-28 12:15:19,127 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-01-28 12:15:19,139 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945668ed9/3ebd5e158d954b98be41afdae0df4deb/FLAGfade4ca7b [2022-01-28 12:15:19,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945668ed9/3ebd5e158d954b98be41afdae0df4deb [2022-01-28 12:15:19,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-28 12:15:19,150 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-28 12:15:19,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-28 12:15:19,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-28 12:15:19,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-28 12:15:19,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:15:19" (1/1) ... [2022-01-28 12:15:19,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13b77f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:15:19, skipping insertion in model container [2022-01-28 12:15:19,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:15:19" (1/1) ... [2022-01-28 12:15:19,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-28 12:15:19,215 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-28 12:15:19,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-01-28 12:15:19,492 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 12:15:19,498 INFO L203 MainTranslator]: Completed pre-run [2022-01-28 12:15:19,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-01-28 12:15:19,580 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 12:15:19,633 INFO L208 MainTranslator]: Completed translation [2022-01-28 12:15:19,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:15:19 WrapperNode [2022-01-28 12:15:19,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-28 12:15:19,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-28 12:15:19,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-28 12:15:19,635 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-28 12:15:19,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:15:19" (1/1) ... [2022-01-28 12:15:19,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:15:19" (1/1) ... [2022-01-28 12:15:19,751 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2022-01-28 12:15:19,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-28 12:15:19,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-28 12:15:19,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-28 12:15:19,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-28 12:15:19,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:15:19" (1/1) ... [2022-01-28 12:15:19,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:15:19" (1/1) ... [2022-01-28 12:15:19,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:15:19" (1/1) ... [2022-01-28 12:15:19,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:15:19" (1/1) ... [2022-01-28 12:15:19,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:15:19" (1/1) ... [2022-01-28 12:15:19,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:15:19" (1/1) ... [2022-01-28 12:15:19,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:15:19" (1/1) ... [2022-01-28 12:15:19,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-28 12:15:19,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-28 12:15:19,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-28 12:15:19,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-28 12:15:19,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:15:19" (1/1) ... [2022-01-28 12:15:19,846 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 12:15:19,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 12:15:19,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-28 12:15:19,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-28 12:15:19,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-28 12:15:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-28 12:15:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-28 12:15:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-28 12:15:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-28 12:15:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-28 12:15:19,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-28 12:15:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-28 12:15:19,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-28 12:15:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-28 12:15:19,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-28 12:15:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-28 12:15:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-28 12:15:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-28 12:15:19,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-28 12:15:19,934 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-28 12:15:20,081 INFO L234 CfgBuilder]: Building ICFG [2022-01-28 12:15:20,082 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-28 12:15:20,435 INFO L275 CfgBuilder]: Performing block encoding [2022-01-28 12:15:20,640 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-28 12:15:20,641 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-28 12:15:20,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:15:20 BoogieIcfgContainer [2022-01-28 12:15:20,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-28 12:15:20,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-28 12:15:20,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-28 12:15:20,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-28 12:15:20,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:15:19" (1/3) ... [2022-01-28 12:15:20,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431df276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:15:20, skipping insertion in model container [2022-01-28 12:15:20,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:15:19" (2/3) ... [2022-01-28 12:15:20,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431df276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:15:20, skipping insertion in model container [2022-01-28 12:15:20,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:15:20" (3/3) ... [2022-01-28 12:15:20,650 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-01-28 12:15:20,655 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-28 12:15:20,655 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-28 12:15:20,656 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-28 12:15:20,656 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-28 12:15:20,693 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,693 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,693 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,694 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,694 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,694 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,694 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,694 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,694 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,695 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,696 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,696 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,696 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,696 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,698 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,700 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,700 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,700 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,700 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,700 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,700 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,700 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,700 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,703 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,703 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,703 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,703 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,703 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,703 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,703 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,703 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,703 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,703 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,704 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,704 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,704 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,705 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,705 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,707 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,707 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,707 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,708 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,708 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,708 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,708 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,708 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,709 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,709 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,710 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,710 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,710 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,710 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,710 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,711 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,711 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,713 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,716 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,716 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,717 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,717 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,717 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,718 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,718 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,719 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:15:20,719 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-28 12:15:20,766 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-28 12:15:20,783 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-28 12:15:20,784 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-28 12:15:20,796 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 121 places, 113 transitions, 241 flow [2022-01-28 12:15:21,269 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 12243 states, 12240 states have (on average 3.551470588235294) internal successors, (43470), 12242 states have internal predecessors, (43470), 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) [2022-01-28 12:15:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 12243 states, 12240 states have (on average 3.551470588235294) internal successors, (43470), 12242 states have internal predecessors, (43470), 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) [2022-01-28 12:15:21,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-28 12:15:21,329 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:15:21,330 INFO L514 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] [2022-01-28 12:15:21,330 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 12:15:21,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:15:21,336 INFO L85 PathProgramCache]: Analyzing trace with hash -146856561, now seen corresponding path program 1 times [2022-01-28 12:15:21,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:15:21,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863376556] [2022-01-28 12:15:21,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:15:21,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:15:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:15:21,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:15:21,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:15:21,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863376556] [2022-01-28 12:15:21,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863376556] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:15:21,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:15:21,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-28 12:15:21,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344538647] [2022-01-28 12:15:21,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:15:21,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-28 12:15:21,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:15:21,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-28 12:15:21,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-28 12:15:21,742 INFO L87 Difference]: Start difference. First operand has 12243 states, 12240 states have (on average 3.551470588235294) internal successors, (43470), 12242 states have internal predecessors, (43470), 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 29.0) internal successors, (58), 3 states have internal predecessors, (58), 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) [2022-01-28 12:15:21,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:15:21,968 INFO L93 Difference]: Finished difference Result 10339 states and 35804 transitions. [2022-01-28 12:15:21,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-28 12:15:21,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2022-01-28 12:15:21,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:15:22,091 INFO L225 Difference]: With dead ends: 10339 [2022-01-28 12:15:22,092 INFO L226 Difference]: Without dead ends: 8547 [2022-01-28 12:15:22,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-28 12:15:22,097 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 40 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-28 12:15:22,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 157 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-28 12:15:22,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8547 states. [2022-01-28 12:15:22,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8547 to 8547. [2022-01-28 12:15:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8547 states, 8546 states have (on average 3.492160074888837) internal successors, (29844), 8546 states have internal predecessors, (29844), 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) [2022-01-28 12:15:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8547 states to 8547 states and 29844 transitions. [2022-01-28 12:15:22,555 INFO L78 Accepts]: Start accepts. Automaton has 8547 states and 29844 transitions. Word has length 58 [2022-01-28 12:15:22,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:15:22,557 INFO L470 AbstractCegarLoop]: Abstraction has 8547 states and 29844 transitions. [2022-01-28 12:15:22,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 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) [2022-01-28 12:15:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 8547 states and 29844 transitions. [2022-01-28 12:15:22,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-28 12:15:22,572 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:15:22,572 INFO L514 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] [2022-01-28 12:15:22,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-28 12:15:22,573 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 12:15:22,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:15:22,576 INFO L85 PathProgramCache]: Analyzing trace with hash -45666451, now seen corresponding path program 1 times [2022-01-28 12:15:22,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:15:22,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113850228] [2022-01-28 12:15:22,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:15:22,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:15:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:15:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:15:22,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:15:22,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113850228] [2022-01-28 12:15:22,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113850228] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:15:22,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:15:22,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-28 12:15:22,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260888213] [2022-01-28 12:15:22,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:15:22,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 12:15:22,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:15:22,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 12:15:22,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-28 12:15:22,747 INFO L87 Difference]: Start difference. First operand 8547 states and 29844 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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) [2022-01-28 12:15:23,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:15:23,012 INFO L93 Difference]: Finished difference Result 10451 states and 36222 transitions. [2022-01-28 12:15:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-28 12:15:23,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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 73 [2022-01-28 12:15:23,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:15:23,068 INFO L225 Difference]: With dead ends: 10451 [2022-01-28 12:15:23,068 INFO L226 Difference]: Without dead ends: 8211 [2022-01-28 12:15:23,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-28 12:15:23,073 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 119 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:15:23,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 533 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:15:23,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8211 states. [2022-01-28 12:15:23,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8211 to 8211. [2022-01-28 12:15:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8211 states, 8210 states have (on average 3.476492082825822) internal successors, (28542), 8210 states have internal predecessors, (28542), 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) [2022-01-28 12:15:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8211 states to 8211 states and 28542 transitions. [2022-01-28 12:15:23,359 INFO L78 Accepts]: Start accepts. Automaton has 8211 states and 28542 transitions. Word has length 73 [2022-01-28 12:15:23,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:15:23,360 INFO L470 AbstractCegarLoop]: Abstraction has 8211 states and 28542 transitions. [2022-01-28 12:15:23,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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) [2022-01-28 12:15:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand 8211 states and 28542 transitions. [2022-01-28 12:15:23,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-28 12:15:23,373 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:15:23,373 INFO L514 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] [2022-01-28 12:15:23,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-28 12:15:23,374 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 12:15:23,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:15:23,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1312186446, now seen corresponding path program 1 times [2022-01-28 12:15:23,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:15:23,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891623044] [2022-01-28 12:15:23,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:15:23,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:15:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:15:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:15:23,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:15:23,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891623044] [2022-01-28 12:15:23,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891623044] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:15:23,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:15:23,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-28 12:15:23,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999121860] [2022-01-28 12:15:23,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:15:23,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-28 12:15:23,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:15:23,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-28 12:15:23,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-28 12:15:23,760 INFO L87 Difference]: Start difference. First operand 8211 states and 28542 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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) [2022-01-28 12:15:24,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:15:24,080 INFO L93 Difference]: Finished difference Result 9791 states and 33756 transitions. [2022-01-28 12:15:24,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-28 12:15:24,081 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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 75 [2022-01-28 12:15:24,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:15:24,115 INFO L225 Difference]: With dead ends: 9791 [2022-01-28 12:15:24,115 INFO L226 Difference]: Without dead ends: 7791 [2022-01-28 12:15:24,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2022-01-28 12:15:24,116 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 343 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:15:24,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 695 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:15:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7791 states. [2022-01-28 12:15:24,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7791 to 7791. [2022-01-28 12:15:24,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7791 states, 7790 states have (on average 3.4590500641848525) internal successors, (26946), 7790 states have internal predecessors, (26946), 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) [2022-01-28 12:15:24,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7791 states to 7791 states and 26946 transitions. [2022-01-28 12:15:24,361 INFO L78 Accepts]: Start accepts. Automaton has 7791 states and 26946 transitions. Word has length 75 [2022-01-28 12:15:24,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:15:24,361 INFO L470 AbstractCegarLoop]: Abstraction has 7791 states and 26946 transitions. [2022-01-28 12:15:24,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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) [2022-01-28 12:15:24,362 INFO L276 IsEmpty]: Start isEmpty. Operand 7791 states and 26946 transitions. [2022-01-28 12:15:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-28 12:15:24,376 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:15:24,376 INFO L514 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] [2022-01-28 12:15:24,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-28 12:15:24,377 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 12:15:24,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:15:24,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1225042893, now seen corresponding path program 1 times [2022-01-28 12:15:24,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:15:24,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583450757] [2022-01-28 12:15:24,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:15:24,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:15:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:15:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:15:24,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:15:24,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583450757] [2022-01-28 12:15:24,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583450757] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:15:24,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:15:24,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-28 12:15:24,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702983343] [2022-01-28 12:15:24,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:15:24,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-28 12:15:24,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:15:24,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-28 12:15:24,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-28 12:15:24,520 INFO L87 Difference]: Start difference. First operand 7791 states and 26946 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2022-01-28 12:15:24,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:15:24,828 INFO L93 Difference]: Finished difference Result 9093 states and 31247 transitions. [2022-01-28 12:15:24,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-28 12:15:24,829 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 76 [2022-01-28 12:15:24,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:15:24,853 INFO L225 Difference]: With dead ends: 9093 [2022-01-28 12:15:24,853 INFO L226 Difference]: Without dead ends: 7693 [2022-01-28 12:15:24,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2022-01-28 12:15:24,855 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 248 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:15:24,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 684 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:15:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7693 states. [2022-01-28 12:15:25,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7693 to 7693. [2022-01-28 12:15:25,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7693 states, 7692 states have (on average 3.453978159126365) internal successors, (26568), 7692 states have internal predecessors, (26568), 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) [2022-01-28 12:15:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7693 states to 7693 states and 26568 transitions. [2022-01-28 12:15:25,148 INFO L78 Accepts]: Start accepts. Automaton has 7693 states and 26568 transitions. Word has length 76 [2022-01-28 12:15:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:15:25,150 INFO L470 AbstractCegarLoop]: Abstraction has 7693 states and 26568 transitions. [2022-01-28 12:15:25,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2022-01-28 12:15:25,150 INFO L276 IsEmpty]: Start isEmpty. Operand 7693 states and 26568 transitions. [2022-01-28 12:15:25,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-28 12:15:25,176 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:15:25,176 INFO L514 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] [2022-01-28 12:15:25,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-28 12:15:25,176 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 12:15:25,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:15:25,177 INFO L85 PathProgramCache]: Analyzing trace with hash 741350703, now seen corresponding path program 1 times [2022-01-28 12:15:25,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:15:25,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239793392] [2022-01-28 12:15:25,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:15:25,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:15:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:15:25,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:15:25,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:15:25,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239793392] [2022-01-28 12:15:25,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239793392] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:15:25,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:15:25,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-28 12:15:25,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68689575] [2022-01-28 12:15:25,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:15:25,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-28 12:15:25,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:15:25,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-28 12:15:25,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-01-28 12:15:25,460 INFO L87 Difference]: Start difference. First operand 7693 states and 26568 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 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) [2022-01-28 12:15:25,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:15:25,698 INFO L93 Difference]: Finished difference Result 8421 states and 28886 transitions. [2022-01-28 12:15:25,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-28 12:15:25,699 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 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 77 [2022-01-28 12:15:25,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:15:25,722 INFO L225 Difference]: With dead ends: 8421 [2022-01-28 12:15:25,722 INFO L226 Difference]: Without dead ends: 7301 [2022-01-28 12:15:25,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2022-01-28 12:15:25,723 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 292 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:15:25,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 772 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:15:25,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7301 states. [2022-01-28 12:15:25,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7301 to 7301. [2022-01-28 12:15:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7301 states, 7300 states have (on average 3.4457534246575343) internal successors, (25154), 7300 states have internal predecessors, (25154), 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) [2022-01-28 12:15:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7301 states to 7301 states and 25154 transitions. [2022-01-28 12:15:25,988 INFO L78 Accepts]: Start accepts. Automaton has 7301 states and 25154 transitions. Word has length 77 [2022-01-28 12:15:25,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:15:25,988 INFO L470 AbstractCegarLoop]: Abstraction has 7301 states and 25154 transitions. [2022-01-28 12:15:25,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 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) [2022-01-28 12:15:25,989 INFO L276 IsEmpty]: Start isEmpty. Operand 7301 states and 25154 transitions. [2022-01-28 12:15:26,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-28 12:15:26,000 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:15:26,000 INFO L514 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] [2022-01-28 12:15:26,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-28 12:15:26,001 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 12:15:26,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:15:26,001 INFO L85 PathProgramCache]: Analyzing trace with hash -833739637, now seen corresponding path program 1 times [2022-01-28 12:15:26,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:15:26,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136234348] [2022-01-28 12:15:26,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:15:26,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:15:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:15:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:15:26,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:15:26,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136234348] [2022-01-28 12:15:26,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136234348] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:15:26,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:15:26,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-28 12:15:26,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30429444] [2022-01-28 12:15:26,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:15:26,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-28 12:15:26,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:15:26,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-28 12:15:26,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-28 12:15:26,140 INFO L87 Difference]: Start difference. First operand 7301 states and 25154 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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) [2022-01-28 12:15:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:15:26,385 INFO L93 Difference]: Finished difference Result 8519 states and 29243 transitions. [2022-01-28 12:15:26,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-28 12:15:26,386 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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 78 [2022-01-28 12:15:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:15:26,410 INFO L225 Difference]: With dead ends: 8519 [2022-01-28 12:15:26,411 INFO L226 Difference]: Without dead ends: 7469 [2022-01-28 12:15:26,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-01-28 12:15:26,412 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 235 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:15:26,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 845 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:15:26,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7469 states. [2022-01-28 12:15:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7469 to 7469. [2022-01-28 12:15:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7469 states, 7468 states have (on average 3.451258703802892) internal successors, (25774), 7468 states have internal predecessors, (25774), 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) [2022-01-28 12:15:26,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7469 states to 7469 states and 25774 transitions. [2022-01-28 12:15:26,676 INFO L78 Accepts]: Start accepts. Automaton has 7469 states and 25774 transitions. Word has length 78 [2022-01-28 12:15:26,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:15:26,677 INFO L470 AbstractCegarLoop]: Abstraction has 7469 states and 25774 transitions. [2022-01-28 12:15:26,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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) [2022-01-28 12:15:26,677 INFO L276 IsEmpty]: Start isEmpty. Operand 7469 states and 25774 transitions. [2022-01-28 12:15:26,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-28 12:15:26,689 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:15:26,689 INFO L514 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] [2022-01-28 12:15:26,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-28 12:15:26,689 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 12:15:26,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:15:26,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1740554037, now seen corresponding path program 2 times [2022-01-28 12:15:26,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:15:26,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428455282] [2022-01-28 12:15:26,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:15:26,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:15:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:15:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:15:26,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:15:26,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428455282] [2022-01-28 12:15:26,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428455282] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:15:26,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:15:26,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-28 12:15:26,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413791816] [2022-01-28 12:15:26,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:15:26,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-28 12:15:26,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:15:26,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-28 12:15:26,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-28 12:15:26,832 INFO L87 Difference]: Start difference. First operand 7469 states and 25774 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 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) [2022-01-28 12:15:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:15:27,042 INFO L93 Difference]: Finished difference Result 9163 states and 31545 transitions. [2022-01-28 12:15:27,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-28 12:15:27,043 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 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 78 [2022-01-28 12:15:27,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:15:27,071 INFO L225 Difference]: With dead ends: 9163 [2022-01-28 12:15:27,072 INFO L226 Difference]: Without dead ends: 8113 [2022-01-28 12:15:27,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-01-28 12:15:27,073 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 239 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:15:27,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 906 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:15:27,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8113 states. [2022-01-28 12:15:27,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8113 to 7511. [2022-01-28 12:15:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7511 states, 7510 states have (on average 3.4460719041278294) internal successors, (25880), 7510 states have internal predecessors, (25880), 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) [2022-01-28 12:15:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7511 states to 7511 states and 25880 transitions. [2022-01-28 12:15:27,357 INFO L78 Accepts]: Start accepts. Automaton has 7511 states and 25880 transitions. Word has length 78 [2022-01-28 12:15:27,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:15:27,357 INFO L470 AbstractCegarLoop]: Abstraction has 7511 states and 25880 transitions. [2022-01-28 12:15:27,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 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) [2022-01-28 12:15:27,357 INFO L276 IsEmpty]: Start isEmpty. Operand 7511 states and 25880 transitions. [2022-01-28 12:15:27,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-28 12:15:27,368 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:15:27,368 INFO L514 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] [2022-01-28 12:15:27,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-28 12:15:27,369 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 12:15:27,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:15:27,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1227783607, now seen corresponding path program 3 times [2022-01-28 12:15:27,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:15:27,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242022247] [2022-01-28 12:15:27,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:15:27,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:15:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:15:27,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:15:27,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:15:27,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242022247] [2022-01-28 12:15:27,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242022247] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:15:27,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:15:27,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-28 12:15:27,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40754943] [2022-01-28 12:15:27,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:15:27,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-28 12:15:27,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:15:27,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-28 12:15:27,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-28 12:15:27,477 INFO L87 Difference]: Start difference. First operand 7511 states and 25880 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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) [2022-01-28 12:15:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:15:27,736 INFO L93 Difference]: Finished difference Result 9107 states and 31238 transitions. [2022-01-28 12:15:27,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-28 12:15:27,736 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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 78 [2022-01-28 12:15:27,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:15:27,756 INFO L225 Difference]: With dead ends: 9107 [2022-01-28 12:15:27,756 INFO L226 Difference]: Without dead ends: 7917 [2022-01-28 12:15:27,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-01-28 12:15:27,757 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 193 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:15:27,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 1021 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:15:27,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7917 states. [2022-01-28 12:15:28,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7917 to 7567. [2022-01-28 12:15:28,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7567 states, 7566 states have (on average 3.437086968014803) internal successors, (26005), 7566 states have internal predecessors, (26005), 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) [2022-01-28 12:15:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7567 states to 7567 states and 26005 transitions. [2022-01-28 12:15:28,141 INFO L78 Accepts]: Start accepts. Automaton has 7567 states and 26005 transitions. Word has length 78 [2022-01-28 12:15:28,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:15:28,142 INFO L470 AbstractCegarLoop]: Abstraction has 7567 states and 26005 transitions. [2022-01-28 12:15:28,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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) [2022-01-28 12:15:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 7567 states and 26005 transitions. [2022-01-28 12:15:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-28 12:15:28,163 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:15:28,163 INFO L514 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] [2022-01-28 12:15:28,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-28 12:15:28,163 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 12:15:28,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:15:28,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1805466259, now seen corresponding path program 1 times [2022-01-28 12:15:28,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:15:28,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509096618] [2022-01-28 12:15:28,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:15:28,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:15:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:15:28,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:15:28,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:15:28,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509096618] [2022-01-28 12:15:28,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509096618] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:15:28,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:15:28,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-28 12:15:28,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658563817] [2022-01-28 12:15:28,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:15:28,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-28 12:15:28,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:15:28,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-28 12:15:28,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-28 12:15:28,357 INFO L87 Difference]: Start difference. First operand 7567 states and 26005 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 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) [2022-01-28 12:15:28,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:15:28,739 INFO L93 Difference]: Finished difference Result 9303 states and 31861 transitions. [2022-01-28 12:15:28,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-28 12:15:28,740 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 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 [2022-01-28 12:15:28,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:15:28,772 INFO L225 Difference]: With dead ends: 9303 [2022-01-28 12:15:28,773 INFO L226 Difference]: Without dead ends: 8463 [2022-01-28 12:15:28,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-01-28 12:15:28,774 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 215 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-28 12:15:28,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 1251 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-28 12:15:28,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8463 states. [2022-01-28 12:15:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8463 to 8127. [2022-01-28 12:15:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8127 states, 8126 states have (on average 3.4488063007629832) internal successors, (28025), 8126 states have internal predecessors, (28025), 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) [2022-01-28 12:15:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8127 states to 8127 states and 28025 transitions. [2022-01-28 12:15:29,370 INFO L78 Accepts]: Start accepts. Automaton has 8127 states and 28025 transitions. Word has length 79 [2022-01-28 12:15:29,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:15:29,370 INFO L470 AbstractCegarLoop]: Abstraction has 8127 states and 28025 transitions. [2022-01-28 12:15:29,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 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) [2022-01-28 12:15:29,371 INFO L276 IsEmpty]: Start isEmpty. Operand 8127 states and 28025 transitions. [2022-01-28 12:15:29,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-28 12:15:29,395 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:15:29,395 INFO L514 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] [2022-01-28 12:15:29,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-28 12:15:29,395 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 12:15:29,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:15:29,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1702629385, now seen corresponding path program 2 times [2022-01-28 12:15:29,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:15:29,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824149092] [2022-01-28 12:15:29,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:15:29,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:15:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:15:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:15:29,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:15:29,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824149092] [2022-01-28 12:15:29,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824149092] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:15:29,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:15:29,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-28 12:15:29,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690458660] [2022-01-28 12:15:29,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:15:29,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-28 12:15:29,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:15:29,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-28 12:15:29,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-01-28 12:15:29,696 INFO L87 Difference]: Start difference. First operand 8127 states and 28025 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 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) [2022-01-28 12:15:30,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:15:30,165 INFO L93 Difference]: Finished difference Result 9751 states and 33589 transitions. [2022-01-28 12:15:30,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-28 12:15:30,166 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 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 [2022-01-28 12:15:30,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:15:30,233 INFO L225 Difference]: With dead ends: 9751 [2022-01-28 12:15:30,233 INFO L226 Difference]: Without dead ends: 8911 [2022-01-28 12:15:30,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2022-01-28 12:15:30,234 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 288 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-28 12:15:30,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 1102 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-28 12:15:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8911 states. [2022-01-28 12:15:30,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8911 to 8295. [2022-01-28 12:15:30,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8295 states, 8294 states have (on average 3.45370147094285) internal successors, (28645), 8294 states have internal predecessors, (28645), 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) [2022-01-28 12:15:30,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8295 states to 8295 states and 28645 transitions. [2022-01-28 12:15:30,648 INFO L78 Accepts]: Start accepts. Automaton has 8295 states and 28645 transitions. Word has length 79 [2022-01-28 12:15:30,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:15:30,649 INFO L470 AbstractCegarLoop]: Abstraction has 8295 states and 28645 transitions. [2022-01-28 12:15:30,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 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) [2022-01-28 12:15:30,649 INFO L276 IsEmpty]: Start isEmpty. Operand 8295 states and 28645 transitions. [2022-01-28 12:15:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-28 12:15:30,671 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:15:30,671 INFO L514 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] [2022-01-28 12:15:30,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-28 12:15:30,671 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 12:15:30,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:15:30,672 INFO L85 PathProgramCache]: Analyzing trace with hash -189037385, now seen corresponding path program 3 times [2022-01-28 12:15:30,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:15:30,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465807186] [2022-01-28 12:15:30,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:15:30,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:15:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:15:30,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:15:30,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:15:30,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465807186] [2022-01-28 12:15:30,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465807186] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:15:30,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:15:30,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-28 12:15:30,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369638619] [2022-01-28 12:15:30,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:15:30,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-28 12:15:30,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:15:30,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-28 12:15:30,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-01-28 12:15:30,996 INFO L87 Difference]: Start difference. First operand 8295 states and 28645 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 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) [2022-01-28 12:15:31,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:15:31,624 INFO L93 Difference]: Finished difference Result 9821 states and 33775 transitions. [2022-01-28 12:15:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-28 12:15:31,625 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 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 [2022-01-28 12:15:31,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:15:31,662 INFO L225 Difference]: With dead ends: 9821 [2022-01-28 12:15:31,662 INFO L226 Difference]: Without dead ends: 8981 [2022-01-28 12:15:31,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-01-28 12:15:31,664 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 296 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-28 12:15:31,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 1082 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-28 12:15:31,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8981 states. [2022-01-28 12:15:31,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8981 to 8281. [2022-01-28 12:15:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8281 states, 8280 states have (on average 3.454710144927536) internal successors, (28605), 8280 states have internal predecessors, (28605), 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) [2022-01-28 12:15:32,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8281 states to 8281 states and 28605 transitions. [2022-01-28 12:15:32,123 INFO L78 Accepts]: Start accepts. Automaton has 8281 states and 28605 transitions. Word has length 79 [2022-01-28 12:15:32,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:15:32,124 INFO L470 AbstractCegarLoop]: Abstraction has 8281 states and 28605 transitions. [2022-01-28 12:15:32,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 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) [2022-01-28 12:15:32,124 INFO L276 IsEmpty]: Start isEmpty. Operand 8281 states and 28605 transitions. [2022-01-28 12:15:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-28 12:15:32,154 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:15:32,160 INFO L514 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] [2022-01-28 12:15:32,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-28 12:15:32,160 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 12:15:32,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:15:32,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2075049035, now seen corresponding path program 4 times [2022-01-28 12:15:32,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:15:32,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29907694] [2022-01-28 12:15:32,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:15:32,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:15:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:15:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:15:32,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:15:32,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29907694] [2022-01-28 12:15:32,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29907694] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:15:32,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:15:32,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-28 12:15:32,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186560408] [2022-01-28 12:15:32,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:15:32,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-28 12:15:32,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:15:32,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-28 12:15:32,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-28 12:15:32,524 INFO L87 Difference]: Start difference. First operand 8281 states and 28605 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 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) [2022-01-28 12:15:33,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:15:33,079 INFO L93 Difference]: Finished difference Result 11571 states and 39265 transitions. [2022-01-28 12:15:33,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-28 12:15:33,080 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 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 [2022-01-28 12:15:33,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:15:33,112 INFO L225 Difference]: With dead ends: 11571 [2022-01-28 12:15:33,113 INFO L226 Difference]: Without dead ends: 8603 [2022-01-28 12:15:33,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2022-01-28 12:15:33,113 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 459 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-28 12:15:33,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 941 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-28 12:15:33,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8603 states. [2022-01-28 12:15:33,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8603 to 6811. [2022-01-28 12:15:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6811 states, 6810 states have (on average 3.3853157121879587) internal successors, (23054), 6810 states have internal predecessors, (23054), 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) [2022-01-28 12:15:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6811 states to 6811 states and 23054 transitions. [2022-01-28 12:15:33,579 INFO L78 Accepts]: Start accepts. Automaton has 6811 states and 23054 transitions. Word has length 79 [2022-01-28 12:15:33,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:15:33,580 INFO L470 AbstractCegarLoop]: Abstraction has 6811 states and 23054 transitions. [2022-01-28 12:15:33,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 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) [2022-01-28 12:15:33,580 INFO L276 IsEmpty]: Start isEmpty. Operand 6811 states and 23054 transitions. [2022-01-28 12:15:33,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-28 12:15:33,595 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:15:33,596 INFO L514 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] [2022-01-28 12:15:33,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-28 12:15:33,596 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 12:15:33,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:15:33,597 INFO L85 PathProgramCache]: Analyzing trace with hash -965044175, now seen corresponding path program 1 times [2022-01-28 12:15:33,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:15:33,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170135519] [2022-01-28 12:15:33,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:15:33,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:15:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:15:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:15:33,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:15:33,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170135519] [2022-01-28 12:15:33,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170135519] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:15:33,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:15:33,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-28 12:15:33,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048214457] [2022-01-28 12:15:33,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:15:33,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 12:15:33,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:15:33,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 12:15:33,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-28 12:15:33,700 INFO L87 Difference]: Start difference. First operand 6811 states and 23054 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) [2022-01-28 12:15:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:15:33,942 INFO L93 Difference]: Finished difference Result 8153 states and 27086 transitions. [2022-01-28 12:15:33,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-28 12:15:33,943 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 [2022-01-28 12:15:33,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:15:33,965 INFO L225 Difference]: With dead ends: 8153 [2022-01-28 12:15:33,965 INFO L226 Difference]: Without dead ends: 5913 [2022-01-28 12:15:33,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-28 12:15:33,968 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 174 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:15:33,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 393 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:15:33,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5913 states. [2022-01-28 12:15:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5913 to 5913. [2022-01-28 12:15:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5913 states, 5912 states have (on average 3.297361299052774) internal successors, (19494), 5912 states have internal predecessors, (19494), 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) [2022-01-28 12:15:34,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5913 states to 5913 states and 19494 transitions. [2022-01-28 12:15:34,413 INFO L78 Accepts]: Start accepts. Automaton has 5913 states and 19494 transitions. Word has length 79 [2022-01-28 12:15:34,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:15:34,413 INFO L470 AbstractCegarLoop]: Abstraction has 5913 states and 19494 transitions. [2022-01-28 12:15:34,414 INFO L471 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) [2022-01-28 12:15:34,414 INFO L276 IsEmpty]: Start isEmpty. Operand 5913 states and 19494 transitions. [2022-01-28 12:15:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-28 12:15:34,427 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:15:34,427 INFO L514 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] [2022-01-28 12:15:34,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-28 12:15:34,427 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 12:15:34,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:15:34,428 INFO L85 PathProgramCache]: Analyzing trace with hash 363266318, now seen corresponding path program 1 times [2022-01-28 12:15:34,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:15:34,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235736140] [2022-01-28 12:15:34,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:15:34,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:15:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:15:34,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:15:34,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:15:34,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235736140] [2022-01-28 12:15:34,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235736140] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:15:34,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:15:34,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-28 12:15:34,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932444755] [2022-01-28 12:15:34,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:15:34,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-28 12:15:34,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:15:34,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-28 12:15:34,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-28 12:15:34,570 INFO L87 Difference]: Start difference. First operand 5913 states and 19494 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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) [2022-01-28 12:15:34,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:15:34,818 INFO L93 Difference]: Finished difference Result 5610 states and 17930 transitions. [2022-01-28 12:15:34,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-28 12:15:34,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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 80 [2022-01-28 12:15:34,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:15:34,864 INFO L225 Difference]: With dead ends: 5610 [2022-01-28 12:15:34,865 INFO L226 Difference]: Without dead ends: 3870 [2022-01-28 12:15:34,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-01-28 12:15:34,865 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 296 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:15:34,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 459 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:15:34,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3870 states. [2022-01-28 12:15:35,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3870 to 3870. [2022-01-28 12:15:35,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3870 states, 3869 states have (on average 3.1333677952959422) internal successors, (12123), 3869 states have internal predecessors, (12123), 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) [2022-01-28 12:15:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 12123 transitions. [2022-01-28 12:15:35,067 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 12123 transitions. Word has length 80 [2022-01-28 12:15:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:15:35,067 INFO L470 AbstractCegarLoop]: Abstraction has 3870 states and 12123 transitions. [2022-01-28 12:15:35,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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) [2022-01-28 12:15:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 12123 transitions. [2022-01-28 12:15:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-28 12:15:35,077 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:15:35,077 INFO L514 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] [2022-01-28 12:15:35,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-28 12:15:35,078 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 12:15:35,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:15:35,078 INFO L85 PathProgramCache]: Analyzing trace with hash -275983761, now seen corresponding path program 1 times [2022-01-28 12:15:35,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:15:35,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658471128] [2022-01-28 12:15:35,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:15:35,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:15:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:15:35,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:15:35,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:15:35,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658471128] [2022-01-28 12:15:35,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658471128] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:15:35,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:15:35,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-28 12:15:35,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730868836] [2022-01-28 12:15:35,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:15:35,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-28 12:15:35,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:15:35,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-28 12:15:35,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-28 12:15:35,254 INFO L87 Difference]: Start difference. First operand 3870 states and 12123 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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) [2022-01-28 12:15:35,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:15:35,467 INFO L93 Difference]: Finished difference Result 5829 states and 18289 transitions. [2022-01-28 12:15:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-28 12:15:35,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 82 [2022-01-28 12:15:35,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:15:35,479 INFO L225 Difference]: With dead ends: 5829 [2022-01-28 12:15:35,479 INFO L226 Difference]: Without dead ends: 2979 [2022-01-28 12:15:35,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-28 12:15:35,480 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 104 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:15:35,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 765 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:15:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2022-01-28 12:15:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2979. [2022-01-28 12:15:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2979 states, 2978 states have (on average 3.1071188717259908) internal successors, (9253), 2978 states have internal predecessors, (9253), 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) [2022-01-28 12:15:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2979 states to 2979 states and 9253 transitions. [2022-01-28 12:15:35,555 INFO L78 Accepts]: Start accepts. Automaton has 2979 states and 9253 transitions. Word has length 82 [2022-01-28 12:15:35,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:15:35,555 INFO L470 AbstractCegarLoop]: Abstraction has 2979 states and 9253 transitions. [2022-01-28 12:15:35,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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) [2022-01-28 12:15:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2979 states and 9253 transitions. [2022-01-28 12:15:35,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-28 12:15:35,561 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:15:35,561 INFO L514 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] [2022-01-28 12:15:35,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-28 12:15:35,562 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 12:15:35,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:15:35,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1668779219, now seen corresponding path program 2 times [2022-01-28 12:15:35,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:15:35,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442077851] [2022-01-28 12:15:35,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:15:35,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:15:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:15:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:15:35,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:15:35,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442077851] [2022-01-28 12:15:35,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442077851] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:15:35,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:15:35,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-28 12:15:35,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611712356] [2022-01-28 12:15:35,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:15:35,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 12:15:35,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:15:35,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 12:15:35,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-28 12:15:35,790 INFO L87 Difference]: Start difference. First operand 2979 states and 9253 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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) [2022-01-28 12:15:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:15:35,954 INFO L93 Difference]: Finished difference Result 4833 states and 14896 transitions. [2022-01-28 12:15:35,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-28 12:15:35,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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 82 [2022-01-28 12:15:35,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:15:35,964 INFO L225 Difference]: With dead ends: 4833 [2022-01-28 12:15:35,965 INFO L226 Difference]: Without dead ends: 3069 [2022-01-28 12:15:35,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-28 12:15:35,966 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 98 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:15:35,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 565 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:15:35,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2022-01-28 12:15:36,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2817. [2022-01-28 12:15:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2817 states, 2816 states have (on average 3.0365767045454546) internal successors, (8551), 2816 states have internal predecessors, (8551), 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) [2022-01-28 12:15:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 8551 transitions. [2022-01-28 12:15:36,033 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 8551 transitions. Word has length 82 [2022-01-28 12:15:36,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:15:36,033 INFO L470 AbstractCegarLoop]: Abstraction has 2817 states and 8551 transitions. [2022-01-28 12:15:36,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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) [2022-01-28 12:15:36,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 8551 transitions. [2022-01-28 12:15:36,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-28 12:15:36,040 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:15:36,040 INFO L514 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] [2022-01-28 12:15:36,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-28 12:15:36,040 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 12:15:36,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:15:36,041 INFO L85 PathProgramCache]: Analyzing trace with hash -768134066, now seen corresponding path program 1 times [2022-01-28 12:15:36,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:15:36,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401652483] [2022-01-28 12:15:36,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:15:36,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:15:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:15:36,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:15:36,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:15:36,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401652483] [2022-01-28 12:15:36,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401652483] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:15:36,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:15:36,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-28 12:15:36,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806719624] [2022-01-28 12:15:36,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:15:36,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-28 12:15:36,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:15:36,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-28 12:15:36,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-28 12:15:36,158 INFO L87 Difference]: Start difference. First operand 2817 states and 8551 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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) [2022-01-28 12:15:36,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:15:36,328 INFO L93 Difference]: Finished difference Result 2151 states and 6313 transitions. [2022-01-28 12:15:36,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-28 12:15:36,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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 [2022-01-28 12:15:36,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:15:36,331 INFO L225 Difference]: With dead ends: 2151 [2022-01-28 12:15:36,331 INFO L226 Difference]: Without dead ends: 879 [2022-01-28 12:15:36,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-01-28 12:15:36,332 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 327 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:15:36,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 408 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:15:36,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2022-01-28 12:15:36,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2022-01-28 12:15:36,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 2.8029612756264237) internal successors, (2461), 878 states have internal predecessors, (2461), 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) [2022-01-28 12:15:36,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 2461 transitions. [2022-01-28 12:15:36,347 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 2461 transitions. Word has length 83 [2022-01-28 12:15:36,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:15:36,348 INFO L470 AbstractCegarLoop]: Abstraction has 879 states and 2461 transitions. [2022-01-28 12:15:36,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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) [2022-01-28 12:15:36,348 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 2461 transitions. [2022-01-28 12:15:36,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-28 12:15:36,349 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:15:36,350 INFO L514 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] [2022-01-28 12:15:36,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-28 12:15:36,350 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 12:15:36,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:15:36,351 INFO L85 PathProgramCache]: Analyzing trace with hash 552845872, now seen corresponding path program 1 times [2022-01-28 12:15:36,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:15:36,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312049067] [2022-01-28 12:15:36,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:15:36,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:15:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-28 12:15:36,395 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-28 12:15:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-28 12:15:36,490 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-28 12:15:36,491 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-28 12:15:36,492 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-28 12:15:36,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-28 12:15:36,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-28 12:15:36,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-28 12:15:36,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-28 12:15:36,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-28 12:15:36,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-28 12:15:36,498 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:15:36,503 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-28 12:15:36,503 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-28 12:15:36,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:15:36 BasicIcfg [2022-01-28 12:15:36,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-28 12:15:36,617 INFO L158 Benchmark]: Toolchain (without parser) took 17466.23ms. Allocated memory was 180.4MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 127.7MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 718.2MB. Max. memory is 8.0GB. [2022-01-28 12:15:36,617 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-28 12:15:36,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.69ms. Allocated memory is still 180.4MB. Free memory was 127.5MB in the beginning and 144.4MB in the end (delta: -16.9MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. [2022-01-28 12:15:36,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.36ms. Allocated memory is still 180.4MB. Free memory was 144.4MB in the beginning and 141.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-28 12:15:36,617 INFO L158 Benchmark]: Boogie Preprocessor took 63.13ms. Allocated memory is still 180.4MB. Free memory was 141.3MB in the beginning and 139.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-28 12:15:36,617 INFO L158 Benchmark]: RCFGBuilder took 827.45ms. Allocated memory is still 180.4MB. Free memory was 139.2MB in the beginning and 76.8MB in the end (delta: 62.4MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. [2022-01-28 12:15:36,618 INFO L158 Benchmark]: TraceAbstraction took 15970.87ms. Allocated memory was 180.4MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 76.3MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 666.3MB. Max. memory is 8.0GB. [2022-01-28 12:15:36,619 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.09ms. Allocated memory is still 180.4MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 482.69ms. Allocated memory is still 180.4MB. Free memory was 127.5MB in the beginning and 144.4MB in the end (delta: -16.9MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 116.36ms. Allocated memory is still 180.4MB. Free memory was 144.4MB in the beginning and 141.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.13ms. Allocated memory is still 180.4MB. Free memory was 141.3MB in the beginning and 139.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 827.45ms. Allocated memory is still 180.4MB. Free memory was 139.2MB in the beginning and 76.8MB in the end (delta: 62.4MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. * TraceAbstraction took 15970.87ms. Allocated memory was 180.4MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 76.3MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 666.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t1492; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492, ((void *)0), P0, ((void *)0))=-2, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1493; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493, ((void *)0), P1, ((void *)0))=-1, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1494; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494, ((void *)0), P2, ((void *)0))=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 139 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 15.7s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.3s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3966 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3966 mSDsluCounter, 12579 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10659 mSDsCounter, 265 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1917 IncrementalHoareTripleChecker+Invalid, 2182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 265 mSolverCounterUnsat, 2418 mSDtfsCounter, 1917 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12243occurred 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.0s DumpTime, AutomataMinimizationStatistics: 5.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 4648 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1402 NumberOfCodeBlocks, 1402 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1298 ConstructedInterpolants, 0 QuantifiedInterpolants, 7803 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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! [2022-01-28 12:15:36,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...