/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 03:08:04,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 03:08:04,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 03:08:04,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 03:08:04,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 03:08:04,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 03:08:04,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 03:08:04,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 03:08:04,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 03:08:04,409 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 03:08:04,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 03:08:04,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 03:08:04,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 03:08:04,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 03:08:04,410 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 03:08:04,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 03:08:04,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 03:08:04,411 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 03:08:04,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 03:08:04,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 03:08:04,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 03:08:04,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 03:08:04,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 03:08:04,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 03:08:04,412 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 03:08:04,412 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 03:08:04,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 03:08:04,413 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 03:08:04,413 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 03:08:04,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 03:08:04,414 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 03:08:04,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 03:08:04,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 03:08:04,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 03:08:04,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 03:08:04,414 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 03:08:04,414 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 03:08:04,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 03:08:04,415 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 03:08:04,415 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 03:08:04,415 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 03:08:04,415 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 03:08:04,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 03:08:04,416 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-20 03:08:04,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 03:08:04,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 03:08:04,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 03:08:04,622 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 03:08:04,622 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 03:08:04,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2023-12-20 03:08:05,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 03:08:05,781 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 03:08:05,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2023-12-20 03:08:05,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efecb165a/c2642b27c3ad428f8ef0ebabf3892533/FLAG50f31f64c [2023-12-20 03:08:05,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efecb165a/c2642b27c3ad428f8ef0ebabf3892533 [2023-12-20 03:08:05,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 03:08:05,807 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 03:08:05,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 03:08:05,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 03:08:05,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 03:08:05,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 03:08:05" (1/1) ... [2023-12-20 03:08:05,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@387b9588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:08:05, skipping insertion in model container [2023-12-20 03:08:05,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 03:08:05" (1/1) ... [2023-12-20 03:08:05,870 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 03:08:06,019 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[5819,5832] [2023-12-20 03:08:06,031 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[8492,8505] [2023-12-20 03:08:06,041 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[11299,11312] [2023-12-20 03:08:06,050 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[13874,13887] [2023-12-20 03:08:06,060 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16880,16893] [2023-12-20 03:08:06,069 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[19470,19483] [2023-12-20 03:08:06,078 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[22230,22243] [2023-12-20 03:08:06,115 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 03:08:06,126 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 03:08:06,156 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[5819,5832] [2023-12-20 03:08:06,163 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[8492,8505] [2023-12-20 03:08:06,170 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[11299,11312] [2023-12-20 03:08:06,176 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[13874,13887] [2023-12-20 03:08:06,186 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16880,16893] [2023-12-20 03:08:06,196 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[19470,19483] [2023-12-20 03:08:06,203 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[22230,22243] [2023-12-20 03:08:06,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 03:08:06,233 INFO L206 MainTranslator]: Completed translation [2023-12-20 03:08:06,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:08:06 WrapperNode [2023-12-20 03:08:06,234 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 03:08:06,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 03:08:06,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 03:08:06,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 03:08:06,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:08:06" (1/1) ... [2023-12-20 03:08:06,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:08:06" (1/1) ... [2023-12-20 03:08:06,306 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1337 [2023-12-20 03:08:06,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 03:08:06,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 03:08:06,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 03:08:06,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 03:08:06,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:08:06" (1/1) ... [2023-12-20 03:08:06,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:08:06" (1/1) ... [2023-12-20 03:08:06,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:08:06" (1/1) ... [2023-12-20 03:08:06,337 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 03:08:06,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:08:06" (1/1) ... [2023-12-20 03:08:06,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:08:06" (1/1) ... [2023-12-20 03:08:06,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:08:06" (1/1) ... [2023-12-20 03:08:06,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:08:06" (1/1) ... [2023-12-20 03:08:06,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:08:06" (1/1) ... [2023-12-20 03:08:06,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:08:06" (1/1) ... [2023-12-20 03:08:06,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 03:08:06,408 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 03:08:06,409 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 03:08:06,409 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 03:08:06,409 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:08:06" (1/1) ... [2023-12-20 03:08:06,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 03:08:06,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:08:06,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-20 03:08:06,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-20 03:08:06,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 03:08:06,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 03:08:06,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 03:08:06,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 03:08:06,569 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 03:08:06,571 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 03:08:07,230 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 03:08:07,263 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 03:08:07,263 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-20 03:08:07,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 03:08:07 BoogieIcfgContainer [2023-12-20 03:08:07,263 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 03:08:07,265 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 03:08:07,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 03:08:07,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 03:08:07,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 03:08:05" (1/3) ... [2023-12-20 03:08:07,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716857c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 03:08:07, skipping insertion in model container [2023-12-20 03:08:07,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:08:06" (2/3) ... [2023-12-20 03:08:07,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716857c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 03:08:07, skipping insertion in model container [2023-12-20 03:08:07,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 03:08:07" (3/3) ... [2023-12-20 03:08:07,269 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2023-12-20 03:08:07,281 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 03:08:07,281 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-12-20 03:08:07,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 03:08:07,318 INFO L357 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@76e18bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 03:08:07,318 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-12-20 03:08:07,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 264 states, 256 states have (on average 1.8359375) internal successors, (470), 263 states have internal predecessors, (470), 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) [2023-12-20 03:08:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-20 03:08:07,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:07,329 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:07,329 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:07,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:07,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1557733902, now seen corresponding path program 1 times [2023-12-20 03:08:07,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:07,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960101502] [2023-12-20 03:08:07,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:07,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:07,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:07,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:07,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960101502] [2023-12-20 03:08:07,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960101502] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:07,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:07,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 03:08:07,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502146295] [2023-12-20 03:08:07,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:07,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 03:08:07,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:07,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 03:08:07,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 03:08:07,719 INFO L87 Difference]: Start difference. First operand has 264 states, 256 states have (on average 1.8359375) internal successors, (470), 263 states have internal predecessors, (470), 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 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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) [2023-12-20 03:08:07,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:07,955 INFO L93 Difference]: Finished difference Result 370 states and 637 transitions. [2023-12-20 03:08:07,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 03:08:07,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2023-12-20 03:08:07,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:07,964 INFO L225 Difference]: With dead ends: 370 [2023-12-20 03:08:07,965 INFO L226 Difference]: Without dead ends: 230 [2023-12-20 03:08:07,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-20 03:08:07,969 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 1109 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:07,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 273 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 03:08:07,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-12-20 03:08:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2023-12-20 03:08:07,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 229 states have internal predecessors, (287), 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) [2023-12-20 03:08:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 287 transitions. [2023-12-20 03:08:07,998 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 287 transitions. Word has length 46 [2023-12-20 03:08:07,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:07,999 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 287 transitions. [2023-12-20 03:08:07,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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) [2023-12-20 03:08:07,999 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 287 transitions. [2023-12-20 03:08:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-20 03:08:08,000 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:08,000 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:08,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 03:08:08,001 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:08,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:08,001 INFO L85 PathProgramCache]: Analyzing trace with hash 902036529, now seen corresponding path program 1 times [2023-12-20 03:08:08,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:08,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676843326] [2023-12-20 03:08:08,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:08,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:08,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:08,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676843326] [2023-12-20 03:08:08,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676843326] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:08,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:08,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 03:08:08,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57631556] [2023-12-20 03:08:08,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:08,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 03:08:08,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:08,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 03:08:08,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 03:08:08,153 INFO L87 Difference]: Start difference. First operand 230 states and 287 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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) [2023-12-20 03:08:08,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:08,257 INFO L93 Difference]: Finished difference Result 298 states and 375 transitions. [2023-12-20 03:08:08,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 03:08:08,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2023-12-20 03:08:08,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:08,260 INFO L225 Difference]: With dead ends: 298 [2023-12-20 03:08:08,261 INFO L226 Difference]: Without dead ends: 176 [2023-12-20 03:08:08,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-20 03:08:08,264 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 615 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:08,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 135 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 03:08:08,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-12-20 03:08:08,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2023-12-20 03:08:08,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 169 states have (on average 1.2899408284023668) internal successors, (218), 175 states have internal predecessors, (218), 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) [2023-12-20 03:08:08,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 218 transitions. [2023-12-20 03:08:08,281 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 218 transitions. Word has length 46 [2023-12-20 03:08:08,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:08,281 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 218 transitions. [2023-12-20 03:08:08,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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) [2023-12-20 03:08:08,282 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 218 transitions. [2023-12-20 03:08:08,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-20 03:08:08,282 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:08,283 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:08,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 03:08:08,283 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:08,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:08,283 INFO L85 PathProgramCache]: Analyzing trace with hash -996423807, now seen corresponding path program 1 times [2023-12-20 03:08:08,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:08,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690721554] [2023-12-20 03:08:08,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:08,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:08,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:08,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690721554] [2023-12-20 03:08:08,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690721554] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:08,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:08,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 03:08:08,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077765063] [2023-12-20 03:08:08,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:08,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 03:08:08,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:08,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 03:08:08,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 03:08:08,371 INFO L87 Difference]: Start difference. First operand 176 states and 218 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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) [2023-12-20 03:08:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:08,500 INFO L93 Difference]: Finished difference Result 338 states and 434 transitions. [2023-12-20 03:08:08,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 03:08:08,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2023-12-20 03:08:08,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:08,505 INFO L225 Difference]: With dead ends: 338 [2023-12-20 03:08:08,509 INFO L226 Difference]: Without dead ends: 238 [2023-12-20 03:08:08,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-20 03:08:08,512 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 768 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:08,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 188 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 03:08:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-12-20 03:08:08,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 214. [2023-12-20 03:08:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 207 states have (on average 1.3526570048309179) internal successors, (280), 213 states have internal predecessors, (280), 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) [2023-12-20 03:08:08,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 280 transitions. [2023-12-20 03:08:08,519 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 280 transitions. Word has length 46 [2023-12-20 03:08:08,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:08,519 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 280 transitions. [2023-12-20 03:08:08,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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) [2023-12-20 03:08:08,519 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 280 transitions. [2023-12-20 03:08:08,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-20 03:08:08,520 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:08,520 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:08,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 03:08:08,520 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:08,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:08,521 INFO L85 PathProgramCache]: Analyzing trace with hash 640925669, now seen corresponding path program 1 times [2023-12-20 03:08:08,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:08,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347526973] [2023-12-20 03:08:08,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:08,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:08,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:08,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:08,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347526973] [2023-12-20 03:08:08,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347526973] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:08,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:08,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 03:08:08,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265473816] [2023-12-20 03:08:08,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:08,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 03:08:08,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:08,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 03:08:08,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-20 03:08:08,728 INFO L87 Difference]: Start difference. First operand 214 states and 280 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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) [2023-12-20 03:08:09,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:09,075 INFO L93 Difference]: Finished difference Result 529 states and 733 transitions. [2023-12-20 03:08:09,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-20 03:08:09,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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 47 [2023-12-20 03:08:09,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:09,077 INFO L225 Difference]: With dead ends: 529 [2023-12-20 03:08:09,077 INFO L226 Difference]: Without dead ends: 524 [2023-12-20 03:08:09,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-12-20 03:08:09,082 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 549 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:09,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 731 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 03:08:09,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2023-12-20 03:08:09,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 214. [2023-12-20 03:08:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 207 states have (on average 1.3478260869565217) internal successors, (279), 213 states have internal predecessors, (279), 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) [2023-12-20 03:08:09,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 279 transitions. [2023-12-20 03:08:09,094 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 279 transitions. Word has length 47 [2023-12-20 03:08:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:09,095 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 279 transitions. [2023-12-20 03:08:09,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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) [2023-12-20 03:08:09,096 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 279 transitions. [2023-12-20 03:08:09,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-20 03:08:09,100 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:09,100 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:09,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 03:08:09,100 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:09,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:09,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1888903618, now seen corresponding path program 1 times [2023-12-20 03:08:09,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:09,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677552011] [2023-12-20 03:08:09,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:09,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:09,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:09,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677552011] [2023-12-20 03:08:09,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677552011] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:09,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:09,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 03:08:09,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394702345] [2023-12-20 03:08:09,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:09,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 03:08:09,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:09,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 03:08:09,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-20 03:08:09,330 INFO L87 Difference]: Start difference. First operand 214 states and 279 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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) [2023-12-20 03:08:09,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:09,691 INFO L93 Difference]: Finished difference Result 533 states and 736 transitions. [2023-12-20 03:08:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-20 03:08:09,692 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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 47 [2023-12-20 03:08:09,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:09,693 INFO L225 Difference]: With dead ends: 533 [2023-12-20 03:08:09,693 INFO L226 Difference]: Without dead ends: 432 [2023-12-20 03:08:09,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2023-12-20 03:08:09,694 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 745 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:09,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 817 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 03:08:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2023-12-20 03:08:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 214. [2023-12-20 03:08:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 207 states have (on average 1.3429951690821256) internal successors, (278), 213 states have internal predecessors, (278), 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) [2023-12-20 03:08:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 278 transitions. [2023-12-20 03:08:09,699 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 278 transitions. Word has length 47 [2023-12-20 03:08:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:09,699 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 278 transitions. [2023-12-20 03:08:09,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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) [2023-12-20 03:08:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 278 transitions. [2023-12-20 03:08:09,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-20 03:08:09,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:09,700 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:09,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 03:08:09,700 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:09,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:09,700 INFO L85 PathProgramCache]: Analyzing trace with hash -367947433, now seen corresponding path program 1 times [2023-12-20 03:08:09,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:09,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664013547] [2023-12-20 03:08:09,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:09,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:09,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:09,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664013547] [2023-12-20 03:08:09,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664013547] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:09,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:09,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 03:08:09,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657008581] [2023-12-20 03:08:09,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:09,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 03:08:09,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:09,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 03:08:09,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 03:08:09,830 INFO L87 Difference]: Start difference. First operand 214 states and 278 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 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) [2023-12-20 03:08:10,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:10,021 INFO L93 Difference]: Finished difference Result 458 states and 613 transitions. [2023-12-20 03:08:10,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-20 03:08:10,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 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 47 [2023-12-20 03:08:10,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:10,025 INFO L225 Difference]: With dead ends: 458 [2023-12-20 03:08:10,025 INFO L226 Difference]: Without dead ends: 334 [2023-12-20 03:08:10,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-20 03:08:10,026 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 758 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:10,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 423 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 03:08:10,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-12-20 03:08:10,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 214. [2023-12-20 03:08:10,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 207 states have (on average 1.3381642512077294) internal successors, (277), 213 states have internal predecessors, (277), 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) [2023-12-20 03:08:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 277 transitions. [2023-12-20 03:08:10,030 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 277 transitions. Word has length 47 [2023-12-20 03:08:10,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:10,030 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 277 transitions. [2023-12-20 03:08:10,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 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) [2023-12-20 03:08:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 277 transitions. [2023-12-20 03:08:10,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-20 03:08:10,031 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:10,031 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:10,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 03:08:10,031 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:10,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:10,032 INFO L85 PathProgramCache]: Analyzing trace with hash 233049586, now seen corresponding path program 1 times [2023-12-20 03:08:10,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:10,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496328287] [2023-12-20 03:08:10,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:10,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:10,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:10,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496328287] [2023-12-20 03:08:10,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496328287] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:10,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:10,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-20 03:08:10,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610308503] [2023-12-20 03:08:10,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:10,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-20 03:08:10,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:10,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-20 03:08:10,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-20 03:08:10,413 INFO L87 Difference]: Start difference. First operand 214 states and 277 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 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) [2023-12-20 03:08:10,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:10,760 INFO L93 Difference]: Finished difference Result 457 states and 634 transitions. [2023-12-20 03:08:10,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-20 03:08:10,760 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 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 49 [2023-12-20 03:08:10,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:10,761 INFO L225 Difference]: With dead ends: 457 [2023-12-20 03:08:10,762 INFO L226 Difference]: Without dead ends: 441 [2023-12-20 03:08:10,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2023-12-20 03:08:10,762 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 1027 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:10,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 1416 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 03:08:10,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2023-12-20 03:08:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 198. [2023-12-20 03:08:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 193 states have (on average 1.3367875647668395) internal successors, (258), 197 states have internal predecessors, (258), 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) [2023-12-20 03:08:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 258 transitions. [2023-12-20 03:08:10,766 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 258 transitions. Word has length 49 [2023-12-20 03:08:10,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:10,766 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 258 transitions. [2023-12-20 03:08:10,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 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) [2023-12-20 03:08:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 258 transitions. [2023-12-20 03:08:10,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-20 03:08:10,767 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:10,767 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:10,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 03:08:10,767 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:10,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:10,768 INFO L85 PathProgramCache]: Analyzing trace with hash 80464025, now seen corresponding path program 1 times [2023-12-20 03:08:10,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:10,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558795695] [2023-12-20 03:08:10,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:10,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:11,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:11,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:11,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558795695] [2023-12-20 03:08:11,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558795695] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:11,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:11,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-20 03:08:11,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661988821] [2023-12-20 03:08:11,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:11,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-20 03:08:11,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:11,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-20 03:08:11,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-20 03:08:11,093 INFO L87 Difference]: Start difference. First operand 198 states and 258 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 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) [2023-12-20 03:08:11,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:11,456 INFO L93 Difference]: Finished difference Result 554 states and 789 transitions. [2023-12-20 03:08:11,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 03:08:11,456 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 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 49 [2023-12-20 03:08:11,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:11,458 INFO L225 Difference]: With dead ends: 554 [2023-12-20 03:08:11,458 INFO L226 Difference]: Without dead ends: 437 [2023-12-20 03:08:11,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2023-12-20 03:08:11,459 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 739 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:11,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 1051 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 03:08:11,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2023-12-20 03:08:11,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 165. [2023-12-20 03:08:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 163 states have (on average 1.343558282208589) internal successors, (219), 164 states have internal predecessors, (219), 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) [2023-12-20 03:08:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 219 transitions. [2023-12-20 03:08:11,462 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 219 transitions. Word has length 49 [2023-12-20 03:08:11,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:11,463 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 219 transitions. [2023-12-20 03:08:11,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 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) [2023-12-20 03:08:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 219 transitions. [2023-12-20 03:08:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-20 03:08:11,463 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:11,463 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:11,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 03:08:11,463 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:11,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:11,464 INFO L85 PathProgramCache]: Analyzing trace with hash 56983254, now seen corresponding path program 1 times [2023-12-20 03:08:11,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:11,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400215142] [2023-12-20 03:08:11,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:11,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:11,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:11,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400215142] [2023-12-20 03:08:11,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400215142] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:11,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:11,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-20 03:08:11,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80474757] [2023-12-20 03:08:11,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:11,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-20 03:08:11,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:11,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-20 03:08:11,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-20 03:08:11,698 INFO L87 Difference]: Start difference. First operand 165 states and 219 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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) [2023-12-20 03:08:11,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:11,939 INFO L93 Difference]: Finished difference Result 316 states and 433 transitions. [2023-12-20 03:08:11,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-20 03:08:11,940 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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 50 [2023-12-20 03:08:11,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:11,941 INFO L225 Difference]: With dead ends: 316 [2023-12-20 03:08:11,941 INFO L226 Difference]: Without dead ends: 202 [2023-12-20 03:08:11,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2023-12-20 03:08:11,942 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 445 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:11,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 429 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 03:08:11,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-12-20 03:08:11,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 165. [2023-12-20 03:08:11,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 163 states have (on average 1.3312883435582823) internal successors, (217), 164 states have internal predecessors, (217), 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) [2023-12-20 03:08:11,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 217 transitions. [2023-12-20 03:08:11,947 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 217 transitions. Word has length 50 [2023-12-20 03:08:11,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:11,947 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 217 transitions. [2023-12-20 03:08:11,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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) [2023-12-20 03:08:11,947 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 217 transitions. [2023-12-20 03:08:11,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-20 03:08:11,947 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:11,947 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:11,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-20 03:08:11,948 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:11,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:11,948 INFO L85 PathProgramCache]: Analyzing trace with hash -893080879, now seen corresponding path program 1 times [2023-12-20 03:08:11,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:11,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229032532] [2023-12-20 03:08:11,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:11,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:12,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:12,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:12,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229032532] [2023-12-20 03:08:12,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229032532] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:12,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:12,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-20 03:08:12,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255625483] [2023-12-20 03:08:12,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:12,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-20 03:08:12,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:12,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-20 03:08:12,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2023-12-20 03:08:12,452 INFO L87 Difference]: Start difference. First operand 165 states and 217 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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) [2023-12-20 03:08:13,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:13,219 INFO L93 Difference]: Finished difference Result 631 states and 905 transitions. [2023-12-20 03:08:13,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-20 03:08:13,220 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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 52 [2023-12-20 03:08:13,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:13,222 INFO L225 Difference]: With dead ends: 631 [2023-12-20 03:08:13,222 INFO L226 Difference]: Without dead ends: 625 [2023-12-20 03:08:13,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2023-12-20 03:08:13,223 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 782 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:13,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 1878 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 03:08:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2023-12-20 03:08:13,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 171. [2023-12-20 03:08:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 1.331360946745562) internal successors, (225), 170 states have internal predecessors, (225), 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) [2023-12-20 03:08:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 225 transitions. [2023-12-20 03:08:13,228 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 225 transitions. Word has length 52 [2023-12-20 03:08:13,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:13,229 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 225 transitions. [2023-12-20 03:08:13,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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) [2023-12-20 03:08:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 225 transitions. [2023-12-20 03:08:13,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-20 03:08:13,229 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:13,229 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:13,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-20 03:08:13,229 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:13,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:13,230 INFO L85 PathProgramCache]: Analyzing trace with hash -208243913, now seen corresponding path program 1 times [2023-12-20 03:08:13,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:13,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489389778] [2023-12-20 03:08:13,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:13,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:14,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:14,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:14,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489389778] [2023-12-20 03:08:14,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489389778] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:14,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:14,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-20 03:08:14,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686646780] [2023-12-20 03:08:14,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:14,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-20 03:08:14,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:14,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-20 03:08:14,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2023-12-20 03:08:14,046 INFO L87 Difference]: Start difference. First operand 171 states and 225 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 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) [2023-12-20 03:08:15,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:15,409 INFO L93 Difference]: Finished difference Result 630 states and 903 transitions. [2023-12-20 03:08:15,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-20 03:08:15,410 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 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 53 [2023-12-20 03:08:15,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:15,411 INFO L225 Difference]: With dead ends: 630 [2023-12-20 03:08:15,411 INFO L226 Difference]: Without dead ends: 624 [2023-12-20 03:08:15,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2023-12-20 03:08:15,412 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 631 mSDsluCounter, 2616 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 2822 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:15,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 2822 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-20 03:08:15,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2023-12-20 03:08:15,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 165. [2023-12-20 03:08:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 163 states have (on average 1.3251533742331287) internal successors, (216), 164 states have internal predecessors, (216), 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) [2023-12-20 03:08:15,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 216 transitions. [2023-12-20 03:08:15,416 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 216 transitions. Word has length 53 [2023-12-20 03:08:15,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:15,417 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 216 transitions. [2023-12-20 03:08:15,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 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) [2023-12-20 03:08:15,417 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 216 transitions. [2023-12-20 03:08:15,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-20 03:08:15,417 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:15,417 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:15,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-20 03:08:15,417 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:15,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:15,418 INFO L85 PathProgramCache]: Analyzing trace with hash 261826057, now seen corresponding path program 1 times [2023-12-20 03:08:15,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:15,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102945031] [2023-12-20 03:08:15,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:15,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:15,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:15,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:15,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102945031] [2023-12-20 03:08:15,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102945031] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:15,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:15,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-20 03:08:15,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780688755] [2023-12-20 03:08:15,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:15,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-20 03:08:15,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:15,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-20 03:08:15,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2023-12-20 03:08:15,864 INFO L87 Difference]: Start difference. First operand 165 states and 216 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 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) [2023-12-20 03:08:16,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:16,842 INFO L93 Difference]: Finished difference Result 1173 states and 1704 transitions. [2023-12-20 03:08:16,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-20 03:08:16,842 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 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 53 [2023-12-20 03:08:16,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:16,845 INFO L225 Difference]: With dead ends: 1173 [2023-12-20 03:08:16,845 INFO L226 Difference]: Without dead ends: 1167 [2023-12-20 03:08:16,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2023-12-20 03:08:16,847 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 1889 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1889 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:16,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1889 Valid, 3111 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 03:08:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2023-12-20 03:08:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 171. [2023-12-20 03:08:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 1.3254437869822486) internal successors, (224), 170 states have internal predecessors, (224), 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) [2023-12-20 03:08:16,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 224 transitions. [2023-12-20 03:08:16,854 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 224 transitions. Word has length 53 [2023-12-20 03:08:16,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:16,854 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 224 transitions. [2023-12-20 03:08:16,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 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) [2023-12-20 03:08:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 224 transitions. [2023-12-20 03:08:16,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-20 03:08:16,854 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:16,855 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:16,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-20 03:08:16,855 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:16,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:16,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1234132735, now seen corresponding path program 1 times [2023-12-20 03:08:16,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:16,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113051981] [2023-12-20 03:08:16,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:16,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:17,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:17,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113051981] [2023-12-20 03:08:17,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113051981] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:17,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:17,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-20 03:08:17,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184719758] [2023-12-20 03:08:17,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:17,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-20 03:08:17,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:17,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-20 03:08:17,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2023-12-20 03:08:17,333 INFO L87 Difference]: Start difference. First operand 171 states and 224 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 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) [2023-12-20 03:08:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:18,133 INFO L93 Difference]: Finished difference Result 361 states and 502 transitions. [2023-12-20 03:08:18,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-20 03:08:18,134 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 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 54 [2023-12-20 03:08:18,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:18,135 INFO L225 Difference]: With dead ends: 361 [2023-12-20 03:08:18,135 INFO L226 Difference]: Without dead ends: 355 [2023-12-20 03:08:18,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2023-12-20 03:08:18,136 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 260 mSDsluCounter, 2581 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 2823 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:18,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 2823 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 03:08:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-12-20 03:08:18,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 159. [2023-12-20 03:08:18,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.3291139240506329) internal successors, (210), 158 states have internal predecessors, (210), 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) [2023-12-20 03:08:18,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 210 transitions. [2023-12-20 03:08:18,139 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 210 transitions. Word has length 54 [2023-12-20 03:08:18,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:18,139 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 210 transitions. [2023-12-20 03:08:18,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 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) [2023-12-20 03:08:18,140 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 210 transitions. [2023-12-20 03:08:18,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-20 03:08:18,140 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:18,140 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:18,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-20 03:08:18,140 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:18,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:18,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1062013184, now seen corresponding path program 1 times [2023-12-20 03:08:18,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:18,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592987027] [2023-12-20 03:08:18,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:18,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:18,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:18,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592987027] [2023-12-20 03:08:18,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592987027] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:18,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:18,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 03:08:18,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850541604] [2023-12-20 03:08:18,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:18,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 03:08:18,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:18,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 03:08:18,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 03:08:18,191 INFO L87 Difference]: Start difference. First operand 159 states and 210 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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) [2023-12-20 03:08:18,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:18,238 INFO L93 Difference]: Finished difference Result 663 states and 978 transitions. [2023-12-20 03:08:18,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 03:08:18,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 70 [2023-12-20 03:08:18,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:18,239 INFO L225 Difference]: With dead ends: 663 [2023-12-20 03:08:18,239 INFO L226 Difference]: Without dead ends: 579 [2023-12-20 03:08:18,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-20 03:08:18,240 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 492 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:18,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 504 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:08:18,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2023-12-20 03:08:18,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 241. [2023-12-20 03:08:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.3875) internal successors, (333), 240 states have internal predecessors, (333), 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) [2023-12-20 03:08:18,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 333 transitions. [2023-12-20 03:08:18,246 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 333 transitions. Word has length 70 [2023-12-20 03:08:18,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:18,246 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 333 transitions. [2023-12-20 03:08:18,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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) [2023-12-20 03:08:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 333 transitions. [2023-12-20 03:08:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-20 03:08:18,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:18,247 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:18,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-20 03:08:18,248 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:18,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:18,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1740451689, now seen corresponding path program 1 times [2023-12-20 03:08:18,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:18,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217193750] [2023-12-20 03:08:18,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:18,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:18,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:18,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217193750] [2023-12-20 03:08:18,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217193750] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:18,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:18,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 03:08:18,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657850038] [2023-12-20 03:08:18,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:18,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 03:08:18,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:18,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 03:08:18,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 03:08:18,327 INFO L87 Difference]: Start difference. First operand 241 states and 333 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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) [2023-12-20 03:08:18,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:18,369 INFO L93 Difference]: Finished difference Result 823 states and 1210 transitions. [2023-12-20 03:08:18,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 03:08:18,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 72 [2023-12-20 03:08:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:18,371 INFO L225 Difference]: With dead ends: 823 [2023-12-20 03:08:18,371 INFO L226 Difference]: Without dead ends: 657 [2023-12-20 03:08:18,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-20 03:08:18,373 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 291 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:18,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 436 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:08:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2023-12-20 03:08:18,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 405. [2023-12-20 03:08:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.438118811881188) internal successors, (581), 404 states have internal predecessors, (581), 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) [2023-12-20 03:08:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 581 transitions. [2023-12-20 03:08:18,380 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 581 transitions. Word has length 72 [2023-12-20 03:08:18,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:18,380 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 581 transitions. [2023-12-20 03:08:18,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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) [2023-12-20 03:08:18,380 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 581 transitions. [2023-12-20 03:08:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-20 03:08:18,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:18,381 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:18,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-20 03:08:18,381 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:18,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:18,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1106785176, now seen corresponding path program 1 times [2023-12-20 03:08:18,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:18,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311044785] [2023-12-20 03:08:18,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:18,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:18,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:18,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311044785] [2023-12-20 03:08:18,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311044785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:18,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:18,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 03:08:18,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186472255] [2023-12-20 03:08:18,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:18,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 03:08:18,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:18,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 03:08:18,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 03:08:18,483 INFO L87 Difference]: Start difference. First operand 405 states and 581 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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) [2023-12-20 03:08:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:18,518 INFO L93 Difference]: Finished difference Result 737 states and 1081 transitions. [2023-12-20 03:08:18,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 03:08:18,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 72 [2023-12-20 03:08:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:18,520 INFO L225 Difference]: With dead ends: 737 [2023-12-20 03:08:18,520 INFO L226 Difference]: Without dead ends: 407 [2023-12-20 03:08:18,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-20 03:08:18,521 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 56 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:18,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 298 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:08:18,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-12-20 03:08:18,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2023-12-20 03:08:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.4282178217821782) internal successors, (577), 404 states have internal predecessors, (577), 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) [2023-12-20 03:08:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 577 transitions. [2023-12-20 03:08:18,528 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 577 transitions. Word has length 72 [2023-12-20 03:08:18,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:18,528 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 577 transitions. [2023-12-20 03:08:18,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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) [2023-12-20 03:08:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 577 transitions. [2023-12-20 03:08:18,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-20 03:08:18,529 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:18,529 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:18,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-20 03:08:18,529 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:18,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:18,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1040291664, now seen corresponding path program 1 times [2023-12-20 03:08:18,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:18,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156266257] [2023-12-20 03:08:18,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:18,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156266257] [2023-12-20 03:08:18,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156266257] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:18,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:18,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 03:08:18,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089231942] [2023-12-20 03:08:18,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:18,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 03:08:18,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:18,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 03:08:18,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:08:18,562 INFO L87 Difference]: Start difference. First operand 405 states and 577 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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) [2023-12-20 03:08:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:18,579 INFO L93 Difference]: Finished difference Result 1013 states and 1479 transitions. [2023-12-20 03:08:18,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 03:08:18,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 72 [2023-12-20 03:08:18,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:18,581 INFO L225 Difference]: With dead ends: 1013 [2023-12-20 03:08:18,581 INFO L226 Difference]: Without dead ends: 683 [2023-12-20 03:08:18,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:08:18,582 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 67 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:18,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 195 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:08:18,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2023-12-20 03:08:18,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 673. [2023-12-20 03:08:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 672 states have (on average 1.4211309523809523) internal successors, (955), 672 states have internal predecessors, (955), 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) [2023-12-20 03:08:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 955 transitions. [2023-12-20 03:08:18,593 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 955 transitions. Word has length 72 [2023-12-20 03:08:18,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:18,593 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 955 transitions. [2023-12-20 03:08:18,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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) [2023-12-20 03:08:18,594 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 955 transitions. [2023-12-20 03:08:18,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-20 03:08:18,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:18,594 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:18,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-20 03:08:18,594 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:18,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:18,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1125773673, now seen corresponding path program 1 times [2023-12-20 03:08:18,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:18,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305833770] [2023-12-20 03:08:18,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:18,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:18,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:18,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305833770] [2023-12-20 03:08:18,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305833770] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:18,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:18,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 03:08:18,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792815549] [2023-12-20 03:08:18,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:18,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 03:08:18,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:18,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 03:08:18,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 03:08:18,645 INFO L87 Difference]: Start difference. First operand 673 states and 955 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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) [2023-12-20 03:08:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:18,687 INFO L93 Difference]: Finished difference Result 1725 states and 2489 transitions. [2023-12-20 03:08:18,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 03:08:18,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 72 [2023-12-20 03:08:18,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:18,690 INFO L225 Difference]: With dead ends: 1725 [2023-12-20 03:08:18,690 INFO L226 Difference]: Without dead ends: 1425 [2023-12-20 03:08:18,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-20 03:08:18,691 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 292 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:18,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 442 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:08:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2023-12-20 03:08:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1121. [2023-12-20 03:08:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.4330357142857142) internal successors, (1605), 1120 states have internal predecessors, (1605), 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) [2023-12-20 03:08:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1605 transitions. [2023-12-20 03:08:18,705 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1605 transitions. Word has length 72 [2023-12-20 03:08:18,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:18,705 INFO L495 AbstractCegarLoop]: Abstraction has 1121 states and 1605 transitions. [2023-12-20 03:08:18,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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) [2023-12-20 03:08:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1605 transitions. [2023-12-20 03:08:18,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-20 03:08:18,706 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:18,706 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:18,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-20 03:08:18,706 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:18,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:18,708 INFO L85 PathProgramCache]: Analyzing trace with hash -265469296, now seen corresponding path program 1 times [2023-12-20 03:08:18,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:18,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765529436] [2023-12-20 03:08:18,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:18,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:18,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:18,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765529436] [2023-12-20 03:08:18,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765529436] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:18,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:18,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 03:08:18,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494556178] [2023-12-20 03:08:18,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:18,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 03:08:18,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:18,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 03:08:18,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:08:18,737 INFO L87 Difference]: Start difference. First operand 1121 states and 1605 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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) [2023-12-20 03:08:18,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:18,757 INFO L93 Difference]: Finished difference Result 2525 states and 3650 transitions. [2023-12-20 03:08:18,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 03:08:18,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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 [2023-12-20 03:08:18,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:18,760 INFO L225 Difference]: With dead ends: 2525 [2023-12-20 03:08:18,760 INFO L226 Difference]: Without dead ends: 1479 [2023-12-20 03:08:18,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:08:18,763 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 51 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:18,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 279 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:08:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2023-12-20 03:08:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1461. [2023-12-20 03:08:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1460 states have (on average 1.4246575342465753) internal successors, (2080), 1460 states have internal predecessors, (2080), 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) [2023-12-20 03:08:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2080 transitions. [2023-12-20 03:08:18,782 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2080 transitions. Word has length 73 [2023-12-20 03:08:18,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:18,782 INFO L495 AbstractCegarLoop]: Abstraction has 1461 states and 2080 transitions. [2023-12-20 03:08:18,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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) [2023-12-20 03:08:18,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2080 transitions. [2023-12-20 03:08:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-20 03:08:18,784 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:18,785 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:18,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-20 03:08:18,785 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:18,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:18,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1631774551, now seen corresponding path program 1 times [2023-12-20 03:08:18,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:18,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330271936] [2023-12-20 03:08:18,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:18,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:18,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:18,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330271936] [2023-12-20 03:08:18,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330271936] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:18,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:18,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 03:08:18,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632091200] [2023-12-20 03:08:18,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:18,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 03:08:18,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:18,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 03:08:18,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 03:08:18,840 INFO L87 Difference]: Start difference. First operand 1461 states and 2080 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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) [2023-12-20 03:08:18,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:18,882 INFO L93 Difference]: Finished difference Result 2675 states and 3838 transitions. [2023-12-20 03:08:18,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 03:08:18,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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 [2023-12-20 03:08:18,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:18,887 INFO L225 Difference]: With dead ends: 2675 [2023-12-20 03:08:18,887 INFO L226 Difference]: Without dead ends: 2265 [2023-12-20 03:08:18,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-20 03:08:18,888 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 289 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:18,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 463 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:08:18,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2023-12-20 03:08:18,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 1851. [2023-12-20 03:08:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1851 states, 1850 states have (on average 1.4281081081081082) internal successors, (2642), 1850 states have internal predecessors, (2642), 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) [2023-12-20 03:08:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2642 transitions. [2023-12-20 03:08:18,912 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2642 transitions. Word has length 73 [2023-12-20 03:08:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:18,913 INFO L495 AbstractCegarLoop]: Abstraction has 1851 states and 2642 transitions. [2023-12-20 03:08:18,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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) [2023-12-20 03:08:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2642 transitions. [2023-12-20 03:08:18,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-20 03:08:18,914 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:18,914 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:18,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-20 03:08:18,914 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:18,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:18,914 INFO L85 PathProgramCache]: Analyzing trace with hash -437607184, now seen corresponding path program 1 times [2023-12-20 03:08:18,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:18,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894728486] [2023-12-20 03:08:18,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:18,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:18,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:18,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:18,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894728486] [2023-12-20 03:08:18,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894728486] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:18,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:18,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 03:08:18,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097179706] [2023-12-20 03:08:18,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:18,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 03:08:18,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:18,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 03:08:18,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:08:18,963 INFO L87 Difference]: Start difference. First operand 1851 states and 2642 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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) [2023-12-20 03:08:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:18,981 INFO L93 Difference]: Finished difference Result 5187 states and 7384 transitions. [2023-12-20 03:08:18,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 03:08:18,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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 [2023-12-20 03:08:18,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:18,989 INFO L225 Difference]: With dead ends: 5187 [2023-12-20 03:08:18,989 INFO L226 Difference]: Without dead ends: 3411 [2023-12-20 03:08:18,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:08:18,992 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 55 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:18,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 256 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:08:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3411 states. [2023-12-20 03:08:19,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3411 to 3193. [2023-12-20 03:08:19,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 3192 states have (on average 1.4094611528822054) internal successors, (4499), 3192 states have internal predecessors, (4499), 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) [2023-12-20 03:08:19,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4499 transitions. [2023-12-20 03:08:19,032 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4499 transitions. Word has length 73 [2023-12-20 03:08:19,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:19,032 INFO L495 AbstractCegarLoop]: Abstraction has 3193 states and 4499 transitions. [2023-12-20 03:08:19,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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) [2023-12-20 03:08:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4499 transitions. [2023-12-20 03:08:19,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-20 03:08:19,033 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:19,033 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:19,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-20 03:08:19,033 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:19,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:19,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2125552703, now seen corresponding path program 1 times [2023-12-20 03:08:19,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:19,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852499294] [2023-12-20 03:08:19,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:19,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:19,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:19,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:19,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852499294] [2023-12-20 03:08:19,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852499294] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:19,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:19,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 03:08:19,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165586837] [2023-12-20 03:08:19,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:19,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 03:08:19,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:19,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 03:08:19,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:08:19,120 INFO L87 Difference]: Start difference. First operand 3193 states and 4499 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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) [2023-12-20 03:08:19,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:19,146 INFO L93 Difference]: Finished difference Result 8997 states and 12577 transitions. [2023-12-20 03:08:19,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 03:08:19,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2023-12-20 03:08:19,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:19,158 INFO L225 Difference]: With dead ends: 8997 [2023-12-20 03:08:19,158 INFO L226 Difference]: Without dead ends: 5879 [2023-12-20 03:08:19,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:08:19,163 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 45 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:19,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 255 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:08:19,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5879 states. [2023-12-20 03:08:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5879 to 5445. [2023-12-20 03:08:19,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5445 states, 5444 states have (on average 1.3796840558412933) internal successors, (7511), 5444 states have internal predecessors, (7511), 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) [2023-12-20 03:08:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5445 states to 5445 states and 7511 transitions. [2023-12-20 03:08:19,235 INFO L78 Accepts]: Start accepts. Automaton has 5445 states and 7511 transitions. Word has length 74 [2023-12-20 03:08:19,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:19,235 INFO L495 AbstractCegarLoop]: Abstraction has 5445 states and 7511 transitions. [2023-12-20 03:08:19,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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) [2023-12-20 03:08:19,235 INFO L276 IsEmpty]: Start isEmpty. Operand 5445 states and 7511 transitions. [2023-12-20 03:08:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-20 03:08:19,236 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:19,236 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:19,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-20 03:08:19,236 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:19,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:19,236 INFO L85 PathProgramCache]: Analyzing trace with hash -946215132, now seen corresponding path program 1 times [2023-12-20 03:08:19,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:19,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780893281] [2023-12-20 03:08:19,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:19,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:19,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:19,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780893281] [2023-12-20 03:08:19,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780893281] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:19,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:19,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 03:08:19,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949299748] [2023-12-20 03:08:19,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:19,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 03:08:19,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:19,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 03:08:19,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 03:08:19,337 INFO L87 Difference]: Start difference. First operand 5445 states and 7511 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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) [2023-12-20 03:08:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:19,392 INFO L93 Difference]: Finished difference Result 8559 states and 11713 transitions. [2023-12-20 03:08:19,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-20 03:08:19,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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 [2023-12-20 03:08:19,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:19,411 INFO L225 Difference]: With dead ends: 8559 [2023-12-20 03:08:19,411 INFO L226 Difference]: Without dead ends: 8557 [2023-12-20 03:08:19,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-20 03:08:19,414 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 206 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:19,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 659 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:08:19,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8557 states. [2023-12-20 03:08:19,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8557 to 5541. [2023-12-20 03:08:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5541 states, 5540 states have (on average 1.3658844765342961) internal successors, (7567), 5540 states have internal predecessors, (7567), 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) [2023-12-20 03:08:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5541 states to 5541 states and 7567 transitions. [2023-12-20 03:08:19,496 INFO L78 Accepts]: Start accepts. Automaton has 5541 states and 7567 transitions. Word has length 75 [2023-12-20 03:08:19,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:19,496 INFO L495 AbstractCegarLoop]: Abstraction has 5541 states and 7567 transitions. [2023-12-20 03:08:19,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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) [2023-12-20 03:08:19,496 INFO L276 IsEmpty]: Start isEmpty. Operand 5541 states and 7567 transitions. [2023-12-20 03:08:19,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-20 03:08:19,496 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:19,497 INFO L195 NwaCegarLoop]: 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] [2023-12-20 03:08:19,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-20 03:08:19,497 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:19,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:19,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1346024867, now seen corresponding path program 1 times [2023-12-20 03:08:19,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:19,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980828362] [2023-12-20 03:08:19,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:19,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:19,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:19,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980828362] [2023-12-20 03:08:19,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980828362] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:19,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:19,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 03:08:19,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771246917] [2023-12-20 03:08:19,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:19,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 03:08:19,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:19,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 03:08:19,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:08:19,547 INFO L87 Difference]: Start difference. First operand 5541 states and 7567 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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) [2023-12-20 03:08:19,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:19,579 INFO L93 Difference]: Finished difference Result 12849 states and 17505 transitions. [2023-12-20 03:08:19,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 03:08:19,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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 [2023-12-20 03:08:19,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:19,593 INFO L225 Difference]: With dead ends: 12849 [2023-12-20 03:08:19,594 INFO L226 Difference]: Without dead ends: 7383 [2023-12-20 03:08:19,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:08:19,600 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 59 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:19,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 257 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:08:19,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2023-12-20 03:08:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 6773. [2023-12-20 03:08:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6773 states, 6772 states have (on average 1.333579444772593) internal successors, (9031), 6772 states have internal predecessors, (9031), 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) [2023-12-20 03:08:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6773 states to 6773 states and 9031 transitions. [2023-12-20 03:08:19,696 INFO L78 Accepts]: Start accepts. Automaton has 6773 states and 9031 transitions. Word has length 76 [2023-12-20 03:08:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:19,696 INFO L495 AbstractCegarLoop]: Abstraction has 6773 states and 9031 transitions. [2023-12-20 03:08:19,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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) [2023-12-20 03:08:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 6773 states and 9031 transitions. [2023-12-20 03:08:19,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-20 03:08:19,698 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:19,699 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:08:19,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-20 03:08:19,699 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:19,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:19,699 INFO L85 PathProgramCache]: Analyzing trace with hash 138540374, now seen corresponding path program 1 times [2023-12-20 03:08:19,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:19,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232172384] [2023-12-20 03:08:19,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:19,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:19,958 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:19,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:19,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232172384] [2023-12-20 03:08:19,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232172384] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:08:19,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251645914] [2023-12-20 03:08:19,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:19,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:08:19,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:08:19,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:08:19,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 03:08:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:20,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-20 03:08:20,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:08:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:20,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:08:21,188 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:21,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251645914] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:08:21,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:08:21,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2023-12-20 03:08:21,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310941719] [2023-12-20 03:08:21,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:08:21,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-20 03:08:21,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:21,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-20 03:08:21,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2023-12-20 03:08:21,191 INFO L87 Difference]: Start difference. First operand 6773 states and 9031 transitions. Second operand has 27 states, 27 states have (on average 8.62962962962963) internal successors, (233), 26 states have internal predecessors, (233), 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) [2023-12-20 03:08:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:35,785 INFO L93 Difference]: Finished difference Result 108010 states and 139537 transitions. [2023-12-20 03:08:35,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 363 states. [2023-12-20 03:08:35,785 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.62962962962963) internal successors, (233), 26 states have internal predecessors, (233), 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 97 [2023-12-20 03:08:35,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:35,953 INFO L225 Difference]: With dead ends: 108010 [2023-12-20 03:08:35,953 INFO L226 Difference]: Without dead ends: 101312 [2023-12-20 03:08:36,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 384 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65004 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=15513, Invalid=133097, Unknown=0, NotChecked=0, Total=148610 [2023-12-20 03:08:36,004 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 6481 mSDsluCounter, 4338 mSDsCounter, 0 mSdLazyCounter, 4147 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6481 SdHoareTripleChecker+Valid, 4649 SdHoareTripleChecker+Invalid, 4195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 4147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:36,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6481 Valid, 4649 Invalid, 4195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 4147 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-20 03:08:36,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101312 states. [2023-12-20 03:08:36,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101312 to 25337. [2023-12-20 03:08:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25337 states, 25336 states have (on average 1.3184006946637197) internal successors, (33403), 25336 states have internal predecessors, (33403), 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) [2023-12-20 03:08:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25337 states to 25337 states and 33403 transitions. [2023-12-20 03:08:36,963 INFO L78 Accepts]: Start accepts. Automaton has 25337 states and 33403 transitions. Word has length 97 [2023-12-20 03:08:36,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:36,963 INFO L495 AbstractCegarLoop]: Abstraction has 25337 states and 33403 transitions. [2023-12-20 03:08:36,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.62962962962963) internal successors, (233), 26 states have internal predecessors, (233), 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) [2023-12-20 03:08:36,963 INFO L276 IsEmpty]: Start isEmpty. Operand 25337 states and 33403 transitions. [2023-12-20 03:08:36,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-20 03:08:36,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:36,966 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:08:36,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-20 03:08:37,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-20 03:08:37,174 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:37,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:37,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1032865704, now seen corresponding path program 1 times [2023-12-20 03:08:37,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:37,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433377000] [2023-12-20 03:08:37,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:37,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:37,223 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:37,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:37,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433377000] [2023-12-20 03:08:37,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433377000] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:08:37,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:08:37,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 03:08:37,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238914479] [2023-12-20 03:08:37,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:08:37,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 03:08:37,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:37,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 03:08:37,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:08:37,226 INFO L87 Difference]: Start difference. First operand 25337 states and 33403 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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) [2023-12-20 03:08:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:08:37,336 INFO L93 Difference]: Finished difference Result 49834 states and 65730 transitions. [2023-12-20 03:08:37,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 03:08:37,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 97 [2023-12-20 03:08:37,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:08:37,366 INFO L225 Difference]: With dead ends: 49834 [2023-12-20 03:08:37,366 INFO L226 Difference]: Without dead ends: 24579 [2023-12-20 03:08:37,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:08:37,388 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 55 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:08:37,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 237 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:08:37,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24579 states. [2023-12-20 03:08:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24579 to 24402. [2023-12-20 03:08:37,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24402 states, 24401 states have (on average 1.2925699766403016) internal successors, (31540), 24401 states have internal predecessors, (31540), 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) [2023-12-20 03:08:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24402 states to 24402 states and 31540 transitions. [2023-12-20 03:08:37,835 INFO L78 Accepts]: Start accepts. Automaton has 24402 states and 31540 transitions. Word has length 97 [2023-12-20 03:08:37,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:08:37,835 INFO L495 AbstractCegarLoop]: Abstraction has 24402 states and 31540 transitions. [2023-12-20 03:08:37,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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) [2023-12-20 03:08:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 24402 states and 31540 transitions. [2023-12-20 03:08:37,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-20 03:08:37,841 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:08:37,841 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:08:37,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-20 03:08:37,841 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:08:37,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:08:37,841 INFO L85 PathProgramCache]: Analyzing trace with hash -992643637, now seen corresponding path program 1 times [2023-12-20 03:08:37,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:08:37,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652408729] [2023-12-20 03:08:37,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:37,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:08:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:38,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:08:38,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652408729] [2023-12-20 03:08:38,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652408729] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:08:38,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586868781] [2023-12-20 03:08:38,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:08:38,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:08:38,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:08:38,280 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:08:38,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 03:08:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:08:38,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-20 03:08:38,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:08:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:38,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:08:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:08:39,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586868781] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:08:39,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:08:39,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 30 [2023-12-20 03:08:39,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907390135] [2023-12-20 03:08:39,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:08:39,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-20 03:08:39,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:08:39,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-20 03:08:39,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=792, Unknown=0, NotChecked=0, Total=870 [2023-12-20 03:08:39,294 INFO L87 Difference]: Start difference. First operand 24402 states and 31540 transitions. Second operand has 30 states, 30 states have (on average 8.933333333333334) internal successors, (268), 30 states have internal predecessors, (268), 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) [2023-12-20 03:09:32,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:09:32,100 INFO L93 Difference]: Finished difference Result 275362 states and 349920 transitions. [2023-12-20 03:09:32,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 847 states. [2023-12-20 03:09:32,100 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.933333333333334) internal successors, (268), 30 states have internal predecessors, (268), 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 98 [2023-12-20 03:09:32,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:09:32,451 INFO L225 Difference]: With dead ends: 275362 [2023-12-20 03:09:32,451 INFO L226 Difference]: Without dead ends: 251042 [2023-12-20 03:09:32,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1052 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 873 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372172 ImplicationChecksByTransitivity, 47.3s TimeCoverageRelationStatistics Valid=66538, Invalid=698212, Unknown=0, NotChecked=0, Total=764750 [2023-12-20 03:09:32,546 INFO L413 NwaCegarLoop]: 395 mSDtfsCounter, 24326 mSDsluCounter, 6216 mSDsCounter, 0 mSdLazyCounter, 6983 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24326 SdHoareTripleChecker+Valid, 6611 SdHoareTripleChecker+Invalid, 7269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 6983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:09:32,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24326 Valid, 6611 Invalid, 7269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 6983 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-12-20 03:09:32,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251042 states. [2023-12-20 03:09:34,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251042 to 57161. [2023-12-20 03:09:34,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57161 states, 57160 states have (on average 1.2910601819454164) internal successors, (73797), 57160 states have internal predecessors, (73797), 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) [2023-12-20 03:09:34,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57161 states to 57161 states and 73797 transitions. [2023-12-20 03:09:34,279 INFO L78 Accepts]: Start accepts. Automaton has 57161 states and 73797 transitions. Word has length 98 [2023-12-20 03:09:34,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:09:34,279 INFO L495 AbstractCegarLoop]: Abstraction has 57161 states and 73797 transitions. [2023-12-20 03:09:34,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.933333333333334) internal successors, (268), 30 states have internal predecessors, (268), 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) [2023-12-20 03:09:34,280 INFO L276 IsEmpty]: Start isEmpty. Operand 57161 states and 73797 transitions. [2023-12-20 03:09:34,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-20 03:09:34,285 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:09:34,285 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:09:34,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-20 03:09:34,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-20 03:09:34,491 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:09:34,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:09:34,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1274201800, now seen corresponding path program 1 times [2023-12-20 03:09:34,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:09:34,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865499709] [2023-12-20 03:09:34,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:09:34,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:09:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:09:34,526 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-20 03:09:34,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:09:34,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865499709] [2023-12-20 03:09:34,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865499709] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:09:34,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:09:34,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 03:09:34,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29185320] [2023-12-20 03:09:34,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:09:34,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 03:09:34,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:09:34,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 03:09:34,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:09:34,528 INFO L87 Difference]: Start difference. First operand 57161 states and 73797 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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) [2023-12-20 03:09:34,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:09:34,915 INFO L93 Difference]: Finished difference Result 93790 states and 121529 transitions. [2023-12-20 03:09:34,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 03:09:34,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2023-12-20 03:09:34,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:09:34,957 INFO L225 Difference]: With dead ends: 93790 [2023-12-20 03:09:34,958 INFO L226 Difference]: Without dead ends: 36744 [2023-12-20 03:09:34,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:09:34,993 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 83 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:09:34,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 100 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:09:35,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36744 states. [2023-12-20 03:09:35,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36744 to 36565. [2023-12-20 03:09:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36565 states, 36564 states have (on average 1.284706268460781) internal successors, (46974), 36564 states have internal predecessors, (46974), 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) [2023-12-20 03:09:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36565 states to 36565 states and 46974 transitions. [2023-12-20 03:09:35,409 INFO L78 Accepts]: Start accepts. Automaton has 36565 states and 46974 transitions. Word has length 99 [2023-12-20 03:09:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:09:35,409 INFO L495 AbstractCegarLoop]: Abstraction has 36565 states and 46974 transitions. [2023-12-20 03:09:35,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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) [2023-12-20 03:09:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 36565 states and 46974 transitions. [2023-12-20 03:09:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-20 03:09:35,412 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:09:35,413 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:09:35,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-20 03:09:35,413 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:09:35,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:09:35,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1945479071, now seen corresponding path program 1 times [2023-12-20 03:09:35,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:09:35,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075281394] [2023-12-20 03:09:35,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:09:35,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:09:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:09:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:09:35,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:09:35,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075281394] [2023-12-20 03:09:35,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075281394] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:09:35,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777765619] [2023-12-20 03:09:35,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:09:35,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:09:35,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:09:35,840 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:09:35,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-20 03:09:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:09:35,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-20 03:09:35,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:09:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-20 03:09:36,661 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 03:09:36,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777765619] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:09:36,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 03:09:36,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 27 [2023-12-20 03:09:36,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540359320] [2023-12-20 03:09:36,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:09:36,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-20 03:09:36,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:09:36,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-20 03:09:36,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2023-12-20 03:09:36,664 INFO L87 Difference]: Start difference. First operand 36565 states and 46974 transitions. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 12 states have internal predecessors, (93), 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) [2023-12-20 03:09:37,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:09:37,494 INFO L93 Difference]: Finished difference Result 113803 states and 146666 transitions. [2023-12-20 03:09:37,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-20 03:09:37,494 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 12 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2023-12-20 03:09:37,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:09:37,688 INFO L225 Difference]: With dead ends: 113803 [2023-12-20 03:09:37,688 INFO L226 Difference]: Without dead ends: 88600 [2023-12-20 03:09:37,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=1453, Unknown=0, NotChecked=0, Total=1640 [2023-12-20 03:09:37,704 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 472 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 03:09:37,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1322 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 03:09:37,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88600 states. [2023-12-20 03:09:38,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88600 to 36565. [2023-12-20 03:09:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36565 states, 36564 states have (on average 1.2846515698501257) internal successors, (46972), 36564 states have internal predecessors, (46972), 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) [2023-12-20 03:09:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36565 states to 36565 states and 46972 transitions. [2023-12-20 03:09:38,266 INFO L78 Accepts]: Start accepts. Automaton has 36565 states and 46972 transitions. Word has length 99 [2023-12-20 03:09:38,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:09:38,266 INFO L495 AbstractCegarLoop]: Abstraction has 36565 states and 46972 transitions. [2023-12-20 03:09:38,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 12 states have internal predecessors, (93), 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) [2023-12-20 03:09:38,266 INFO L276 IsEmpty]: Start isEmpty. Operand 36565 states and 46972 transitions. [2023-12-20 03:09:38,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-20 03:09:38,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:09:38,270 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:09:38,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-20 03:09:38,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-20 03:09:38,475 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:09:38,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:09:38,475 INFO L85 PathProgramCache]: Analyzing trace with hash 549891591, now seen corresponding path program 1 times [2023-12-20 03:09:38,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:09:38,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026472710] [2023-12-20 03:09:38,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:09:38,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:09:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:09:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-20 03:09:38,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:09:38,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026472710] [2023-12-20 03:09:38,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026472710] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:09:38,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:09:38,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 03:09:38,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984941186] [2023-12-20 03:09:38,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:09:38,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 03:09:38,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:09:38,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 03:09:38,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 03:09:38,515 INFO L87 Difference]: Start difference. First operand 36565 states and 46972 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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) [2023-12-20 03:09:38,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:09:38,689 INFO L93 Difference]: Finished difference Result 77702 states and 99720 transitions. [2023-12-20 03:09:38,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 03:09:38,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2023-12-20 03:09:38,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:09:38,752 INFO L225 Difference]: With dead ends: 77702 [2023-12-20 03:09:38,752 INFO L226 Difference]: Without dead ends: 52569 [2023-12-20 03:09:38,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 03:09:38,776 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 225 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:09:38,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 162 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:09:38,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52569 states. [2023-12-20 03:09:39,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52569 to 36319. [2023-12-20 03:09:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36319 states, 36318 states have (on average 1.279806156726692) internal successors, (46480), 36318 states have internal predecessors, (46480), 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) [2023-12-20 03:09:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36319 states to 36319 states and 46480 transitions. [2023-12-20 03:09:39,271 INFO L78 Accepts]: Start accepts. Automaton has 36319 states and 46480 transitions. Word has length 99 [2023-12-20 03:09:39,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:09:39,271 INFO L495 AbstractCegarLoop]: Abstraction has 36319 states and 46480 transitions. [2023-12-20 03:09:39,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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) [2023-12-20 03:09:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 36319 states and 46480 transitions. [2023-12-20 03:09:39,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-20 03:09:39,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:09:39,275 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:09:39,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-20 03:09:39,275 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:09:39,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:09:39,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1824994280, now seen corresponding path program 1 times [2023-12-20 03:09:39,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:09:39,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278563126] [2023-12-20 03:09:39,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:09:39,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:09:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:09:39,392 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-20 03:09:39,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:09:39,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278563126] [2023-12-20 03:09:39,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278563126] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:09:39,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:09:39,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 03:09:39,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931902029] [2023-12-20 03:09:39,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:09:39,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 03:09:39,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:09:39,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 03:09:39,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-20 03:09:39,393 INFO L87 Difference]: Start difference. First operand 36319 states and 46480 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 03:09:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:09:39,700 INFO L93 Difference]: Finished difference Result 61873 states and 79110 transitions. [2023-12-20 03:09:39,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-20 03:09:39,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2023-12-20 03:09:39,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:09:39,753 INFO L225 Difference]: With dead ends: 61873 [2023-12-20 03:09:39,753 INFO L226 Difference]: Without dead ends: 51611 [2023-12-20 03:09:39,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2023-12-20 03:09:39,770 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 434 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 03:09:39,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 377 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 03:09:39,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51611 states. [2023-12-20 03:09:40,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51611 to 36319. [2023-12-20 03:09:40,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36319 states, 36318 states have (on average 1.2797510876149567) internal successors, (46478), 36318 states have internal predecessors, (46478), 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) [2023-12-20 03:09:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36319 states to 36319 states and 46478 transitions. [2023-12-20 03:09:40,331 INFO L78 Accepts]: Start accepts. Automaton has 36319 states and 46478 transitions. Word has length 99 [2023-12-20 03:09:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:09:40,332 INFO L495 AbstractCegarLoop]: Abstraction has 36319 states and 46478 transitions. [2023-12-20 03:09:40,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 03:09:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 36319 states and 46478 transitions. [2023-12-20 03:09:40,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-20 03:09:40,335 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:09:40,335 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:09:40,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-20 03:09:40,335 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:09:40,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:09:40,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1438043984, now seen corresponding path program 1 times [2023-12-20 03:09:40,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:09:40,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561563641] [2023-12-20 03:09:40,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:09:40,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:09:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:09:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:09:40,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:09:40,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561563641] [2023-12-20 03:09:40,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561563641] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:09:40,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262301038] [2023-12-20 03:09:40,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:09:40,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:09:40,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:09:40,695 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:09:40,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-20 03:09:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:09:40,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-20 03:09:40,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:09:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:09:41,445 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:09:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:09:42,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262301038] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:09:42,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:09:42,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2023-12-20 03:09:42,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650108295] [2023-12-20 03:09:42,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:09:42,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-20 03:09:42,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:09:42,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-20 03:09:42,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2023-12-20 03:09:42,304 INFO L87 Difference]: Start difference. First operand 36319 states and 46478 transitions. Second operand has 29 states, 29 states have (on average 8.551724137931034) internal successors, (248), 28 states have internal predecessors, (248), 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) [2023-12-20 03:09:45,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:09:45,554 INFO L93 Difference]: Finished difference Result 129300 states and 164028 transitions. [2023-12-20 03:09:45,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-12-20 03:09:45,554 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.551724137931034) internal successors, (248), 28 states have internal predecessors, (248), 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 100 [2023-12-20 03:09:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:09:45,666 INFO L225 Difference]: With dead ends: 129300 [2023-12-20 03:09:45,667 INFO L226 Difference]: Without dead ends: 102444 [2023-12-20 03:09:45,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1454, Invalid=4708, Unknown=0, NotChecked=0, Total=6162 [2023-12-20 03:09:45,703 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 1846 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 2356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-20 03:09:45,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1846 Valid, 1830 Invalid, 2356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2332 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-20 03:09:45,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102444 states. [2023-12-20 03:09:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102444 to 50861. [2023-12-20 03:09:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50861 states, 50860 states have (on average 1.2806724341329139) internal successors, (65135), 50860 states have internal predecessors, (65135), 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) [2023-12-20 03:09:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50861 states to 50861 states and 65135 transitions. [2023-12-20 03:09:46,589 INFO L78 Accepts]: Start accepts. Automaton has 50861 states and 65135 transitions. Word has length 100 [2023-12-20 03:09:46,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:09:46,590 INFO L495 AbstractCegarLoop]: Abstraction has 50861 states and 65135 transitions. [2023-12-20 03:09:46,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.551724137931034) internal successors, (248), 28 states have internal predecessors, (248), 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) [2023-12-20 03:09:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 50861 states and 65135 transitions. [2023-12-20 03:09:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-20 03:09:46,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:09:46,594 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:09:46,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-20 03:09:46,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:09:46,796 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:09:46,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:09:46,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1349780561, now seen corresponding path program 1 times [2023-12-20 03:09:46,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:09:46,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163690321] [2023-12-20 03:09:46,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:09:46,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:09:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:09:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-20 03:09:46,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:09:46,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163690321] [2023-12-20 03:09:46,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163690321] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:09:46,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:09:46,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 03:09:46,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337398686] [2023-12-20 03:09:46,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:09:46,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 03:09:46,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:09:46,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 03:09:46,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:09:46,827 INFO L87 Difference]: Start difference. First operand 50861 states and 65135 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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) [2023-12-20 03:09:47,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:09:47,153 INFO L93 Difference]: Finished difference Result 98014 states and 125830 transitions. [2023-12-20 03:09:47,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 03:09:47,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 101 [2023-12-20 03:09:47,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:09:47,197 INFO L225 Difference]: With dead ends: 98014 [2023-12-20 03:09:47,198 INFO L226 Difference]: Without dead ends: 47481 [2023-12-20 03:09:47,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:09:47,212 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 85 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:09:47,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 132 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:09:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47481 states. [2023-12-20 03:09:47,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47481 to 47481. [2023-12-20 03:09:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47481 states, 47480 states have (on average 1.2724936815501264) internal successors, (60418), 47480 states have internal predecessors, (60418), 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) [2023-12-20 03:09:47,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47481 states to 47481 states and 60418 transitions. [2023-12-20 03:09:47,673 INFO L78 Accepts]: Start accepts. Automaton has 47481 states and 60418 transitions. Word has length 101 [2023-12-20 03:09:47,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:09:47,674 INFO L495 AbstractCegarLoop]: Abstraction has 47481 states and 60418 transitions. [2023-12-20 03:09:47,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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) [2023-12-20 03:09:47,674 INFO L276 IsEmpty]: Start isEmpty. Operand 47481 states and 60418 transitions. [2023-12-20 03:09:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-20 03:09:47,677 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:09:47,678 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:09:47,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-20 03:09:47,678 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:09:47,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:09:47,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1686972551, now seen corresponding path program 1 times [2023-12-20 03:09:47,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:09:47,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772045416] [2023-12-20 03:09:47,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:09:47,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:09:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:09:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-20 03:09:47,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:09:47,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772045416] [2023-12-20 03:09:47,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772045416] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:09:47,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:09:47,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 03:09:47,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598967572] [2023-12-20 03:09:47,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:09:47,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 03:09:47,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:09:47,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 03:09:47,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:09:47,707 INFO L87 Difference]: Start difference. First operand 47481 states and 60418 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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) [2023-12-20 03:09:47,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:09:47,941 INFO L93 Difference]: Finished difference Result 87298 states and 111185 transitions. [2023-12-20 03:09:47,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 03:09:47,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 101 [2023-12-20 03:09:47,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:09:47,980 INFO L225 Difference]: With dead ends: 87298 [2023-12-20 03:09:47,980 INFO L226 Difference]: Without dead ends: 40035 [2023-12-20 03:09:48,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:09:48,006 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 81 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 03:09:48,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 114 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 03:09:48,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40035 states. [2023-12-20 03:09:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40035 to 40035. [2023-12-20 03:09:48,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40035 states, 40034 states have (on average 1.2526352600289754) internal successors, (50148), 40034 states have internal predecessors, (50148), 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) [2023-12-20 03:09:48,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40035 states to 40035 states and 50148 transitions. [2023-12-20 03:09:48,464 INFO L78 Accepts]: Start accepts. Automaton has 40035 states and 50148 transitions. Word has length 101 [2023-12-20 03:09:48,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:09:48,464 INFO L495 AbstractCegarLoop]: Abstraction has 40035 states and 50148 transitions. [2023-12-20 03:09:48,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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) [2023-12-20 03:09:48,464 INFO L276 IsEmpty]: Start isEmpty. Operand 40035 states and 50148 transitions. [2023-12-20 03:09:48,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-20 03:09:48,468 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:09:48,468 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:09:48,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-20 03:09:48,468 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:09:48,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:09:48,468 INFO L85 PathProgramCache]: Analyzing trace with hash -34360452, now seen corresponding path program 1 times [2023-12-20 03:09:48,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:09:48,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414445921] [2023-12-20 03:09:48,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:09:48,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:09:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:09:48,958 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-20 03:09:48,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:09:48,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414445921] [2023-12-20 03:09:48,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414445921] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:09:48,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:09:48,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-20 03:09:48,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737726092] [2023-12-20 03:09:48,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:09:48,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-20 03:09:48,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:09:48,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-20 03:09:48,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-12-20 03:09:48,960 INFO L87 Difference]: Start difference. First operand 40035 states and 50148 transitions. Second operand has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 03:09:49,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:09:49,548 INFO L93 Difference]: Finished difference Result 85711 states and 107564 transitions. [2023-12-20 03:09:49,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-20 03:09:49,548 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2023-12-20 03:09:49,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:09:49,603 INFO L225 Difference]: With dead ends: 85711 [2023-12-20 03:09:49,603 INFO L226 Difference]: Without dead ends: 53584 [2023-12-20 03:09:49,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2023-12-20 03:09:49,627 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 343 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 03:09:49,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 927 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 03:09:49,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53584 states. [2023-12-20 03:09:49,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53584 to 36878. [2023-12-20 03:09:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36878 states, 36877 states have (on average 1.2536811562762697) internal successors, (46232), 36877 states have internal predecessors, (46232), 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) [2023-12-20 03:09:50,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36878 states to 36878 states and 46232 transitions. [2023-12-20 03:09:50,044 INFO L78 Accepts]: Start accepts. Automaton has 36878 states and 46232 transitions. Word has length 101 [2023-12-20 03:09:50,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:09:50,044 INFO L495 AbstractCegarLoop]: Abstraction has 36878 states and 46232 transitions. [2023-12-20 03:09:50,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 03:09:50,045 INFO L276 IsEmpty]: Start isEmpty. Operand 36878 states and 46232 transitions. [2023-12-20 03:09:50,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-20 03:09:50,047 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:09:50,047 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:09:50,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-20 03:09:50,048 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:09:50,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:09:50,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1326182326, now seen corresponding path program 1 times [2023-12-20 03:09:50,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:09:50,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790756419] [2023-12-20 03:09:50,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:09:50,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:09:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:09:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:09:50,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:09:50,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790756419] [2023-12-20 03:09:50,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790756419] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:09:50,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807964505] [2023-12-20 03:09:50,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:09:50,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:09:50,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:09:50,208 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:09:50,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-20 03:09:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:09:50,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-20 03:09:50,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:09:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:09:50,920 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:09:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:09:51,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807964505] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:09:51,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:09:51,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2023-12-20 03:09:51,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676181818] [2023-12-20 03:09:51,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:09:51,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-20 03:09:51,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:09:51,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-20 03:09:51,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2023-12-20 03:09:51,550 INFO L87 Difference]: Start difference. First operand 36878 states and 46232 transitions. Second operand has 29 states, 29 states have (on average 9.96551724137931) internal successors, (289), 28 states have internal predecessors, (289), 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) [2023-12-20 03:09:56,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:09:56,330 INFO L93 Difference]: Finished difference Result 173801 states and 213639 transitions. [2023-12-20 03:09:56,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-12-20 03:09:56,331 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.96551724137931) internal successors, (289), 28 states have internal predecessors, (289), 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 101 [2023-12-20 03:09:56,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:09:56,492 INFO L225 Difference]: With dead ends: 173801 [2023-12-20 03:09:56,492 INFO L226 Difference]: Without dead ends: 154783 [2023-12-20 03:09:56,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5429 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3358, Invalid=13154, Unknown=0, NotChecked=0, Total=16512 [2023-12-20 03:09:56,532 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 3923 mSDsluCounter, 3101 mSDsCounter, 0 mSdLazyCounter, 2773 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3923 SdHoareTripleChecker+Valid, 3302 SdHoareTripleChecker+Invalid, 2827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-20 03:09:56,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3923 Valid, 3302 Invalid, 2827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2773 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-20 03:09:56,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154783 states. [2023-12-20 03:09:57,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154783 to 39929. [2023-12-20 03:09:57,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39929 states, 39928 states have (on average 1.2531306351432578) internal successors, (50035), 39928 states have internal predecessors, (50035), 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) [2023-12-20 03:09:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39929 states to 39929 states and 50035 transitions. [2023-12-20 03:09:57,525 INFO L78 Accepts]: Start accepts. Automaton has 39929 states and 50035 transitions. Word has length 101 [2023-12-20 03:09:57,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:09:57,525 INFO L495 AbstractCegarLoop]: Abstraction has 39929 states and 50035 transitions. [2023-12-20 03:09:57,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.96551724137931) internal successors, (289), 28 states have internal predecessors, (289), 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) [2023-12-20 03:09:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 39929 states and 50035 transitions. [2023-12-20 03:09:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-20 03:09:57,527 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:09:57,527 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:09:57,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-20 03:09:57,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-12-20 03:09:57,731 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:09:57,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:09:57,731 INFO L85 PathProgramCache]: Analyzing trace with hash -94259064, now seen corresponding path program 1 times [2023-12-20 03:09:57,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:09:57,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699004329] [2023-12-20 03:09:57,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:09:57,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:09:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:09:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:09:58,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:09:58,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699004329] [2023-12-20 03:09:58,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699004329] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:09:58,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14989700] [2023-12-20 03:09:58,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:09:58,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:09:58,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:09:58,193 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:09:58,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-20 03:09:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:09:58,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-20 03:09:58,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:09:58,868 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:09:58,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:09:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:09:59,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14989700] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:09:59,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:09:59,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 10] total 37 [2023-12-20 03:09:59,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200707347] [2023-12-20 03:09:59,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:09:59,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-20 03:09:59,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:09:59,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-20 03:09:59,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1242, Unknown=0, NotChecked=0, Total=1332 [2023-12-20 03:09:59,318 INFO L87 Difference]: Start difference. First operand 39929 states and 50035 transitions. Second operand has 37 states, 37 states have (on average 7.4324324324324325) internal successors, (275), 37 states have internal predecessors, (275), 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) [2023-12-20 03:10:55,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:10:55,168 INFO L93 Difference]: Finished difference Result 294977 states and 360636 transitions. [2023-12-20 03:10:55,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 710 states. [2023-12-20 03:10:55,169 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 7.4324324324324325) internal successors, (275), 37 states have internal predecessors, (275), 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 101 [2023-12-20 03:10:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:10:55,480 INFO L225 Difference]: With dead ends: 294977 [2023-12-20 03:10:55,480 INFO L226 Difference]: Without dead ends: 268879 [2023-12-20 03:10:55,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 743 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258819 ImplicationChecksByTransitivity, 49.9s TimeCoverageRelationStatistics Valid=36194, Invalid=518086, Unknown=0, NotChecked=0, Total=554280 [2023-12-20 03:10:55,548 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 11100 mSDsluCounter, 8995 mSDsCounter, 0 mSdLazyCounter, 8971 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11100 SdHoareTripleChecker+Valid, 9364 SdHoareTripleChecker+Invalid, 9166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 8971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-20 03:10:55,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11100 Valid, 9364 Invalid, 9166 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [195 Valid, 8971 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-12-20 03:10:55,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268879 states. [2023-12-20 03:10:56,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268879 to 52416. [2023-12-20 03:10:56,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52416 states, 52415 states have (on average 1.2529810168844797) internal successors, (65675), 52415 states have internal predecessors, (65675), 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) [2023-12-20 03:10:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52416 states to 52416 states and 65675 transitions. [2023-12-20 03:10:56,908 INFO L78 Accepts]: Start accepts. Automaton has 52416 states and 65675 transitions. Word has length 101 [2023-12-20 03:10:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:10:56,909 INFO L495 AbstractCegarLoop]: Abstraction has 52416 states and 65675 transitions. [2023-12-20 03:10:56,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 7.4324324324324325) internal successors, (275), 37 states have internal predecessors, (275), 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) [2023-12-20 03:10:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 52416 states and 65675 transitions. [2023-12-20 03:10:56,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-20 03:10:56,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:10:56,911 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:10:56,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-20 03:10:57,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-12-20 03:10:57,112 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:10:57,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:10:57,113 INFO L85 PathProgramCache]: Analyzing trace with hash -687193556, now seen corresponding path program 1 times [2023-12-20 03:10:57,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:10:57,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433487689] [2023-12-20 03:10:57,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:10:57,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:10:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:10:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:10:57,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:10:57,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433487689] [2023-12-20 03:10:57,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433487689] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:10:57,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960231288] [2023-12-20 03:10:57,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:10:57,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:10:57,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:10:57,592 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:10:57,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-20 03:10:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:10:57,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-20 03:10:57,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:10:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:10:59,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:11:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:11:02,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960231288] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:11:02,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:11:02,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 21] total 55 [2023-12-20 03:11:02,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596596725] [2023-12-20 03:11:02,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:11:02,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-12-20 03:11:02,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:11:02,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-12-20 03:11:02,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2702, Unknown=0, NotChecked=0, Total=2970 [2023-12-20 03:11:02,487 INFO L87 Difference]: Start difference. First operand 52416 states and 65675 transitions. Second operand has 55 states, 55 states have (on average 5.254545454545455) internal successors, (289), 55 states have internal predecessors, (289), 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) [2023-12-20 03:11:20,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:11:20,036 INFO L93 Difference]: Finished difference Result 251338 states and 310670 transitions. [2023-12-20 03:11:20,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2023-12-20 03:11:20,036 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 5.254545454545455) internal successors, (289), 55 states have internal predecessors, (289), 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 102 [2023-12-20 03:11:20,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:11:20,291 INFO L225 Difference]: With dead ends: 251338 [2023-12-20 03:11:20,291 INFO L226 Difference]: Without dead ends: 230624 [2023-12-20 03:11:20,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12919 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=5400, Invalid=35606, Unknown=0, NotChecked=0, Total=41006 [2023-12-20 03:11:20,340 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 3908 mSDsluCounter, 9107 mSDsCounter, 0 mSdLazyCounter, 4525 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3908 SdHoareTripleChecker+Valid, 9407 SdHoareTripleChecker+Invalid, 4552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-20 03:11:20,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3908 Valid, 9407 Invalid, 4552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 4525 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-20 03:11:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230624 states. [2023-12-20 03:11:21,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230624 to 83996. [2023-12-20 03:11:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83996 states, 83995 states have (on average 1.2477052205488421) internal successors, (104801), 83995 states have internal predecessors, (104801), 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) [2023-12-20 03:11:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83996 states to 83996 states and 104801 transitions. [2023-12-20 03:11:22,132 INFO L78 Accepts]: Start accepts. Automaton has 83996 states and 104801 transitions. Word has length 102 [2023-12-20 03:11:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:11:22,132 INFO L495 AbstractCegarLoop]: Abstraction has 83996 states and 104801 transitions. [2023-12-20 03:11:22,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 5.254545454545455) internal successors, (289), 55 states have internal predecessors, (289), 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) [2023-12-20 03:11:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 83996 states and 104801 transitions. [2023-12-20 03:11:22,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-20 03:11:22,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:11:22,137 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:11:22,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-20 03:11:22,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:11:22,343 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:11:22,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:11:22,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1218649046, now seen corresponding path program 1 times [2023-12-20 03:11:22,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:11:22,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516993083] [2023-12-20 03:11:22,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:11:22,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:11:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:11:22,991 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:11:22,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:11:22,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516993083] [2023-12-20 03:11:22,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516993083] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:11:22,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172585618] [2023-12-20 03:11:22,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:11:22,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:11:22,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:11:23,000 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:11:23,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-20 03:11:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:11:23,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-20 03:11:23,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:11:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:11:23,569 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:11:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:11:24,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172585618] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:11:24,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:11:24,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 36 [2023-12-20 03:11:24,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393175783] [2023-12-20 03:11:24,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:11:24,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-20 03:11:24,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:11:24,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-20 03:11:24,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1156, Unknown=0, NotChecked=0, Total=1260 [2023-12-20 03:11:24,135 INFO L87 Difference]: Start difference. First operand 83996 states and 104801 transitions. Second operand has 36 states, 36 states have (on average 7.75) internal successors, (279), 36 states have internal predecessors, (279), 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) [2023-12-20 03:11:37,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:11:37,987 INFO L93 Difference]: Finished difference Result 271180 states and 333370 transitions. [2023-12-20 03:11:37,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2023-12-20 03:11:37,988 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 7.75) internal successors, (279), 36 states have internal predecessors, (279), 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 102 [2023-12-20 03:11:37,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:11:38,265 INFO L225 Difference]: With dead ends: 271180 [2023-12-20 03:11:38,266 INFO L226 Difference]: Without dead ends: 239098 [2023-12-20 03:11:38,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24196 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=8352, Invalid=57954, Unknown=0, NotChecked=0, Total=66306 [2023-12-20 03:11:38,317 INFO L413 NwaCegarLoop]: 936 mSDtfsCounter, 4305 mSDsluCounter, 20530 mSDsCounter, 0 mSdLazyCounter, 7671 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4305 SdHoareTripleChecker+Valid, 21466 SdHoareTripleChecker+Invalid, 7683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 7671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-20 03:11:38,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4305 Valid, 21466 Invalid, 7683 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [12 Valid, 7671 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-20 03:11:38,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239098 states. [2023-12-20 03:11:39,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239098 to 96751. [2023-12-20 03:11:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96751 states, 96750 states have (on average 1.2468733850129199) internal successors, (120635), 96750 states have internal predecessors, (120635), 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) [2023-12-20 03:11:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96751 states to 96751 states and 120635 transitions. [2023-12-20 03:11:40,001 INFO L78 Accepts]: Start accepts. Automaton has 96751 states and 120635 transitions. Word has length 102 [2023-12-20 03:11:40,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:11:40,001 INFO L495 AbstractCegarLoop]: Abstraction has 96751 states and 120635 transitions. [2023-12-20 03:11:40,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.75) internal successors, (279), 36 states have internal predecessors, (279), 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) [2023-12-20 03:11:40,001 INFO L276 IsEmpty]: Start isEmpty. Operand 96751 states and 120635 transitions. [2023-12-20 03:11:40,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-20 03:11:40,005 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:11:40,005 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:11:40,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-20 03:11:40,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-12-20 03:11:40,210 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:11:40,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:11:40,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2009788228, now seen corresponding path program 1 times [2023-12-20 03:11:40,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:11:40,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110881800] [2023-12-20 03:11:40,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:11:40,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:11:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:11:41,121 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:11:41,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:11:41,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110881800] [2023-12-20 03:11:41,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110881800] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:11:41,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166197373] [2023-12-20 03:11:41,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:11:41,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:11:41,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:11:41,122 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:11:41,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-20 03:11:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:11:41,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-20 03:11:41,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:11:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:11:42,431 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:11:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:11:43,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166197373] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:11:43,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:11:43,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 16] total 51 [2023-12-20 03:11:43,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452789435] [2023-12-20 03:11:43,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:11:43,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-20 03:11:43,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:11:43,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-20 03:11:43,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2387, Unknown=0, NotChecked=0, Total=2550 [2023-12-20 03:11:43,849 INFO L87 Difference]: Start difference. First operand 96751 states and 120635 transitions. Second operand has 51 states, 51 states have (on average 5.705882352941177) internal successors, (291), 51 states have internal predecessors, (291), 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) [2023-12-20 03:12:28,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:12:28,366 INFO L93 Difference]: Finished difference Result 241808 states and 299111 transitions. [2023-12-20 03:12:28,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2023-12-20 03:12:28,367 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 5.705882352941177) internal successors, (291), 51 states have internal predecessors, (291), 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 102 [2023-12-20 03:12:28,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:12:28,635 INFO L225 Difference]: With dead ends: 241808 [2023-12-20 03:12:28,635 INFO L226 Difference]: Without dead ends: 219984 [2023-12-20 03:12:28,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17547 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=5284, Invalid=47846, Unknown=0, NotChecked=0, Total=53130 [2023-12-20 03:12:28,687 INFO L413 NwaCegarLoop]: 631 mSDtfsCounter, 4252 mSDsluCounter, 20145 mSDsCounter, 0 mSdLazyCounter, 8321 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4252 SdHoareTripleChecker+Valid, 20776 SdHoareTripleChecker+Invalid, 8335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 8321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2023-12-20 03:12:28,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4252 Valid, 20776 Invalid, 8335 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 8321 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2023-12-20 03:12:28,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219984 states. [2023-12-20 03:12:30,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219984 to 94895. [2023-12-20 03:12:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94895 states, 94894 states have (on average 1.2464960903745232) internal successors, (118285), 94894 states have internal predecessors, (118285), 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) [2023-12-20 03:12:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94895 states to 94895 states and 118285 transitions. [2023-12-20 03:12:30,461 INFO L78 Accepts]: Start accepts. Automaton has 94895 states and 118285 transitions. Word has length 102 [2023-12-20 03:12:30,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:12:30,461 INFO L495 AbstractCegarLoop]: Abstraction has 94895 states and 118285 transitions. [2023-12-20 03:12:30,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 5.705882352941177) internal successors, (291), 51 states have internal predecessors, (291), 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) [2023-12-20 03:12:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 94895 states and 118285 transitions. [2023-12-20 03:12:30,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-20 03:12:30,464 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:12:30,465 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:12:30,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-20 03:12:30,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-12-20 03:12:30,665 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:12:30,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:12:30,666 INFO L85 PathProgramCache]: Analyzing trace with hash -418191768, now seen corresponding path program 1 times [2023-12-20 03:12:30,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:12:30,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85589539] [2023-12-20 03:12:30,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:12:30,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:12:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:12:30,912 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:12:30,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:12:30,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85589539] [2023-12-20 03:12:30,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85589539] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:12:30,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973486128] [2023-12-20 03:12:30,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:12:30,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:12:30,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:12:30,914 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:12:30,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-20 03:12:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:12:31,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-20 03:12:31,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:12:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:12:31,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:12:31,971 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:12:31,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973486128] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:12:31,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:12:31,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 24 [2023-12-20 03:12:31,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371818845] [2023-12-20 03:12:31,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:12:31,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-20 03:12:31,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:12:31,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-20 03:12:31,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2023-12-20 03:12:31,973 INFO L87 Difference]: Start difference. First operand 94895 states and 118285 transitions. Second operand has 24 states, 24 states have (on average 10.583333333333334) internal successors, (254), 24 states have internal predecessors, (254), 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) [2023-12-20 03:12:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:12:36,164 INFO L93 Difference]: Finished difference Result 233898 states and 290119 transitions. [2023-12-20 03:12:36,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-12-20 03:12:36,164 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.583333333333334) internal successors, (254), 24 states have internal predecessors, (254), 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 102 [2023-12-20 03:12:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:12:36,369 INFO L225 Difference]: With dead ends: 233898 [2023-12-20 03:12:36,369 INFO L226 Difference]: Without dead ends: 186679 [2023-12-20 03:12:36,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1817, Invalid=6739, Unknown=0, NotChecked=0, Total=8556 [2023-12-20 03:12:36,429 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 1961 mSDsluCounter, 2189 mSDsCounter, 0 mSdLazyCounter, 2287 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1961 SdHoareTripleChecker+Valid, 2382 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-20 03:12:36,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1961 Valid, 2382 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2287 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-20 03:12:36,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186679 states. [2023-12-20 03:12:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186679 to 95710. [2023-12-20 03:12:37,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95710 states, 95709 states have (on average 1.2460165710643722) internal successors, (119255), 95709 states have internal predecessors, (119255), 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) [2023-12-20 03:12:37,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95710 states to 95710 states and 119255 transitions. [2023-12-20 03:12:37,954 INFO L78 Accepts]: Start accepts. Automaton has 95710 states and 119255 transitions. Word has length 102 [2023-12-20 03:12:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:12:37,954 INFO L495 AbstractCegarLoop]: Abstraction has 95710 states and 119255 transitions. [2023-12-20 03:12:37,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.583333333333334) internal successors, (254), 24 states have internal predecessors, (254), 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) [2023-12-20 03:12:37,955 INFO L276 IsEmpty]: Start isEmpty. Operand 95710 states and 119255 transitions. [2023-12-20 03:12:37,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-20 03:12:37,957 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:12:37,957 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:12:37,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-20 03:12:38,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2023-12-20 03:12:38,158 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:12:38,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:12:38,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1225077236, now seen corresponding path program 1 times [2023-12-20 03:12:38,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:12:38,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770847932] [2023-12-20 03:12:38,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:12:38,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:12:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:12:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:12:38,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:12:38,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770847932] [2023-12-20 03:12:38,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770847932] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:12:38,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:12:38,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 03:12:38,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750641263] [2023-12-20 03:12:38,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:12:38,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 03:12:38,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:12:38,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 03:12:38,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:12:38,202 INFO L87 Difference]: Start difference. First operand 95710 states and 119255 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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) [2023-12-20 03:12:38,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:12:38,675 INFO L93 Difference]: Finished difference Result 131812 states and 163611 transitions. [2023-12-20 03:12:38,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 03:12:38,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 103 [2023-12-20 03:12:38,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:12:38,714 INFO L225 Difference]: With dead ends: 131812 [2023-12-20 03:12:38,715 INFO L226 Difference]: Without dead ends: 36480 [2023-12-20 03:12:38,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:12:38,739 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 53 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:12:38,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 200 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:12:38,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36480 states. [2023-12-20 03:12:38,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36480 to 36389. [2023-12-20 03:12:38,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36389 states, 36388 states have (on average 1.2092448059799934) internal successors, (44002), 36388 states have internal predecessors, (44002), 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) [2023-12-20 03:12:39,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36389 states to 36389 states and 44002 transitions. [2023-12-20 03:12:39,160 INFO L78 Accepts]: Start accepts. Automaton has 36389 states and 44002 transitions. Word has length 103 [2023-12-20 03:12:39,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:12:39,160 INFO L495 AbstractCegarLoop]: Abstraction has 36389 states and 44002 transitions. [2023-12-20 03:12:39,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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) [2023-12-20 03:12:39,161 INFO L276 IsEmpty]: Start isEmpty. Operand 36389 states and 44002 transitions. [2023-12-20 03:12:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-20 03:12:39,162 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:12:39,163 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:12:39,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-12-20 03:12:39,163 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:12:39,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:12:39,163 INFO L85 PathProgramCache]: Analyzing trace with hash -190178881, now seen corresponding path program 1 times [2023-12-20 03:12:39,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:12:39,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324805985] [2023-12-20 03:12:39,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:12:39,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:12:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:12:39,477 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:12:39,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:12:39,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324805985] [2023-12-20 03:12:39,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324805985] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:12:39,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785009392] [2023-12-20 03:12:39,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:12:39,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:12:39,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:12:39,478 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:12:39,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-20 03:12:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:12:39,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-20 03:12:39,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:12:39,701 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-20 03:12:39,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:12:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-20 03:12:39,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785009392] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:12:39,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:12:39,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5, 5] total 23 [2023-12-20 03:12:39,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854379154] [2023-12-20 03:12:39,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:12:39,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-20 03:12:39,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:12:39,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-20 03:12:39,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2023-12-20 03:12:39,924 INFO L87 Difference]: Start difference. First operand 36389 states and 44002 transitions. Second operand has 23 states, 23 states have (on average 12.73913043478261) internal successors, (293), 23 states have internal predecessors, (293), 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) [2023-12-20 03:12:42,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:12:42,803 INFO L93 Difference]: Finished difference Result 86841 states and 104323 transitions. [2023-12-20 03:12:42,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2023-12-20 03:12:42,804 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 12.73913043478261) internal successors, (293), 23 states have internal predecessors, (293), 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 103 [2023-12-20 03:12:42,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:12:42,855 INFO L225 Difference]: With dead ends: 86841 [2023-12-20 03:12:42,855 INFO L226 Difference]: Without dead ends: 50826 [2023-12-20 03:12:42,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1575, Invalid=9767, Unknown=0, NotChecked=0, Total=11342 [2023-12-20 03:12:42,876 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 2933 mSDsluCounter, 3605 mSDsCounter, 0 mSdLazyCounter, 2353 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2933 SdHoareTripleChecker+Valid, 3879 SdHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-20 03:12:42,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2933 Valid, 3879 Invalid, 2367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2353 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-20 03:12:42,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50826 states. [2023-12-20 03:12:43,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50826 to 36961. [2023-12-20 03:12:43,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36961 states, 36960 states have (on average 1.2073051948051947) internal successors, (44622), 36960 states have internal predecessors, (44622), 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) [2023-12-20 03:12:43,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36961 states to 36961 states and 44622 transitions. [2023-12-20 03:12:43,287 INFO L78 Accepts]: Start accepts. Automaton has 36961 states and 44622 transitions. Word has length 103 [2023-12-20 03:12:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:12:43,287 INFO L495 AbstractCegarLoop]: Abstraction has 36961 states and 44622 transitions. [2023-12-20 03:12:43,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.73913043478261) internal successors, (293), 23 states have internal predecessors, (293), 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) [2023-12-20 03:12:43,287 INFO L276 IsEmpty]: Start isEmpty. Operand 36961 states and 44622 transitions. [2023-12-20 03:12:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-20 03:12:43,289 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:12:43,289 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:12:43,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-20 03:12:43,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2023-12-20 03:12:43,491 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:12:43,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:12:43,491 INFO L85 PathProgramCache]: Analyzing trace with hash -432810956, now seen corresponding path program 1 times [2023-12-20 03:12:43,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:12:43,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401561238] [2023-12-20 03:12:43,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:12:43,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:12:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:12:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:12:43,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:12:43,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401561238] [2023-12-20 03:12:43,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401561238] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:12:43,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:12:43,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 03:12:43,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236091739] [2023-12-20 03:12:43,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:12:43,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 03:12:43,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:12:43,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 03:12:43,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:12:43,537 INFO L87 Difference]: Start difference. First operand 36961 states and 44622 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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) [2023-12-20 03:12:43,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:12:43,635 INFO L93 Difference]: Finished difference Result 50996 states and 61170 transitions. [2023-12-20 03:12:43,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 03:12:43,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 103 [2023-12-20 03:12:43,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:12:43,648 INFO L225 Difference]: With dead ends: 50996 [2023-12-20 03:12:43,648 INFO L226 Difference]: Without dead ends: 14829 [2023-12-20 03:12:43,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:12:43,663 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 40 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:12:43,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 194 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:12:43,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14829 states. [2023-12-20 03:12:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14829 to 14827. [2023-12-20 03:12:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14827 states, 14826 states have (on average 1.1610683933630108) internal successors, (17214), 14826 states have internal predecessors, (17214), 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) [2023-12-20 03:12:43,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14827 states to 14827 states and 17214 transitions. [2023-12-20 03:12:43,764 INFO L78 Accepts]: Start accepts. Automaton has 14827 states and 17214 transitions. Word has length 103 [2023-12-20 03:12:43,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:12:43,764 INFO L495 AbstractCegarLoop]: Abstraction has 14827 states and 17214 transitions. [2023-12-20 03:12:43,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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) [2023-12-20 03:12:43,764 INFO L276 IsEmpty]: Start isEmpty. Operand 14827 states and 17214 transitions. [2023-12-20 03:12:43,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-20 03:12:43,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:12:43,765 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:12:43,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-12-20 03:12:43,765 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:12:43,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:12:43,766 INFO L85 PathProgramCache]: Analyzing trace with hash -498604782, now seen corresponding path program 1 times [2023-12-20 03:12:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:12:43,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979002860] [2023-12-20 03:12:43,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:12:43,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:12:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:12:44,350 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:12:44,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:12:44,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979002860] [2023-12-20 03:12:44,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979002860] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:12:44,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255686847] [2023-12-20 03:12:44,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:12:44,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:12:44,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:12:44,351 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:12:44,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-20 03:12:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:12:44,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-20 03:12:44,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:12:45,019 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:12:45,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:12:45,458 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:12:45,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255686847] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:12:45,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:12:45,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 34 [2023-12-20 03:12:45,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948734208] [2023-12-20 03:12:45,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:12:45,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-20 03:12:45,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:12:45,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-20 03:12:45,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2023-12-20 03:12:45,460 INFO L87 Difference]: Start difference. First operand 14827 states and 17214 transitions. Second operand has 34 states, 34 states have (on average 8.352941176470589) internal successors, (284), 34 states have internal predecessors, (284), 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) [2023-12-20 03:12:46,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:12:46,840 INFO L93 Difference]: Finished difference Result 22295 states and 26002 transitions. [2023-12-20 03:12:46,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-20 03:12:46,840 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 8.352941176470589) internal successors, (284), 34 states have internal predecessors, (284), 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 103 [2023-12-20 03:12:46,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:12:46,853 INFO L225 Difference]: With dead ends: 22295 [2023-12-20 03:12:46,853 INFO L226 Difference]: Without dead ends: 15747 [2023-12-20 03:12:46,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=512, Invalid=2458, Unknown=0, NotChecked=0, Total=2970 [2023-12-20 03:12:46,860 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 1272 mSDsluCounter, 4303 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 4566 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 03:12:46,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 4566 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 03:12:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15747 states. [2023-12-20 03:12:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15747 to 11720. [2023-12-20 03:12:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11720 states, 11719 states have (on average 1.1609352333816878) internal successors, (13605), 11719 states have internal predecessors, (13605), 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) [2023-12-20 03:12:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11720 states to 11720 states and 13605 transitions. [2023-12-20 03:12:46,961 INFO L78 Accepts]: Start accepts. Automaton has 11720 states and 13605 transitions. Word has length 103 [2023-12-20 03:12:46,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:12:46,961 INFO L495 AbstractCegarLoop]: Abstraction has 11720 states and 13605 transitions. [2023-12-20 03:12:46,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.352941176470589) internal successors, (284), 34 states have internal predecessors, (284), 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) [2023-12-20 03:12:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 11720 states and 13605 transitions. [2023-12-20 03:12:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-20 03:12:46,962 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:12:46,962 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:12:46,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-20 03:12:47,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2023-12-20 03:12:47,170 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:12:47,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:12:47,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1367566978, now seen corresponding path program 1 times [2023-12-20 03:12:47,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:12:47,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122954706] [2023-12-20 03:12:47,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:12:47,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:12:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:12:47,615 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:12:47,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:12:47,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122954706] [2023-12-20 03:12:47,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122954706] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:12:47,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833882931] [2023-12-20 03:12:47,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:12:47,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:12:47,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:12:47,617 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:12:47,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-20 03:12:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:12:47,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-20 03:12:47,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:12:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:12:51,389 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:12:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:12:55,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833882931] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:12:55,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:12:55,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 26] total 67 [2023-12-20 03:12:55,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397090222] [2023-12-20 03:12:55,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:12:55,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-12-20 03:12:55,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:12:55,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-12-20 03:12:55,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=4066, Unknown=0, NotChecked=0, Total=4422 [2023-12-20 03:12:55,948 INFO L87 Difference]: Start difference. First operand 11720 states and 13605 transitions. Second operand has 67 states, 67 states have (on average 4.313432835820896) internal successors, (289), 67 states have internal predecessors, (289), 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) [2023-12-20 03:14:54,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:14:54,280 INFO L93 Difference]: Finished difference Result 52535 states and 60921 transitions. [2023-12-20 03:14:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 510 states. [2023-12-20 03:14:54,281 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 4.313432835820896) internal successors, (289), 67 states have internal predecessors, (289), 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 103 [2023-12-20 03:14:54,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:14:54,318 INFO L225 Difference]: With dead ends: 52535 [2023-12-20 03:14:54,318 INFO L226 Difference]: Without dead ends: 48703 [2023-12-20 03:14:54,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 569 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134660 ImplicationChecksByTransitivity, 107.3s TimeCoverageRelationStatistics Valid=35770, Invalid=289700, Unknown=0, NotChecked=0, Total=325470 [2023-12-20 03:14:54,339 INFO L413 NwaCegarLoop]: 439 mSDtfsCounter, 6672 mSDsluCounter, 15994 mSDsCounter, 0 mSdLazyCounter, 15338 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6672 SdHoareTripleChecker+Valid, 16433 SdHoareTripleChecker+Invalid, 15626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 15338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2023-12-20 03:14:54,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6672 Valid, 16433 Invalid, 15626 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [288 Valid, 15338 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2023-12-20 03:14:54,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48703 states. [2023-12-20 03:14:54,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48703 to 20206. [2023-12-20 03:14:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20206 states, 20205 states have (on average 1.1771343726800296) internal successors, (23784), 20205 states have internal predecessors, (23784), 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) [2023-12-20 03:14:54,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20206 states to 20206 states and 23784 transitions. [2023-12-20 03:14:54,653 INFO L78 Accepts]: Start accepts. Automaton has 20206 states and 23784 transitions. Word has length 103 [2023-12-20 03:14:54,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:14:54,653 INFO L495 AbstractCegarLoop]: Abstraction has 20206 states and 23784 transitions. [2023-12-20 03:14:54,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 4.313432835820896) internal successors, (289), 67 states have internal predecessors, (289), 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) [2023-12-20 03:14:54,653 INFO L276 IsEmpty]: Start isEmpty. Operand 20206 states and 23784 transitions. [2023-12-20 03:14:54,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-20 03:14:54,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:14:54,654 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:14:54,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-20 03:14:54,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2023-12-20 03:14:54,855 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:14:54,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:14:54,855 INFO L85 PathProgramCache]: Analyzing trace with hash 138167810, now seen corresponding path program 1 times [2023-12-20 03:14:54,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:14:54,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208667056] [2023-12-20 03:14:54,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:14:54,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:14:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:14:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:14:55,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:14:55,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208667056] [2023-12-20 03:14:55,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208667056] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:14:55,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968221571] [2023-12-20 03:14:55,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:14:55,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:14:55,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:14:55,193 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:14:55,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-20 03:14:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:14:55,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-20 03:14:55,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:14:56,417 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:14:56,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:14:57,314 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:14:57,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968221571] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:14:57,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:14:57,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 43 [2023-12-20 03:14:57,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563019432] [2023-12-20 03:14:57,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:14:57,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-20 03:14:57,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:14:57,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-20 03:14:57,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1662, Unknown=0, NotChecked=0, Total=1806 [2023-12-20 03:14:57,316 INFO L87 Difference]: Start difference. First operand 20206 states and 23784 transitions. Second operand has 43 states, 43 states have (on average 6.534883720930233) internal successors, (281), 43 states have internal predecessors, (281), 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) [2023-12-20 03:15:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:15:04,897 INFO L93 Difference]: Finished difference Result 36664 states and 43370 transitions. [2023-12-20 03:15:04,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-12-20 03:15:04,898 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 6.534883720930233) internal successors, (281), 43 states have internal predecessors, (281), 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 104 [2023-12-20 03:15:04,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:15:04,925 INFO L225 Difference]: With dead ends: 36664 [2023-12-20 03:15:04,925 INFO L226 Difference]: Without dead ends: 28986 [2023-12-20 03:15:04,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3001 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2186, Invalid=11154, Unknown=0, NotChecked=0, Total=13340 [2023-12-20 03:15:04,936 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 4420 mSDsluCounter, 4308 mSDsCounter, 0 mSdLazyCounter, 1868 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4420 SdHoareTripleChecker+Valid, 4554 SdHoareTripleChecker+Invalid, 1872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-20 03:15:04,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4420 Valid, 4554 Invalid, 1872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1868 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-20 03:15:04,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28986 states. [2023-12-20 03:15:05,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28986 to 19856. [2023-12-20 03:15:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19856 states, 19855 states have (on average 1.1782422563586) internal successors, (23394), 19855 states have internal predecessors, (23394), 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) [2023-12-20 03:15:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19856 states to 19856 states and 23394 transitions. [2023-12-20 03:15:05,148 INFO L78 Accepts]: Start accepts. Automaton has 19856 states and 23394 transitions. Word has length 104 [2023-12-20 03:15:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:15:05,148 INFO L495 AbstractCegarLoop]: Abstraction has 19856 states and 23394 transitions. [2023-12-20 03:15:05,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 6.534883720930233) internal successors, (281), 43 states have internal predecessors, (281), 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) [2023-12-20 03:15:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 19856 states and 23394 transitions. [2023-12-20 03:15:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-20 03:15:05,149 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:15:05,149 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:15:05,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-20 03:15:05,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:15:05,350 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:15:05,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:15:05,350 INFO L85 PathProgramCache]: Analyzing trace with hash -700787740, now seen corresponding path program 1 times [2023-12-20 03:15:05,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:15:05,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775343260] [2023-12-20 03:15:05,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:15:05,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:15:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:15:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:15:05,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:15:05,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775343260] [2023-12-20 03:15:05,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775343260] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:15:05,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266346588] [2023-12-20 03:15:05,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:15:05,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:15:05,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:15:05,952 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:15:05,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-20 03:15:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:15:06,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-20 03:15:06,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:15:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:15:07,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:15:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:15:08,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266346588] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:15:08,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:15:08,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 17] total 51 [2023-12-20 03:15:08,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551458652] [2023-12-20 03:15:08,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:15:08,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-20 03:15:08,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:15:08,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-20 03:15:08,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2352, Unknown=0, NotChecked=0, Total=2550 [2023-12-20 03:15:08,793 INFO L87 Difference]: Start difference. First operand 19856 states and 23394 transitions. Second operand has 51 states, 51 states have (on average 5.313725490196078) internal successors, (271), 51 states have internal predecessors, (271), 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) [2023-12-20 03:15:36,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:15:36,631 INFO L93 Difference]: Finished difference Result 44368 states and 52411 transitions. [2023-12-20 03:15:36,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2023-12-20 03:15:36,631 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 5.313725490196078) internal successors, (271), 51 states have internal predecessors, (271), 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 104 [2023-12-20 03:15:36,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:15:36,664 INFO L225 Difference]: With dead ends: 44368 [2023-12-20 03:15:36,664 INFO L226 Difference]: Without dead ends: 37558 [2023-12-20 03:15:36,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11334 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=6381, Invalid=30291, Unknown=0, NotChecked=0, Total=36672 [2023-12-20 03:15:36,677 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 8543 mSDsluCounter, 6713 mSDsCounter, 0 mSdLazyCounter, 5248 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8543 SdHoareTripleChecker+Valid, 6990 SdHoareTripleChecker+Invalid, 5480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 5248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-20 03:15:36,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8543 Valid, 6990 Invalid, 5480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 5248 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-20 03:15:36,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37558 states. [2023-12-20 03:15:36,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37558 to 19649. [2023-12-20 03:15:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19649 states, 19648 states have (on average 1.1790004071661238) internal successors, (23165), 19648 states have internal predecessors, (23165), 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) [2023-12-20 03:15:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19649 states to 19649 states and 23165 transitions. [2023-12-20 03:15:37,010 INFO L78 Accepts]: Start accepts. Automaton has 19649 states and 23165 transitions. Word has length 104 [2023-12-20 03:15:37,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:15:37,010 INFO L495 AbstractCegarLoop]: Abstraction has 19649 states and 23165 transitions. [2023-12-20 03:15:37,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 5.313725490196078) internal successors, (271), 51 states have internal predecessors, (271), 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) [2023-12-20 03:15:37,010 INFO L276 IsEmpty]: Start isEmpty. Operand 19649 states and 23165 transitions. [2023-12-20 03:15:37,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-20 03:15:37,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:15:37,012 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:15:37,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-20 03:15:37,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2023-12-20 03:15:37,212 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:15:37,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:15:37,214 INFO L85 PathProgramCache]: Analyzing trace with hash 109356468, now seen corresponding path program 1 times [2023-12-20 03:15:37,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:15:37,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592272527] [2023-12-20 03:15:37,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:15:37,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:15:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:15:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:15:37,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:15:37,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592272527] [2023-12-20 03:15:37,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592272527] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:15:37,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661131207] [2023-12-20 03:15:37,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:15:37,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:15:37,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:15:37,511 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:15:37,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-20 03:15:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:15:37,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-20 03:15:37,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:15:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:15:38,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:15:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:15:38,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661131207] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:15:38,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:15:38,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2023-12-20 03:15:38,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899360239] [2023-12-20 03:15:38,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:15:38,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-20 03:15:38,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:15:38,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-20 03:15:38,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2023-12-20 03:15:38,380 INFO L87 Difference]: Start difference. First operand 19649 states and 23165 transitions. Second operand has 28 states, 28 states have (on average 9.714285714285714) internal successors, (272), 28 states have internal predecessors, (272), 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) [2023-12-20 03:15:39,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:15:39,609 INFO L93 Difference]: Finished difference Result 27255 states and 32226 transitions. [2023-12-20 03:15:39,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-20 03:15:39,612 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.714285714285714) internal successors, (272), 28 states have internal predecessors, (272), 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 105 [2023-12-20 03:15:39,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:15:39,626 INFO L225 Difference]: With dead ends: 27255 [2023-12-20 03:15:39,626 INFO L226 Difference]: Without dead ends: 17006 [2023-12-20 03:15:39,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=386, Invalid=1870, Unknown=0, NotChecked=0, Total=2256 [2023-12-20 03:15:39,633 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 1273 mSDsluCounter, 2855 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 3078 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 03:15:39,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 3078 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 03:15:39,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17006 states. [2023-12-20 03:15:39,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17006 to 13366. [2023-12-20 03:15:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13366 states, 13365 states have (on average 1.1828656939768052) internal successors, (15809), 13365 states have internal predecessors, (15809), 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) [2023-12-20 03:15:39,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13366 states to 13366 states and 15809 transitions. [2023-12-20 03:15:39,742 INFO L78 Accepts]: Start accepts. Automaton has 13366 states and 15809 transitions. Word has length 105 [2023-12-20 03:15:39,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:15:39,742 INFO L495 AbstractCegarLoop]: Abstraction has 13366 states and 15809 transitions. [2023-12-20 03:15:39,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.714285714285714) internal successors, (272), 28 states have internal predecessors, (272), 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) [2023-12-20 03:15:39,743 INFO L276 IsEmpty]: Start isEmpty. Operand 13366 states and 15809 transitions. [2023-12-20 03:15:39,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-20 03:15:39,743 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:15:39,743 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:15:39,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-12-20 03:15:39,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-12-20 03:15:39,944 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:15:39,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:15:39,944 INFO L85 PathProgramCache]: Analyzing trace with hash 925085304, now seen corresponding path program 1 times [2023-12-20 03:15:39,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:15:39,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194883356] [2023-12-20 03:15:39,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:15:39,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:15:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:15:40,448 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:15:40,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:15:40,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194883356] [2023-12-20 03:15:40,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194883356] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:15:40,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833133190] [2023-12-20 03:15:40,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:15:40,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:15:40,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:15:40,450 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:15:40,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-20 03:15:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:15:40,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-20 03:15:40,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:15:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:15:42,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:15:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:15:45,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833133190] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:15:45,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:15:45,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25, 26] total 64 [2023-12-20 03:15:45,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549926656] [2023-12-20 03:15:45,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:15:45,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-12-20 03:15:45,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:15:45,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-12-20 03:15:45,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=3816, Unknown=0, NotChecked=0, Total=4160 [2023-12-20 03:15:45,236 INFO L87 Difference]: Start difference. First operand 13366 states and 15809 transitions. Second operand has 65 states, 65 states have (on average 4.4) internal successors, (286), 64 states have internal predecessors, (286), 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) [2023-12-20 03:16:04,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:16:04,923 INFO L93 Difference]: Finished difference Result 51392 states and 60562 transitions. [2023-12-20 03:16:04,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2023-12-20 03:16:04,923 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 4.4) internal successors, (286), 64 states have internal predecessors, (286), 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 105 [2023-12-20 03:16:04,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:16:04,964 INFO L225 Difference]: With dead ends: 51392 [2023-12-20 03:16:04,964 INFO L226 Difference]: Without dead ends: 44740 [2023-12-20 03:16:04,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15685 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=4567, Invalid=44939, Unknown=0, NotChecked=0, Total=49506 [2023-12-20 03:16:04,981 INFO L413 NwaCegarLoop]: 446 mSDtfsCounter, 3830 mSDsluCounter, 12637 mSDsCounter, 0 mSdLazyCounter, 5741 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3830 SdHoareTripleChecker+Valid, 13083 SdHoareTripleChecker+Invalid, 5814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 5741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-20 03:16:04,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3830 Valid, 13083 Invalid, 5814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 5741 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-12-20 03:16:05,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44740 states. [2023-12-20 03:16:05,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44740 to 12135. [2023-12-20 03:16:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12135 states, 12134 states have (on average 1.1820504367891873) internal successors, (14343), 12134 states have internal predecessors, (14343), 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) [2023-12-20 03:16:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12135 states to 12135 states and 14343 transitions. [2023-12-20 03:16:05,195 INFO L78 Accepts]: Start accepts. Automaton has 12135 states and 14343 transitions. Word has length 105 [2023-12-20 03:16:05,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:16:05,196 INFO L495 AbstractCegarLoop]: Abstraction has 12135 states and 14343 transitions. [2023-12-20 03:16:05,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 4.4) internal successors, (286), 64 states have internal predecessors, (286), 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) [2023-12-20 03:16:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 12135 states and 14343 transitions. [2023-12-20 03:16:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-20 03:16:05,198 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:16:05,198 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:16:05,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-12-20 03:16:05,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2023-12-20 03:16:05,400 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:16:05,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:16:05,401 INFO L85 PathProgramCache]: Analyzing trace with hash -565601685, now seen corresponding path program 1 times [2023-12-20 03:16:05,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:16:05,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662049620] [2023-12-20 03:16:05,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:16:05,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:16:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:16:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-20 03:16:05,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:16:05,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662049620] [2023-12-20 03:16:05,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662049620] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:16:05,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:16:05,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 03:16:05,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405461988] [2023-12-20 03:16:05,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:16:05,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 03:16:05,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:16:05,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 03:16:05,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 03:16:05,455 INFO L87 Difference]: Start difference. First operand 12135 states and 14343 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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) [2023-12-20 03:16:05,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:16:05,530 INFO L93 Difference]: Finished difference Result 17691 states and 21022 transitions. [2023-12-20 03:16:05,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 03:16:05,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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 149 [2023-12-20 03:16:05,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:16:05,537 INFO L225 Difference]: With dead ends: 17691 [2023-12-20 03:16:05,537 INFO L226 Difference]: Without dead ends: 6848 [2023-12-20 03:16:05,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 03:16:05,542 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 92 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:16:05,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 213 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:16:05,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6848 states. [2023-12-20 03:16:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6848 to 4188. [2023-12-20 03:16:05,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4188 states, 4187 states have (on average 1.1437783615954145) internal successors, (4789), 4187 states have internal predecessors, (4789), 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) [2023-12-20 03:16:05,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4188 states to 4188 states and 4789 transitions. [2023-12-20 03:16:05,583 INFO L78 Accepts]: Start accepts. Automaton has 4188 states and 4789 transitions. Word has length 149 [2023-12-20 03:16:05,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:16:05,583 INFO L495 AbstractCegarLoop]: Abstraction has 4188 states and 4789 transitions. [2023-12-20 03:16:05,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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) [2023-12-20 03:16:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand 4188 states and 4789 transitions. [2023-12-20 03:16:05,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-20 03:16:05,585 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:16:05,585 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:16:05,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2023-12-20 03:16:05,586 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:16:05,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:16:05,586 INFO L85 PathProgramCache]: Analyzing trace with hash 709501004, now seen corresponding path program 1 times [2023-12-20 03:16:05,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:16:05,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93965212] [2023-12-20 03:16:05,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:16:05,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:16:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:16:05,944 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 22 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:16:05,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:16:05,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93965212] [2023-12-20 03:16:05,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93965212] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:16:05,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101600731] [2023-12-20 03:16:05,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:16:05,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:16:05,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:16:05,948 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:16:05,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-20 03:16:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:16:06,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-20 03:16:06,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:16:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:16:06,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:16:08,025 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:16:08,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101600731] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:16:08,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:16:08,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2023-12-20 03:16:08,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420262857] [2023-12-20 03:16:08,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:16:08,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-20 03:16:08,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:16:08,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-20 03:16:08,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2023-12-20 03:16:08,027 INFO L87 Difference]: Start difference. First operand 4188 states and 4789 transitions. Second operand has 32 states, 32 states have (on average 12.90625) internal successors, (413), 31 states have internal predecessors, (413), 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) [2023-12-20 03:16:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:16:12,494 INFO L93 Difference]: Finished difference Result 8193 states and 9388 transitions. [2023-12-20 03:16:12,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-20 03:16:12,494 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 12.90625) internal successors, (413), 31 states have internal predecessors, (413), 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 149 [2023-12-20 03:16:12,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:16:12,497 INFO L225 Difference]: With dead ends: 8193 [2023-12-20 03:16:12,497 INFO L226 Difference]: Without dead ends: 4925 [2023-12-20 03:16:12,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1318, Invalid=4232, Unknown=0, NotChecked=0, Total=5550 [2023-12-20 03:16:12,499 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 2219 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2219 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-20 03:16:12,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2219 Valid, 1777 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-20 03:16:12,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2023-12-20 03:16:12,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 4188. [2023-12-20 03:16:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4188 states, 4187 states have (on average 1.1327919751612132) internal successors, (4743), 4187 states have internal predecessors, (4743), 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) [2023-12-20 03:16:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4188 states to 4188 states and 4743 transitions. [2023-12-20 03:16:12,524 INFO L78 Accepts]: Start accepts. Automaton has 4188 states and 4743 transitions. Word has length 149 [2023-12-20 03:16:12,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:16:12,524 INFO L495 AbstractCegarLoop]: Abstraction has 4188 states and 4743 transitions. [2023-12-20 03:16:12,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 12.90625) internal successors, (413), 31 states have internal predecessors, (413), 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) [2023-12-20 03:16:12,524 INFO L276 IsEmpty]: Start isEmpty. Operand 4188 states and 4743 transitions. [2023-12-20 03:16:12,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-20 03:16:12,525 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:16:12,525 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:16:12,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-20 03:16:12,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:16:12,726 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:16:12,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:16:12,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1087411307, now seen corresponding path program 1 times [2023-12-20 03:16:12,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:16:12,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151677620] [2023-12-20 03:16:12,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:16:12,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:16:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:16:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:16:13,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:16:13,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151677620] [2023-12-20 03:16:13,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151677620] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:16:13,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592159266] [2023-12-20 03:16:13,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:16:13,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:16:13,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:16:13,228 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:16:13,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-20 03:16:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:16:13,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-20 03:16:13,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:16:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 18 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:16:14,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:16:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:16:16,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592159266] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:16:16,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:16:16,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 49 [2023-12-20 03:16:16,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201234261] [2023-12-20 03:16:16,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:16:16,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-20 03:16:16,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:16:16,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-20 03:16:16,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2287, Unknown=0, NotChecked=0, Total=2450 [2023-12-20 03:16:16,435 INFO L87 Difference]: Start difference. First operand 4188 states and 4743 transitions. Second operand has 50 states, 50 states have (on average 8.7) internal successors, (435), 49 states have internal predecessors, (435), 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) [2023-12-20 03:16:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:16:52,223 INFO L93 Difference]: Finished difference Result 15137 states and 17278 transitions. [2023-12-20 03:16:52,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2023-12-20 03:16:52,224 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 8.7) internal successors, (435), 49 states have internal predecessors, (435), 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 150 [2023-12-20 03:16:52,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:16:52,234 INFO L225 Difference]: With dead ends: 15137 [2023-12-20 03:16:52,235 INFO L226 Difference]: Without dead ends: 13725 [2023-12-20 03:16:52,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28031 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=11878, Invalid=70778, Unknown=0, NotChecked=0, Total=82656 [2023-12-20 03:16:52,239 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 6340 mSDsluCounter, 7277 mSDsCounter, 0 mSdLazyCounter, 6665 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6340 SdHoareTripleChecker+Valid, 7670 SdHoareTripleChecker+Invalid, 6832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 6665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-20 03:16:52,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6340 Valid, 7670 Invalid, 6832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 6665 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-12-20 03:16:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13725 states. [2023-12-20 03:16:52,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13725 to 6596. [2023-12-20 03:16:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6596 states, 6595 states have (on average 1.1323730098559515) internal successors, (7468), 6595 states have internal predecessors, (7468), 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) [2023-12-20 03:16:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6596 states to 6596 states and 7468 transitions. [2023-12-20 03:16:52,312 INFO L78 Accepts]: Start accepts. Automaton has 6596 states and 7468 transitions. Word has length 150 [2023-12-20 03:16:52,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:16:52,312 INFO L495 AbstractCegarLoop]: Abstraction has 6596 states and 7468 transitions. [2023-12-20 03:16:52,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 8.7) internal successors, (435), 49 states have internal predecessors, (435), 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) [2023-12-20 03:16:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 6596 states and 7468 transitions. [2023-12-20 03:16:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-20 03:16:52,314 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:16:52,314 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:16:52,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-20 03:16:52,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:16:52,515 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:16:52,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:16:52,515 INFO L85 PathProgramCache]: Analyzing trace with hash 15556911, now seen corresponding path program 1 times [2023-12-20 03:16:52,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:16:52,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707089609] [2023-12-20 03:16:52,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:16:52,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:16:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:16:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 26 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:16:53,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:16:53,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707089609] [2023-12-20 03:16:53,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707089609] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:16:53,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920118555] [2023-12-20 03:16:53,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:16:53,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:16:53,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:16:53,139 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:16:53,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-20 03:16:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:16:53,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-20 03:16:53,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:16:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:16:54,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:16:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 26 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:16:55,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920118555] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:16:55,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:16:55,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 19] total 49 [2023-12-20 03:16:55,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397636456] [2023-12-20 03:16:55,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:16:55,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-20 03:16:55,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:16:55,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-20 03:16:55,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2177, Unknown=0, NotChecked=0, Total=2352 [2023-12-20 03:16:55,636 INFO L87 Difference]: Start difference. First operand 6596 states and 7468 transitions. Second operand has 49 states, 49 states have (on average 8.061224489795919) internal successors, (395), 49 states have internal predecessors, (395), 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) [2023-12-20 03:17:08,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:17:08,303 INFO L93 Difference]: Finished difference Result 15551 states and 17734 transitions. [2023-12-20 03:17:08,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2023-12-20 03:17:08,304 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 8.061224489795919) internal successors, (395), 49 states have internal predecessors, (395), 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 151 [2023-12-20 03:17:08,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:17:08,313 INFO L225 Difference]: With dead ends: 15551 [2023-12-20 03:17:08,313 INFO L226 Difference]: Without dead ends: 13639 [2023-12-20 03:17:08,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=4381, Invalid=26771, Unknown=0, NotChecked=0, Total=31152 [2023-12-20 03:17:08,318 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 4093 mSDsluCounter, 7128 mSDsCounter, 0 mSdLazyCounter, 2766 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4093 SdHoareTripleChecker+Valid, 7320 SdHoareTripleChecker+Invalid, 2801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-20 03:17:08,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4093 Valid, 7320 Invalid, 2801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2766 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-20 03:17:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13639 states. [2023-12-20 03:17:08,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13639 to 7378. [2023-12-20 03:17:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7378 states, 7377 states have (on average 1.1325742171614477) internal successors, (8355), 7377 states have internal predecessors, (8355), 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) [2023-12-20 03:17:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7378 states to 7378 states and 8355 transitions. [2023-12-20 03:17:08,395 INFO L78 Accepts]: Start accepts. Automaton has 7378 states and 8355 transitions. Word has length 151 [2023-12-20 03:17:08,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:17:08,395 INFO L495 AbstractCegarLoop]: Abstraction has 7378 states and 8355 transitions. [2023-12-20 03:17:08,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 8.061224489795919) internal successors, (395), 49 states have internal predecessors, (395), 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) [2023-12-20 03:17:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 7378 states and 8355 transitions. [2023-12-20 03:17:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-20 03:17:08,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:17:08,397 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:17:08,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-12-20 03:17:08,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2023-12-20 03:17:08,598 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:17:08,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:17:08,598 INFO L85 PathProgramCache]: Analyzing trace with hash 352293900, now seen corresponding path program 1 times [2023-12-20 03:17:08,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:17:08,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961921345] [2023-12-20 03:17:08,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:17:08,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:17:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:17:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 22 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:17:09,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:17:09,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961921345] [2023-12-20 03:17:09,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961921345] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:17:09,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498833050] [2023-12-20 03:17:09,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:17:09,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:17:09,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:17:09,039 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:17:09,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-20 03:17:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:17:09,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-20 03:17:09,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:17:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 31 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:17:10,395 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:17:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 31 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:17:12,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498833050] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:17:12,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:17:12,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 21] total 58 [2023-12-20 03:17:12,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782873831] [2023-12-20 03:17:12,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:17:12,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-20 03:17:12,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:17:12,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-20 03:17:12,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=2990, Unknown=0, NotChecked=0, Total=3306 [2023-12-20 03:17:12,403 INFO L87 Difference]: Start difference. First operand 7378 states and 8355 transitions. Second operand has 58 states, 58 states have (on average 7.379310344827586) internal successors, (428), 58 states have internal predecessors, (428), 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) [2023-12-20 03:17:36,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:17:36,712 INFO L93 Difference]: Finished difference Result 15793 states and 17891 transitions. [2023-12-20 03:17:36,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2023-12-20 03:17:36,712 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 7.379310344827586) internal successors, (428), 58 states have internal predecessors, (428), 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 151 [2023-12-20 03:17:36,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:17:36,720 INFO L225 Difference]: With dead ends: 15793 [2023-12-20 03:17:36,720 INFO L226 Difference]: Without dead ends: 12762 [2023-12-20 03:17:36,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20192 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=9045, Invalid=55217, Unknown=0, NotChecked=0, Total=64262 [2023-12-20 03:17:36,725 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 5751 mSDsluCounter, 4856 mSDsCounter, 0 mSdLazyCounter, 3797 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5751 SdHoareTripleChecker+Valid, 4972 SdHoareTripleChecker+Invalid, 3958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 3797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:17:36,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5751 Valid, 4972 Invalid, 3958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 3797 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-20 03:17:36,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12762 states. [2023-12-20 03:17:36,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12762 to 7653. [2023-12-20 03:17:36,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7653 states, 7652 states have (on average 1.1317302665969682) internal successors, (8660), 7652 states have internal predecessors, (8660), 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) [2023-12-20 03:17:36,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7653 states to 7653 states and 8660 transitions. [2023-12-20 03:17:36,785 INFO L78 Accepts]: Start accepts. Automaton has 7653 states and 8660 transitions. Word has length 151 [2023-12-20 03:17:36,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:17:36,786 INFO L495 AbstractCegarLoop]: Abstraction has 7653 states and 8660 transitions. [2023-12-20 03:17:36,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 7.379310344827586) internal successors, (428), 58 states have internal predecessors, (428), 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) [2023-12-20 03:17:36,786 INFO L276 IsEmpty]: Start isEmpty. Operand 7653 states and 8660 transitions. [2023-12-20 03:17:36,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-20 03:17:36,787 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:17:36,787 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:17:36,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-12-20 03:17:36,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2023-12-20 03:17:36,989 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:17:36,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:17:36,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1165123040, now seen corresponding path program 1 times [2023-12-20 03:17:36,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:17:36,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108035682] [2023-12-20 03:17:36,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:17:36,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:17:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:17:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 31 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:17:37,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:17:37,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108035682] [2023-12-20 03:17:37,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108035682] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:17:37,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737411700] [2023-12-20 03:17:37,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:17:37,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:17:37,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:17:37,472 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:17:37,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-20 03:17:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:17:37,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-20 03:17:37,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:17:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:17:38,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:17:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 31 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:17:39,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737411700] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:17:39,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:17:39,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 31 [2023-12-20 03:17:39,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834518899] [2023-12-20 03:17:39,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:17:39,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-20 03:17:39,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:17:39,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-20 03:17:39,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2023-12-20 03:17:39,544 INFO L87 Difference]: Start difference. First operand 7653 states and 8660 transitions. Second operand has 32 states, 32 states have (on average 12.0) internal successors, (384), 31 states have internal predecessors, (384), 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) [2023-12-20 03:17:42,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:17:42,607 INFO L93 Difference]: Finished difference Result 21816 states and 25025 transitions. [2023-12-20 03:17:42,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-20 03:17:42,608 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 12.0) internal successors, (384), 31 states have internal predecessors, (384), 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 151 [2023-12-20 03:17:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:17:42,621 INFO L225 Difference]: With dead ends: 21816 [2023-12-20 03:17:42,621 INFO L226 Difference]: Without dead ends: 17976 [2023-12-20 03:17:42,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1324, Invalid=3932, Unknown=0, NotChecked=0, Total=5256 [2023-12-20 03:17:42,626 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 3557 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3557 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-20 03:17:42,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3557 Valid, 1478 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-20 03:17:42,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17976 states. [2023-12-20 03:17:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17976 to 9873. [2023-12-20 03:17:42,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9873 states, 9872 states have (on average 1.1349270664505673) internal successors, (11204), 9872 states have internal predecessors, (11204), 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) [2023-12-20 03:17:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9873 states to 9873 states and 11204 transitions. [2023-12-20 03:17:42,731 INFO L78 Accepts]: Start accepts. Automaton has 9873 states and 11204 transitions. Word has length 151 [2023-12-20 03:17:42,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:17:42,731 INFO L495 AbstractCegarLoop]: Abstraction has 9873 states and 11204 transitions. [2023-12-20 03:17:42,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 12.0) internal successors, (384), 31 states have internal predecessors, (384), 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) [2023-12-20 03:17:42,731 INFO L276 IsEmpty]: Start isEmpty. Operand 9873 states and 11204 transitions. [2023-12-20 03:17:42,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-20 03:17:42,732 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:17:42,732 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:17:42,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-12-20 03:17:42,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:17:42,941 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:17:42,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:17:42,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2033204343, now seen corresponding path program 1 times [2023-12-20 03:17:42,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:17:42,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368043569] [2023-12-20 03:17:42,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:17:42,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:17:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:17:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 35 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:17:43,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:17:43,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368043569] [2023-12-20 03:17:43,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368043569] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:17:43,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692531306] [2023-12-20 03:17:43,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:17:43,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:17:43,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:17:43,865 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:17:43,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-20 03:17:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:17:43,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-20 03:17:44,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:17:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 35 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:17:46,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:17:48,516 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 35 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:17:48,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692531306] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:17:48,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:17:48,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 22] total 71 [2023-12-20 03:17:48,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406719764] [2023-12-20 03:17:48,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:17:48,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-12-20 03:17:48,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:17:48,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-12-20 03:17:48,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=4561, Unknown=0, NotChecked=0, Total=4970 [2023-12-20 03:17:48,519 INFO L87 Difference]: Start difference. First operand 9873 states and 11204 transitions. Second operand has 71 states, 71 states have (on average 5.859154929577465) internal successors, (416), 71 states have internal predecessors, (416), 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) [2023-12-20 03:18:14,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:18:14,288 INFO L93 Difference]: Finished difference Result 24555 states and 27759 transitions. [2023-12-20 03:18:14,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2023-12-20 03:18:14,289 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 5.859154929577465) internal successors, (416), 71 states have internal predecessors, (416), 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 151 [2023-12-20 03:18:14,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:18:14,302 INFO L225 Difference]: With dead ends: 24555 [2023-12-20 03:18:14,302 INFO L226 Difference]: Without dead ends: 20925 [2023-12-20 03:18:14,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24187 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=9018, Invalid=63074, Unknown=0, NotChecked=0, Total=72092 [2023-12-20 03:18:14,306 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 5877 mSDsluCounter, 13122 mSDsCounter, 0 mSdLazyCounter, 5376 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5877 SdHoareTripleChecker+Valid, 13455 SdHoareTripleChecker+Invalid, 5433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 5376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:18:14,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5877 Valid, 13455 Invalid, 5433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 5376 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-12-20 03:18:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20925 states. [2023-12-20 03:18:14,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20925 to 11830. [2023-12-20 03:18:14,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11830 states, 11829 states have (on average 1.128920449742159) internal successors, (13354), 11829 states have internal predecessors, (13354), 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) [2023-12-20 03:18:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11830 states to 11830 states and 13354 transitions. [2023-12-20 03:18:14,406 INFO L78 Accepts]: Start accepts. Automaton has 11830 states and 13354 transitions. Word has length 151 [2023-12-20 03:18:14,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:18:14,407 INFO L495 AbstractCegarLoop]: Abstraction has 11830 states and 13354 transitions. [2023-12-20 03:18:14,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 5.859154929577465) internal successors, (416), 71 states have internal predecessors, (416), 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) [2023-12-20 03:18:14,407 INFO L276 IsEmpty]: Start isEmpty. Operand 11830 states and 13354 transitions. [2023-12-20 03:18:14,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-20 03:18:14,408 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:18:14,408 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:18:14,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-12-20 03:18:14,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:18:14,614 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:18:14,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:18:14,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1803309237, now seen corresponding path program 1 times [2023-12-20 03:18:14,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:18:14,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175956308] [2023-12-20 03:18:14,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:18:14,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:18:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:18:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-20 03:18:15,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:18:15,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175956308] [2023-12-20 03:18:15,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175956308] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:18:15,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142795097] [2023-12-20 03:18:15,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:18:15,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:18:15,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:18:15,243 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:18:15,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-12-20 03:18:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:18:15,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 77 conjunts are in the unsatisfiable core [2023-12-20 03:18:15,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:18:18,766 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-20 03:18:18,766 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:18:27,904 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 33 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:18:27,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142795097] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:18:27,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:18:27,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 32, 40] total 90 [2023-12-20 03:18:27,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421916701] [2023-12-20 03:18:27,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:18:27,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2023-12-20 03:18:27,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:18:27,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2023-12-20 03:18:27,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=646, Invalid=7364, Unknown=0, NotChecked=0, Total=8010 [2023-12-20 03:18:27,906 INFO L87 Difference]: Start difference. First operand 11830 states and 13354 transitions. Second operand has 90 states, 90 states have (on average 3.988888888888889) internal successors, (359), 90 states have internal predecessors, (359), 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) [2023-12-20 03:20:03,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:20:03,172 INFO L93 Difference]: Finished difference Result 27383 states and 30779 transitions. [2023-12-20 03:20:03,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 348 states. [2023-12-20 03:20:03,172 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 3.988888888888889) internal successors, (359), 90 states have internal predecessors, (359), 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 151 [2023-12-20 03:20:03,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:20:03,194 INFO L225 Difference]: With dead ends: 27383 [2023-12-20 03:20:03,194 INFO L226 Difference]: Without dead ends: 26212 [2023-12-20 03:20:03,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 433 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75671 ImplicationChecksByTransitivity, 88.5s TimeCoverageRelationStatistics Valid=20282, Invalid=168508, Unknown=0, NotChecked=0, Total=188790 [2023-12-20 03:20:03,209 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 11274 mSDsluCounter, 13253 mSDsCounter, 0 mSdLazyCounter, 10870 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11274 SdHoareTripleChecker+Valid, 13549 SdHoareTripleChecker+Invalid, 11383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 10870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2023-12-20 03:20:03,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11274 Valid, 13549 Invalid, 11383 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [513 Valid, 10870 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2023-12-20 03:20:03,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26212 states. [2023-12-20 03:20:03,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26212 to 11812. [2023-12-20 03:20:03,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11812 states, 11811 states have (on average 1.1289475912285158) internal successors, (13334), 11811 states have internal predecessors, (13334), 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) [2023-12-20 03:20:03,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11812 states to 11812 states and 13334 transitions. [2023-12-20 03:20:03,363 INFO L78 Accepts]: Start accepts. Automaton has 11812 states and 13334 transitions. Word has length 151 [2023-12-20 03:20:03,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:20:03,363 INFO L495 AbstractCegarLoop]: Abstraction has 11812 states and 13334 transitions. [2023-12-20 03:20:03,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 3.988888888888889) internal successors, (359), 90 states have internal predecessors, (359), 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) [2023-12-20 03:20:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 11812 states and 13334 transitions. [2023-12-20 03:20:03,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-20 03:20:03,365 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:20:03,365 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:20:03,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-12-20 03:20:03,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2023-12-20 03:20:03,566 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:20:03,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:20:03,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1482108712, now seen corresponding path program 1 times [2023-12-20 03:20:03,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:20:03,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950645656] [2023-12-20 03:20:03,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:20:03,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:20:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:20:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 74 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-20 03:20:03,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:20:03,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950645656] [2023-12-20 03:20:03,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950645656] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:20:03,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655606314] [2023-12-20 03:20:03,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:20:03,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:20:03,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:20:03,681 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:20:03,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-20 03:20:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:20:03,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-20 03:20:03,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:20:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 74 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-20 03:20:04,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:20:04,368 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 72 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-20 03:20:04,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655606314] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:20:04,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:20:04,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2023-12-20 03:20:04,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876476689] [2023-12-20 03:20:04,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:20:04,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-20 03:20:04,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:20:04,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-20 03:20:04,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-20 03:20:04,369 INFO L87 Difference]: Start difference. First operand 11812 states and 13334 transitions. Second operand has 12 states, 12 states have (on average 26.5) internal successors, (318), 12 states have internal predecessors, (318), 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) [2023-12-20 03:20:04,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:20:04,495 INFO L93 Difference]: Finished difference Result 30873 states and 35739 transitions. [2023-12-20 03:20:04,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-20 03:20:04,496 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 26.5) internal successors, (318), 12 states have internal predecessors, (318), 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 152 [2023-12-20 03:20:04,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:20:04,512 INFO L225 Difference]: With dead ends: 30873 [2023-12-20 03:20:04,512 INFO L226 Difference]: Without dead ends: 19556 [2023-12-20 03:20:04,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-12-20 03:20:04,521 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 301 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 03:20:04,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1024 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 03:20:04,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19556 states. [2023-12-20 03:20:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19556 to 18374. [2023-12-20 03:20:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18374 states, 18373 states have (on average 1.1440156751755293) internal successors, (21019), 18373 states have internal predecessors, (21019), 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) [2023-12-20 03:20:04,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18374 states to 18374 states and 21019 transitions. [2023-12-20 03:20:04,667 INFO L78 Accepts]: Start accepts. Automaton has 18374 states and 21019 transitions. Word has length 152 [2023-12-20 03:20:04,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:20:04,667 INFO L495 AbstractCegarLoop]: Abstraction has 18374 states and 21019 transitions. [2023-12-20 03:20:04,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.5) internal successors, (318), 12 states have internal predecessors, (318), 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) [2023-12-20 03:20:04,667 INFO L276 IsEmpty]: Start isEmpty. Operand 18374 states and 21019 transitions. [2023-12-20 03:20:04,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-20 03:20:04,668 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:20:04,668 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:20:04,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-12-20 03:20:04,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2023-12-20 03:20:04,869 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:20:04,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:20:04,869 INFO L85 PathProgramCache]: Analyzing trace with hash 596570162, now seen corresponding path program 1 times [2023-12-20 03:20:04,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:20:04,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803968578] [2023-12-20 03:20:04,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:20:04,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:20:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:20:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 31 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:20:05,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:20:05,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803968578] [2023-12-20 03:20:05,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803968578] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:20:05,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897536236] [2023-12-20 03:20:05,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:20:05,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:20:05,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:20:05,353 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 03:20:05,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-20 03:20:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:20:05,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-20 03:20:05,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:20:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 31 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:20:07,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:20:10,326 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 31 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 03:20:10,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897536236] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:20:10,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:20:10,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 29, 26] total 65 [2023-12-20 03:20:10,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482701238] [2023-12-20 03:20:10,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:20:10,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-12-20 03:20:10,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:20:10,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-12-20 03:20:10,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=3673, Unknown=0, NotChecked=0, Total=4160 [2023-12-20 03:20:10,328 INFO L87 Difference]: Start difference. First operand 18374 states and 21019 transitions. Second operand has 65 states, 65 states have (on average 5.953846153846154) internal successors, (387), 65 states have internal predecessors, (387), 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) [2023-12-20 03:20:21,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:20:21,206 INFO L93 Difference]: Finished difference Result 29200 states and 33142 transitions. [2023-12-20 03:20:21,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2023-12-20 03:20:21,207 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 5.953846153846154) internal successors, (387), 65 states have internal predecessors, (387), 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 152 [2023-12-20 03:20:21,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:20:21,229 INFO L225 Difference]: With dead ends: 29200 [2023-12-20 03:20:21,229 INFO L226 Difference]: Without dead ends: 26474 [2023-12-20 03:20:21,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10455 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=5057, Invalid=29353, Unknown=0, NotChecked=0, Total=34410 [2023-12-20 03:20:21,240 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 2064 mSDsluCounter, 10109 mSDsCounter, 0 mSdLazyCounter, 5411 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2064 SdHoareTripleChecker+Valid, 10375 SdHoareTripleChecker+Invalid, 5429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-20 03:20:21,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2064 Valid, 10375 Invalid, 5429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 5411 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-20 03:20:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26474 states. [2023-12-20 03:20:21,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26474 to 17266. [2023-12-20 03:20:21,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17266 states, 17265 states have (on average 1.1464813205907907) internal successors, (19794), 17265 states have internal predecessors, (19794), 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) [2023-12-20 03:20:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17266 states to 17266 states and 19794 transitions. [2023-12-20 03:20:21,395 INFO L78 Accepts]: Start accepts. Automaton has 17266 states and 19794 transitions. Word has length 152 [2023-12-20 03:20:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:20:21,396 INFO L495 AbstractCegarLoop]: Abstraction has 17266 states and 19794 transitions. [2023-12-20 03:20:21,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 5.953846153846154) internal successors, (387), 65 states have internal predecessors, (387), 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) [2023-12-20 03:20:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 17266 states and 19794 transitions. [2023-12-20 03:20:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-20 03:20:21,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:20:21,397 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:20:21,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-12-20 03:20:21,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2023-12-20 03:20:21,598 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-20 03:20:21,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:20:21,598 INFO L85 PathProgramCache]: Analyzing trace with hash -156947010, now seen corresponding path program 1 times [2023-12-20 03:20:21,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:20:21,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308457152] [2023-12-20 03:20:21,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:20:21,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:20:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 03:20:21,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 03:20:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 03:20:21,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 03:20:21,710 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 03:20:21,711 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-12-20 03:20:21,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-12-20 03:20:21,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-12-20 03:20:21,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2023-12-20 03:20:21,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-12-20 03:20:21,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-12-20 03:20:21,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-12-20 03:20:21,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2023-12-20 03:20:21,716 INFO L445 BasicCegarLoop]: Path program 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] [2023-12-20 03:20:21,719 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 03:20:21,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 03:20:21 BoogieIcfgContainer [2023-12-20 03:20:21,853 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 03:20:21,858 INFO L158 Benchmark]: Toolchain (without parser) took 736046.47ms. Allocated memory was 318.8MB in the beginning and 4.4GB in the end (delta: 4.1GB). Free memory was 263.0MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2023-12-20 03:20:21,858 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 03:20:21,858 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.70ms. Allocated memory is still 318.8MB. Free memory was 263.0MB in the beginning and 227.9MB in the end (delta: 35.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-20 03:20:21,858 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.88ms. Allocated memory is still 318.8MB. Free memory was 227.9MB in the beginning and 221.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-20 03:20:21,860 INFO L158 Benchmark]: Boogie Preprocessor took 100.80ms. Allocated memory is still 318.8MB. Free memory was 221.6MB in the beginning and 215.8MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-20 03:20:21,860 INFO L158 Benchmark]: RCFGBuilder took 854.92ms. Allocated memory is still 318.8MB. Free memory was 215.8MB in the beginning and 140.9MB in the end (delta: 75.0MB). Peak memory consumption was 75.5MB. Max. memory is 8.0GB. [2023-12-20 03:20:21,860 INFO L158 Benchmark]: TraceAbstraction took 734587.80ms. Allocated memory was 318.8MB in the beginning and 4.4GB in the end (delta: 4.1GB). Free memory was 139.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2023-12-20 03:20:21,860 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 426.70ms. Allocated memory is still 318.8MB. Free memory was 263.0MB in the beginning and 227.9MB in the end (delta: 35.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.88ms. Allocated memory is still 318.8MB. Free memory was 227.9MB in the beginning and 221.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 100.80ms. Allocated memory is still 318.8MB. Free memory was 221.6MB in the beginning and 215.8MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 854.92ms. Allocated memory is still 318.8MB. Free memory was 215.8MB in the beginning and 140.9MB in the end (delta: 75.0MB). Peak memory consumption was 75.5MB. Max. memory is 8.0GB. * TraceAbstraction took 734587.80ms. Allocated memory was 318.8MB in the beginning and 4.4GB in the end (delta: 4.1GB). Free memory was 139.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.0GB. 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: 315]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L26] msg_t nomsg = (msg_t )-1; [L27] unsigned char r1 = '\x0'; [L28] port_t p1 = 0; [L29] char p1_old = '\x0'; [L30] char p1_new = '\x0'; [L31] char id1 = '\x0'; [L32] char st1 = '\x0'; [L33] msg_t send1 = '\x0'; [L34] _Bool mode1 = 0; [L35] port_t p2 = 0; [L36] char p2_old = '\x0'; [L37] char p2_new = '\x0'; [L38] char id2 = '\x0'; [L39] char st2 = '\x0'; [L40] msg_t send2 = '\x0'; [L41] _Bool mode2 = 0; [L42] port_t p3 = 0; [L43] char p3_old = '\x0'; [L44] char p3_new = '\x0'; [L45] char id3 = '\x0'; [L46] char st3 = '\x0'; [L47] msg_t send3 = '\x0'; [L48] _Bool mode3 = 0; [L52] void (*nodes[3])() = { &node1, &node2, &node3 }; [L56] int __return_95; [L57] int __return_413; [L58] int __return_1146; [L59] int __return_399; [L60] int __return_1035; [L61] int __return_385; [L62] int __return_942; [L63] int __return_371; [L64] int __return_848; [L65] int __return_357; [L66] int __return_766; [L67] int __return_343; [L68] int __return_672; [L69] int __return_329; [L70] int __return_593; [L71] int __return_315; [L72] int __return_513; [L73] int __return_1296; [L76] int main__c1; [L77] int main__i2; [L78] main__c1 = 0 [L79] r1 = __VERIFIER_nondet_uchar() [L80] id1 = __VERIFIER_nondet_char() [L81] st1 = __VERIFIER_nondet_char() [L82] send1 = __VERIFIER_nondet_char() [L83] mode1 = __VERIFIER_nondet_bool() [L84] id2 = __VERIFIER_nondet_char() [L85] st2 = __VERIFIER_nondet_char() [L86] send2 = __VERIFIER_nondet_char() [L87] mode2 = __VERIFIER_nondet_bool() [L88] id3 = __VERIFIER_nondet_char() [L89] st3 = __VERIFIER_nondet_char() [L90] send3 = __VERIFIER_nondet_char() [L91] mode3 = __VERIFIER_nondet_bool() [L93] int init__tmp; VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=0, __return_main=0, id1=2, id2=1, id3=0, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L94] COND TRUE ((int)r1) == 0 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=0, __return_main=0, id1=2, id2=1, id3=0, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L96] COND TRUE ((int)id1) >= 0 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=0, __return_main=0, id1=2, id2=1, id3=0, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L98] COND TRUE ((int)st1) == 0 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=0, __return_main=0, id1=2, id2=1, id3=0, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L100] COND TRUE ((int)send1) == ((int)id1) VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=0, __return_main=0, id1=2, id2=1, id3=0, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L102] COND TRUE ((int)mode1) == 0 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=0, __return_main=0, id1=2, id2=1, id3=0, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L104] COND TRUE ((int)id2) >= 0 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=0, __return_main=0, id1=2, id2=1, id3=0, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L106] COND TRUE ((int)st2) == 0 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=0, __return_main=0, id1=2, id2=1, id3=0, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L108] COND TRUE ((int)send2) == ((int)id2) VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=0, __return_main=0, id1=2, id2=1, id3=0, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L110] COND TRUE ((int)mode2) == 0 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=0, __return_main=0, id1=2, id2=1, id3=0, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L112] COND TRUE ((int)id3) >= 0 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=0, __return_main=0, id1=2, id2=1, id3=0, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L114] COND TRUE ((int)st3) == 0 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=0, __return_main=0, id1=2, id2=1, id3=0, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L116] COND TRUE ((int)send3) == ((int)id3) VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=0, __return_main=0, id1=2, id2=1, id3=0, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L118] COND TRUE ((int)mode3) == 0 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=0, __return_main=0, id1=2, id2=1, id3=0, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L120] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=0, __return_main=0, id1=2, id2=1, id3=0, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L122] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=0, __return_main=0, id1=2, id2=1, id3=0, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L124] COND TRUE ((int)id2) != ((int)id3) [L126] init__tmp = 1 [L127] __return_95 = init__tmp [L128] main__i2 = __return_95 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, id1=2, id2=1, id3=0, init__tmp=1, main__c1=0, main__i2=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L129] COND TRUE main__i2 != 0 [L131] p1_old = nomsg [L132] p1_new = nomsg [L133] p2_old = nomsg [L134] p2_new = nomsg [L135] p3_old = nomsg [L136] p3_new = nomsg [L137] main__i2 = 0 [L139] msg_t node1__m1; [L140] node1__m1 = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, id1=2, id2=1, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L141] COND FALSE !(!(mode1 == 0)) [L147] int node1____CPAchecker_TMP_0; VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, id1=2, id2=1, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L148] COND TRUE send1 != nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, id1=2, id2=1, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L150] COND TRUE p1_new == nomsg [L152] node1____CPAchecker_TMP_0 = send1 [L153] p1_new = node1____CPAchecker_TMP_0 [L154] mode1 = 1 [L156] msg_t node2__m2; [L157] node2__m2 = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, id1=2, id2=1, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=2, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L158] COND FALSE !(!(mode2 == 0)) [L164] int node2____CPAchecker_TMP_0; VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, id1=2, id2=1, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=2, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L165] COND TRUE send2 != nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, id1=2, id2=1, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=2, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L167] COND TRUE p2_new == nomsg [L169] node2____CPAchecker_TMP_0 = send2 [L170] p2_new = node2____CPAchecker_TMP_0 [L171] mode2 = 1 [L173] msg_t node3__m3; [L174] node3__m3 = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, id1=2, id2=1, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node2____CPAchecker_TMP_0=1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=2, p1_old=-1, p2=0, p2_new=1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L175] COND FALSE !(!(mode3 == 0)) [L181] int node3____CPAchecker_TMP_0; VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, id1=2, id2=1, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node2____CPAchecker_TMP_0=1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=2, p1_old=-1, p2=0, p2_new=1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L182] COND TRUE send3 != nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, id1=2, id2=1, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node2____CPAchecker_TMP_0=1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=2, p1_old=-1, p2=0, p2_new=1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L184] COND TRUE p3_new == nomsg [L186] node3____CPAchecker_TMP_0 = send3 [L187] p3_new = node3____CPAchecker_TMP_0 [L188] mode3 = 1 [L189] p1_old = p1_new [L190] p1_new = nomsg [L191] p2_old = p2_new [L192] p2_new = nomsg [L193] p3_old = p3_new [L194] p3_new = nomsg [L196] int check__tmp; VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, id1=2, id2=1, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node2____CPAchecker_TMP_0=1, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L197] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, id1=2, id2=1, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node2____CPAchecker_TMP_0=1, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L199] COND FALSE !(((int)r1) >= 3) VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, id1=2, id2=1, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node2____CPAchecker_TMP_0=1, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L205] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=0, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, id1=2, id2=1, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node2____CPAchecker_TMP_0=1, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L207] COND TRUE ((int)r1) < 3 [L209] check__tmp = 1 [L210] __return_413 = check__tmp [L211] main__c1 = __return_413 [L213] _Bool __tmp_1; [L214] __tmp_1 = main__c1 [L215] _Bool assert__arg; [L216] assert__arg = __tmp_1 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node2____CPAchecker_TMP_0=1, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L217] COND FALSE !(assert__arg == 0) [L224] msg_t node1__m1; [L225] node1__m1 = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=1, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L226] COND TRUE !(mode1 == 0) VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=1, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L228] COND FALSE !(r1 == 255) [L234] r1 = r1 + 1 [L235] node1__m1 = p3_old [L236] p3_old = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L237] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L239] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L246] COND FALSE !(((int)node1__m1) == ((int)id1)) [L370] send1 = node1__m1 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=0, st1=0, st2=0, st3=0] [L372] mode1 = 0 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=0, st1=0, st2=0, st3=0] [L477] msg_t node2__m2; [L478] node2__m2 = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=0, st1=0, st2=0, st3=0] [L479] COND TRUE !(mode2 == 0) [L481] node2__m2 = p1_old [L482] p1_old = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=0, st1=0, st2=0, st3=0] [L483] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=0, st1=0, st2=0, st3=0] [L485] COND TRUE ((int)node2__m2) > ((int)id2) [L487] send2 = node2__m2 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L575] mode2 = 0 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L1390] msg_t node3__m3; [L1391] node3__m3 = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L1392] COND TRUE !(mode3 == 0) [L1394] node3__m3 = p2_old [L1395] p2_old = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L1396] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=0, st1=0, st2=0, st3=0] [L1398] COND TRUE ((int)node3__m3) > ((int)id3) [L1400] send3 = node3__m3 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1461] mode3 = 0 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1835] p1_old = p1_new [L1836] p1_new = nomsg [L1837] p2_old = p2_new [L1838] p2_new = nomsg [L1839] p3_old = p3_new [L1840] p3_new = nomsg [L1842] int check__tmp; VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1843] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1845] COND FALSE !(((int)r1) >= 3) VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1851] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=0, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1853] COND TRUE ((int)r1) < 3 [L1855] check__tmp = 1 [L1856] __return_513 = check__tmp [L1857] main__c1 = __return_513 [L1859] _Bool __tmp_16; [L1860] __tmp_16 = main__c1 [L1861] _Bool assert__arg; [L1862] assert__arg = __tmp_16 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1863] COND FALSE !(assert__arg == 0) VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1871] msg_t node1__m1; [L1872] node1__m1 = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1873] COND FALSE !(!(mode1 == 0)) [L2093] int node1____CPAchecker_TMP_0; VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L2094] COND TRUE send1 != nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L2096] COND TRUE p1_new == nomsg [L2098] node1____CPAchecker_TMP_0 = send1 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L2111] p1_new = node1____CPAchecker_TMP_0 [L2112] mode1 = 1 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1913] msg_t node2__m2; [L1914] node2__m2 = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1915] COND FALSE !(!(mode2 == 0)) [L2064] int node2____CPAchecker_TMP_0; VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L2065] COND TRUE send2 != nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L2067] COND TRUE p2_new == nomsg [L2069] node2____CPAchecker_TMP_0 = send2 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L2082] p2_new = node2____CPAchecker_TMP_0 [L2083] mode2 = 1 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=2, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1945] msg_t node3__m3; [L1946] node3__m3 = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=2, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1947] COND FALSE !(!(mode3 == 0)) [L2036] int node3____CPAchecker_TMP_0; VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=2, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L2037] COND TRUE send3 != nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=2, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L2039] COND TRUE p3_new == nomsg [L2041] node3____CPAchecker_TMP_0 = send3 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=2, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L2054] p3_new = node3____CPAchecker_TMP_0 [L2055] mode3 = 1 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=2, p2_old=-1, p3=0, p3_new=1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1976] p1_old = p1_new [L1977] p1_new = nomsg [L1978] p2_old = p2_new [L1979] p2_new = nomsg [L1980] p3_old = p3_new [L1981] p3_new = nomsg [L1983] int check__tmp; VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1984] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1986] COND FALSE !(((int)r1) >= 3) VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1992] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1995] COND TRUE ((int)r1) < 3 [L1997] check__tmp = 1 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L2027] __return_1296 = check__tmp [L2028] main__c1 = __return_1296 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L309] _Bool __tmp_2; [L310] __tmp_2 = main__c1 [L311] _Bool assert__arg; [L312] assert__arg = __tmp_2 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L313] COND FALSE !(assert__arg == 0) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1871] msg_t node1__m1; [L1872] node1__m1 = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1873] COND TRUE !(mode1 == 0) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1875] COND FALSE !(r1 == 255) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1883] r1 = r1 + 1 [L1884] node1__m1 = p3_old [L1885] p3_old = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1886] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1888] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L1895] COND FALSE !(((int)node1__m1) == ((int)id1)) [L1902] send1 = node1__m1 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L1910] mode1 = 0 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L1913] msg_t node2__m2; [L1914] node2__m2 = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L1915] COND TRUE !(mode2 == 0) [L1917] node2__m2 = p1_old [L1918] p1_old = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L1919] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L1921] COND FALSE !(((int)node2__m2) > ((int)id2)) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L1928] COND FALSE !(((int)node2__m2) == ((int)id2)) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L1942] mode2 = 0 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L1945] msg_t node3__m3; [L1946] node3__m3 = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L1947] COND TRUE !(mode3 == 0) [L1949] node3__m3 = p2_old [L1950] p2_old = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L1951] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L1953] COND TRUE ((int)node3__m3) > ((int)id3) [L1955] send3 = node3__m3 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1974] mode3 = 0 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1976] p1_old = p1_new [L1977] p1_new = nomsg [L1978] p2_old = p2_new [L1979] p2_new = nomsg [L1980] p3_old = p3_new [L1981] p3_new = nomsg [L1983] int check__tmp; VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1984] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1986] COND FALSE !(((int)r1) >= 3) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1992] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1995] COND TRUE ((int)r1) < 3 [L1997] check__tmp = 1 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L2027] __return_1296 = check__tmp [L2028] main__c1 = __return_1296 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L309] _Bool __tmp_2; [L310] __tmp_2 = main__c1 [L311] _Bool assert__arg; [L312] assert__arg = __tmp_2 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L313] COND FALSE !(assert__arg == 0) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=1, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1871] msg_t node1__m1; [L1872] node1__m1 = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1873] COND FALSE !(!(mode1 == 0)) [L2093] int node1____CPAchecker_TMP_0; VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L2094] COND TRUE send1 != nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L2096] COND TRUE p1_new == nomsg [L2098] node1____CPAchecker_TMP_0 = send1 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L2111] p1_new = node1____CPAchecker_TMP_0 [L2112] mode1 = 1 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=0, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1913] msg_t node2__m2; [L1914] node2__m2 = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1915] COND FALSE !(!(mode2 == 0)) [L2064] int node2____CPAchecker_TMP_0; VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L2065] COND TRUE send2 != nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L2067] COND TRUE p2_new == nomsg [L2069] node2____CPAchecker_TMP_0 = send2 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L2082] p2_new = node2____CPAchecker_TMP_0 [L2083] mode2 = 1 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=2, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1945] msg_t node3__m3; [L1946] node3__m3 = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=1, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=2, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1947] COND FALSE !(!(mode3 == 0)) [L2036] int node3____CPAchecker_TMP_0; VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=2, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L2037] COND TRUE send3 != nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=2, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L2039] COND TRUE p3_new == nomsg [L2041] node3____CPAchecker_TMP_0 = send3 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=2, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L2054] p3_new = node3____CPAchecker_TMP_0 [L2055] mode3 = 1 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=2, p2_old=-1, p3=0, p3_new=2, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1976] p1_old = p1_new [L1977] p1_new = nomsg [L1978] p2_old = p2_new [L1979] p2_new = nomsg [L1980] p3_old = p3_new [L1981] p3_new = nomsg [L1983] int check__tmp; VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1984] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1986] COND FALSE !(((int)r1) >= 3) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1992] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1995] COND TRUE ((int)r1) < 3 [L1997] check__tmp = 1 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L2027] __return_1296 = check__tmp [L2028] main__c1 = __return_1296 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L309] _Bool __tmp_2; [L310] __tmp_2 = main__c1 [L311] _Bool assert__arg; [L312] assert__arg = __tmp_2 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L313] COND FALSE !(assert__arg == 0) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1871] msg_t node1__m1; [L1872] node1__m1 = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1873] COND TRUE !(mode1 == 0) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1875] COND FALSE !(r1 == 255) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1883] r1 = r1 + 1 [L1884] node1__m1 = p3_old [L1885] p3_old = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1886] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1888] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L1895] COND TRUE ((int)node1__m1) == ((int)id1) [L1897] st1 = 1 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=0, st3=0] [L1910] mode1 = 0 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=0, st3=0] [L1913] msg_t node2__m2; [L1914] node2__m2 = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=-1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=0, st3=0] [L1915] COND TRUE !(mode2 == 0) [L1917] node2__m2 = p1_old [L1918] p1_old = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=0, st3=0] [L1919] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=0, st3=0] [L1921] COND FALSE !(((int)node2__m2) > ((int)id2)) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=0, st3=0] [L1928] COND TRUE ((int)node2__m2) == ((int)id2) [L1930] st2 = 1 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=1, st3=0] [L1942] mode2 = 0 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=1, st3=0] [L1945] msg_t node3__m3; [L1946] node3__m3 = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=-1, node3__m3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=1, st3=0] [L1947] COND TRUE !(mode3 == 0) [L1949] node3__m3 = p2_old [L1950] p2_old = nomsg VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=1, st3=0] [L1951] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=1, st3=0] [L1953] COND TRUE ((int)node3__m3) > ((int)id3) [L1955] send3 = node3__m3 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=1, st3=0] [L1974] mode3 = 0 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=1, st3=0] [L1976] p1_old = p1_new [L1977] p1_new = nomsg [L1978] p2_old = p2_new [L1979] p2_new = nomsg [L1980] p3_old = p3_new [L1981] p3_new = nomsg [L1983] int check__tmp; VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=1, st3=0] [L1984] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L2025] check__tmp = 0 VAL [__return_1035=0, __return_1146=0, __return_1296=1, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=1, st3=0] [L2027] __return_1296 = check__tmp [L2028] main__c1 = __return_1296 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=1, st3=0] [L309] _Bool __tmp_2; [L310] __tmp_2 = main__c1 [L311] _Bool assert__arg; [L312] assert__arg = __tmp_2 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=0, assert__arg=0, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=1, st3=0] [L313] COND TRUE assert__arg == 0 VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=0, assert__arg=0, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=1, st3=0] [L315] reach_error() VAL [__return_1035=0, __return_1146=0, __return_1296=0, __return_315=0, __return_329=0, __return_343=0, __return_357=0, __return_371=0, __return_385=0, __return_399=0, __return_413=1, __return_513=1, __return_593=0, __return_672=0, __return_766=0, __return_848=0, __return_942=0, __return_95=1, __return_main=0, __tmp_16=1, __tmp_1=1, __tmp_2=0, assert__arg=0, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=2, id2=1, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=1, node1____CPAchecker_TMP_0=2, node1__m1=-1, node1__m1=0, node1__m1=2, node2____CPAchecker_TMP_0=1, node2____CPAchecker_TMP_0=2, node2__m2=-1, node2__m2=1, node2__m2=2, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=2, node3__m3=-1, node3__m3=1, node3__m3=2, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=1, st3=0] - UnprovableResult [Line: 540]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 984]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1226]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1441]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1666]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 264 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 734.4s, OverallIterations: 61, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 617.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146704 SdHoareTripleChecker+Valid, 84.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 146704 mSDsluCounter, 218109 SdHoareTripleChecker+Invalid, 74.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 205095 mSDsCounter, 2458 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 128283 IncrementalHoareTripleChecker+Invalid, 130741 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2458 mSolverCounterUnsat, 13014 mSDtfsCounter, 128283 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11832 GetRequests, 5426 SyntacticMatches, 10 SemanticMatches, 6396 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100678 ImplicationChecksByTransitivity, 541.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96751occurred in iteration=39, InterpolantAutomatonStates: 5396, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.1s AutomataMinimizationTime, 60 MinimizatonAttempts, 1441023 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 86.7s InterpolantComputationTime, 8823 NumberOfCodeBlocks, 8823 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 11550 ConstructedInterpolants, 0 QuantifiedInterpolants, 197796 SizeOfPredicates, 276 NumberOfNonLiveVariables, 12463 ConjunctsInSsa, 771 ConjunctsInUnsatCore, 111 InterpolantComputations, 35 PerfectInterpolantSequences, 1583/3453 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! [2023-12-20 03:20:21,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...