./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eeee6bfce8612e4c7a8797e69f7e2696f4f49417b2ea41e83d66cf7e8ad61db4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 15:42:56,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 15:42:56,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 15:42:56,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 15:42:56,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 15:42:56,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 15:42:56,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 15:42:56,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 15:42:56,499 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 15:42:56,507 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 15:42:56,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 15:42:56,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 15:42:56,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 15:42:56,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 15:42:56,508 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 15:42:56,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 15:42:56,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 15:42:56,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 15:42:56,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 15:42:56,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 15:42:56,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 15:42:56,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 15:42:56,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 15:42:56,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 15:42:56,511 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 15:42:56,511 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 15:42:56,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 15:42:56,512 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 15:42:56,512 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 15:42:56,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 15:42:56,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 15:42:56,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 15:42:56,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 15:42:56,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 15:42:56,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 15:42:56,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 15:42:56,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 15:42:56,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 15:42:56,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 15:42:56,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 15:42:56,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 15:42:56,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 15:42:56,514 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eeee6bfce8612e4c7a8797e69f7e2696f4f49417b2ea41e83d66cf7e8ad61db4 [2024-11-18 15:42:56,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 15:42:56,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 15:42:56,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 15:42:56,712 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 15:42:56,716 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 15:42:56,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c [2024-11-18 15:42:58,112 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 15:42:58,662 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 15:42:58,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c [2024-11-18 15:42:58,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c632cec98/f853fb35e8ef45adb7b34d0ef03006f9/FLAG2643c0158 [2024-11-18 15:42:58,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c632cec98/f853fb35e8ef45adb7b34d0ef03006f9 [2024-11-18 15:42:58,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 15:42:58,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 15:42:58,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 15:42:58,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 15:42:58,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 15:42:58,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:42:58" (1/1) ... [2024-11-18 15:42:58,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f03b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:42:58, skipping insertion in model container [2024-11-18 15:42:58,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:42:58" (1/1) ... [2024-11-18 15:42:58,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 15:43:00,255 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[380593,380606] [2024-11-18 15:43:00,280 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[383339,383352] [2024-11-18 15:43:00,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 15:43:00,403 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 15:43:01,149 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[380593,380606] [2024-11-18 15:43:01,154 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[383339,383352] [2024-11-18 15:43:01,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 15:43:01,225 INFO L204 MainTranslator]: Completed translation [2024-11-18 15:43:01,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:43:01 WrapperNode [2024-11-18 15:43:01,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 15:43:01,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 15:43:01,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 15:43:01,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 15:43:01,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:43:01" (1/1) ... [2024-11-18 15:43:01,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:43:01" (1/1) ... [2024-11-18 15:43:01,528 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12579 [2024-11-18 15:43:01,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 15:43:01,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 15:43:01,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 15:43:01,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 15:43:01,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:43:01" (1/1) ... [2024-11-18 15:43:01,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:43:01" (1/1) ... [2024-11-18 15:43:01,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:43:01" (1/1) ... [2024-11-18 15:43:01,660 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]. [2024-11-18 15:43:01,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:43:01" (1/1) ... [2024-11-18 15:43:01,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:43:01" (1/1) ... [2024-11-18 15:43:01,899 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:43:01" (1/1) ... [2024-11-18 15:43:01,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:43:01" (1/1) ... [2024-11-18 15:43:01,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:43:01" (1/1) ... [2024-11-18 15:43:02,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:43:01" (1/1) ... [2024-11-18 15:43:02,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 15:43:02,111 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 15:43:02,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 15:43:02,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 15:43:02,112 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:43:01" (1/1) ... [2024-11-18 15:43:02,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 15:43:02,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:43:02,141 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) [2024-11-18 15:43:02,151 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 [2024-11-18 15:43:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 15:43:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-18 15:43:02,184 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-18 15:43:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-18 15:43:02,184 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-18 15:43:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-18 15:43:02,185 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-18 15:43:02,185 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-18 15:43:02,185 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-18 15:43:02,185 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-18 15:43:02,185 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-18 15:43:02,185 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-18 15:43:02,185 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-18 15:43:02,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 15:43:02,185 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-18 15:43:02,185 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-18 15:43:02,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 15:43:02,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 15:43:02,266 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 15:43:02,268 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 15:43:08,672 INFO L? ?]: Removed 1693 outVars from TransFormulas that were not future-live. [2024-11-18 15:43:08,672 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 15:43:08,727 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 15:43:08,728 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-18 15:43:08,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:43:08 BoogieIcfgContainer [2024-11-18 15:43:08,729 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 15:43:08,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 15:43:08,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 15:43:08,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 15:43:08,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:42:58" (1/3) ... [2024-11-18 15:43:08,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254bca19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:43:08, skipping insertion in model container [2024-11-18 15:43:08,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:43:01" (2/3) ... [2024-11-18 15:43:08,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254bca19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:43:08, skipping insertion in model container [2024-11-18 15:43:08,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:43:08" (3/3) ... [2024-11-18 15:43:08,742 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.01.cil-2.c [2024-11-18 15:43:08,759 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 15:43:08,760 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-18 15:43:08,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 15:43:08,856 INFO L333 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, 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;@263f57a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 15:43:08,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-18 15:43:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 2300 states, 2273 states have (on average 1.8583369995600527) internal successors, (4224), 2278 states have internal predecessors, (4224), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-18 15:43:08,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-18 15:43:08,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:43:08,890 INFO L215 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] [2024-11-18 15:43:08,890 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:43:08,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:43:08,894 INFO L85 PathProgramCache]: Analyzing trace with hash -628171245, now seen corresponding path program 1 times [2024-11-18 15:43:08,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:43:08,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031639082] [2024-11-18 15:43:08,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:08,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:43:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:43:09,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:43:09,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031639082] [2024-11-18 15:43:09,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031639082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:43:09,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:43:09,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 15:43:09,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593447899] [2024-11-18 15:43:09,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:43:09,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 15:43:09,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:43:09,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 15:43:09,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 15:43:09,284 INFO L87 Difference]: Start difference. First operand has 2300 states, 2273 states have (on average 1.8583369995600527) internal successors, (4224), 2278 states have internal predecessors, (4224), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:43:09,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:43:09,780 INFO L93 Difference]: Finished difference Result 4699 states and 8671 transitions. [2024-11-18 15:43:09,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 15:43:09,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-18 15:43:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:43:09,810 INFO L225 Difference]: With dead ends: 4699 [2024-11-18 15:43:09,810 INFO L226 Difference]: Without dead ends: 2338 [2024-11-18 15:43:09,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:43:09,820 INFO L432 NwaCegarLoop]: 4151 mSDtfsCounter, 4257 mSDsluCounter, 8352 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4266 SdHoareTripleChecker+Valid, 12503 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 15:43:09,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4266 Valid, 12503 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 15:43:09,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2024-11-18 15:43:09,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2329. [2024-11-18 15:43:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 2287 states have (on average 1.8369042413642327) internal successors, (4201), 2291 states have internal predecessors, (4201), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2024-11-18 15:43:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 4254 transitions. [2024-11-18 15:43:09,929 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 4254 transitions. Word has length 58 [2024-11-18 15:43:09,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:43:09,930 INFO L471 AbstractCegarLoop]: Abstraction has 2329 states and 4254 transitions. [2024-11-18 15:43:09,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:43:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 4254 transitions. [2024-11-18 15:43:09,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-18 15:43:09,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:43:09,932 INFO L215 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] [2024-11-18 15:43:09,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 15:43:09,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:43:09,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:43:09,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1166087951, now seen corresponding path program 1 times [2024-11-18 15:43:09,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:43:09,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479153576] [2024-11-18 15:43:09,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:09,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:43:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:43:10,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:43:10,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479153576] [2024-11-18 15:43:10,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479153576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:43:10,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:43:10,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 15:43:10,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6525935] [2024-11-18 15:43:10,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:43:10,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 15:43:10,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:43:10,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 15:43:10,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:43:10,076 INFO L87 Difference]: Start difference. First operand 2329 states and 4254 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:43:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:43:10,459 INFO L93 Difference]: Finished difference Result 2645 states and 4705 transitions. [2024-11-18 15:43:10,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 15:43:10,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-18 15:43:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:43:10,469 INFO L225 Difference]: With dead ends: 2645 [2024-11-18 15:43:10,469 INFO L226 Difference]: Without dead ends: 2446 [2024-11-18 15:43:10,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 15:43:10,472 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4177 mSDsluCounter, 12432 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4186 SdHoareTripleChecker+Valid, 16590 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 15:43:10,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4186 Valid, 16590 Invalid, 394 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 15:43:10,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2024-11-18 15:43:10,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2421. [2024-11-18 15:43:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2421 states, 2362 states have (on average 1.8238780694326842) internal successors, (4308), 2367 states have internal predecessors, (4308), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (39), 36 states have call predecessors, (39), 35 states have call successors, (39) [2024-11-18 15:43:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 4384 transitions. [2024-11-18 15:43:10,527 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 4384 transitions. Word has length 58 [2024-11-18 15:43:10,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:43:10,527 INFO L471 AbstractCegarLoop]: Abstraction has 2421 states and 4384 transitions. [2024-11-18 15:43:10,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:43:10,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 4384 transitions. [2024-11-18 15:43:10,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-18 15:43:10,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:43:10,529 INFO L215 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] [2024-11-18 15:43:10,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 15:43:10,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:43:10,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:43:10,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2059574289, now seen corresponding path program 1 times [2024-11-18 15:43:10,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:43:10,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391742227] [2024-11-18 15:43:10,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:10,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:43:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:43:10,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:43:10,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391742227] [2024-11-18 15:43:10,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391742227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:43:10,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:43:10,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 15:43:10,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621921136] [2024-11-18 15:43:10,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:43:10,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 15:43:10,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:43:10,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 15:43:10,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:43:10,619 INFO L87 Difference]: Start difference. First operand 2421 states and 4384 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:43:10,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:43:10,976 INFO L93 Difference]: Finished difference Result 2949 states and 5135 transitions. [2024-11-18 15:43:10,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 15:43:10,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-18 15:43:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:43:10,986 INFO L225 Difference]: With dead ends: 2949 [2024-11-18 15:43:10,986 INFO L226 Difference]: Without dead ends: 2658 [2024-11-18 15:43:10,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 15:43:10,988 INFO L432 NwaCegarLoop]: 4152 mSDtfsCounter, 4216 mSDsluCounter, 12409 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4227 SdHoareTripleChecker+Valid, 16561 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 15:43:10,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4227 Valid, 16561 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 15:43:10,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2024-11-18 15:43:11,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2604. [2024-11-18 15:43:11,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2604 states, 2511 states have (on average 1.8004778972520907) internal successors, (4521), 2520 states have internal predecessors, (4521), 55 states have call successors, (55), 31 states have call predecessors, (55), 36 states have return successors, (69), 56 states have call predecessors, (69), 53 states have call successors, (69) [2024-11-18 15:43:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2604 states to 2604 states and 4645 transitions. [2024-11-18 15:43:11,146 INFO L78 Accepts]: Start accepts. Automaton has 2604 states and 4645 transitions. Word has length 58 [2024-11-18 15:43:11,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:43:11,146 INFO L471 AbstractCegarLoop]: Abstraction has 2604 states and 4645 transitions. [2024-11-18 15:43:11,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:43:11,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2604 states and 4645 transitions. [2024-11-18 15:43:11,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-18 15:43:11,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:43:11,152 INFO L215 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] [2024-11-18 15:43:11,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 15:43:11,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:43:11,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:43:11,153 INFO L85 PathProgramCache]: Analyzing trace with hash 10186447, now seen corresponding path program 1 times [2024-11-18 15:43:11,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:43:11,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931614534] [2024-11-18 15:43:11,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:11,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:43:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:11,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:43:11,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:43:11,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931614534] [2024-11-18 15:43:11,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931614534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:43:11,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:43:11,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 15:43:11,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851633234] [2024-11-18 15:43:11,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:43:11,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 15:43:11,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:43:11,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 15:43:11,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:43:11,285 INFO L87 Difference]: Start difference. First operand 2604 states and 4645 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:43:11,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:43:11,834 INFO L93 Difference]: Finished difference Result 3488 states and 5914 transitions. [2024-11-18 15:43:11,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 15:43:11,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-18 15:43:11,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:43:11,847 INFO L225 Difference]: With dead ends: 3488 [2024-11-18 15:43:11,847 INFO L226 Difference]: Without dead ends: 3014 [2024-11-18 15:43:11,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 15:43:11,855 INFO L432 NwaCegarLoop]: 4146 mSDtfsCounter, 4169 mSDsluCounter, 12399 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4177 SdHoareTripleChecker+Valid, 16545 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 15:43:11,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4177 Valid, 16545 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 15:43:11,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2024-11-18 15:43:12,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 2927. [2024-11-18 15:43:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2766 states have (on average 1.759580621836587) internal successors, (4867), 2789 states have internal predecessors, (4867), 87 states have call successors, (87), 53 states have call predecessors, (87), 72 states have return successors, (149), 92 states have call predecessors, (149), 85 states have call successors, (149) [2024-11-18 15:43:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 5103 transitions. [2024-11-18 15:43:12,071 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 5103 transitions. Word has length 58 [2024-11-18 15:43:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:43:12,073 INFO L471 AbstractCegarLoop]: Abstraction has 2927 states and 5103 transitions. [2024-11-18 15:43:12,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:43:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 5103 transitions. [2024-11-18 15:43:12,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-18 15:43:12,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:43:12,075 INFO L215 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] [2024-11-18 15:43:12,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 15:43:12,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:43:12,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:43:12,076 INFO L85 PathProgramCache]: Analyzing trace with hash -887206831, now seen corresponding path program 1 times [2024-11-18 15:43:12,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:43:12,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703925428] [2024-11-18 15:43:12,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:12,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:43:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:43:12,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:43:12,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703925428] [2024-11-18 15:43:12,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703925428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:43:12,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:43:12,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 15:43:12,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640742791] [2024-11-18 15:43:12,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:43:12,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 15:43:12,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:43:12,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 15:43:12,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 15:43:12,120 INFO L87 Difference]: Start difference. First operand 2927 states and 5103 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:43:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:43:12,275 INFO L93 Difference]: Finished difference Result 4160 states and 6876 transitions. [2024-11-18 15:43:12,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 15:43:12,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-18 15:43:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:43:12,286 INFO L225 Difference]: With dead ends: 4160 [2024-11-18 15:43:12,286 INFO L226 Difference]: Without dead ends: 3364 [2024-11-18 15:43:12,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 15:43:12,289 INFO L432 NwaCegarLoop]: 4227 mSDtfsCounter, 4208 mSDsluCounter, 4170 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4208 SdHoareTripleChecker+Valid, 8397 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 15:43:12,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4208 Valid, 8397 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 15:43:12,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2024-11-18 15:43:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 3341. [2024-11-18 15:43:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3341 states, 3095 states have (on average 1.7101777059773828) internal successors, (5293), 3129 states have internal predecessors, (5293), 136 states have call successors, (136), 83 states have call predecessors, (136), 108 states have return successors, (211), 136 states have call predecessors, (211), 134 states have call successors, (211) [2024-11-18 15:43:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3341 states to 3341 states and 5640 transitions. [2024-11-18 15:43:12,365 INFO L78 Accepts]: Start accepts. Automaton has 3341 states and 5640 transitions. Word has length 58 [2024-11-18 15:43:12,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:43:12,366 INFO L471 AbstractCegarLoop]: Abstraction has 3341 states and 5640 transitions. [2024-11-18 15:43:12,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:43:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3341 states and 5640 transitions. [2024-11-18 15:43:12,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-18 15:43:12,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:43:12,368 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-18 15:43:12,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 15:43:12,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:43:12,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:43:12,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1808175973, now seen corresponding path program 1 times [2024-11-18 15:43:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:43:12,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453912687] [2024-11-18 15:43:12,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:12,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:43:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 15:43:12,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:43:12,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453912687] [2024-11-18 15:43:12,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453912687] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:43:12,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973195882] [2024-11-18 15:43:12,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:12,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:43:12,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:43:12,426 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) [2024-11-18 15:43:12,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 15:43:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:12,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 15:43:12,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:43:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-18 15:43:12,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:43:12,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973195882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:43:12,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:43:12,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 15:43:12,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790681993] [2024-11-18 15:43:12,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:43:12,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:43:12,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:43:12,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:43:12,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:43:12,548 INFO L87 Difference]: Start difference. First operand 3341 states and 5640 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-18 15:43:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:43:12,692 INFO L93 Difference]: Finished difference Result 5640 states and 8870 transitions. [2024-11-18 15:43:12,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:43:12,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2024-11-18 15:43:12,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:43:12,732 INFO L225 Difference]: With dead ends: 5640 [2024-11-18 15:43:12,732 INFO L226 Difference]: Without dead ends: 4431 [2024-11-18 15:43:12,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:43:12,742 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 115 mSDsluCounter, 4109 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 8341 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:43:12,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 8341 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:43:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4431 states. [2024-11-18 15:43:12,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4431 to 4431. [2024-11-18 15:43:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4431 states, 3962 states have (on average 1.627208480565371) internal successors, (6447), 4023 states have internal predecessors, (6447), 255 states have call successors, (255), 161 states have call predecessors, (255), 212 states have return successors, (440), 262 states have call predecessors, (440), 253 states have call successors, (440) [2024-11-18 15:43:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4431 states to 4431 states and 7142 transitions. [2024-11-18 15:43:12,869 INFO L78 Accepts]: Start accepts. Automaton has 4431 states and 7142 transitions. Word has length 94 [2024-11-18 15:43:12,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:43:12,869 INFO L471 AbstractCegarLoop]: Abstraction has 4431 states and 7142 transitions. [2024-11-18 15:43:12,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-18 15:43:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4431 states and 7142 transitions. [2024-11-18 15:43:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-18 15:43:12,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:43:12,874 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-18 15:43:12,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 15:43:13,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-18 15:43:13,079 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:43:13,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:43:13,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2088529656, now seen corresponding path program 1 times [2024-11-18 15:43:13,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:43:13,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567249276] [2024-11-18 15:43:13,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:13,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:43:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-18 15:43:13,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:43:13,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567249276] [2024-11-18 15:43:13,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567249276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:43:13,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572059878] [2024-11-18 15:43:13,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:13,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:43:13,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:43:13,143 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) [2024-11-18 15:43:13,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 15:43:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:13,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 15:43:13,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:43:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-18 15:43:13,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:43:13,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572059878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:43:13,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:43:13,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-18 15:43:13,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979563436] [2024-11-18 15:43:13,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:43:13,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:43:13,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:43:13,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:43:13,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:43:13,421 INFO L87 Difference]: Start difference. First operand 4431 states and 7142 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-18 15:43:13,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:43:13,588 INFO L93 Difference]: Finished difference Result 8887 states and 13323 transitions. [2024-11-18 15:43:13,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:43:13,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 121 [2024-11-18 15:43:13,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:43:13,613 INFO L225 Difference]: With dead ends: 8887 [2024-11-18 15:43:13,613 INFO L226 Difference]: Without dead ends: 6591 [2024-11-18 15:43:13,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:43:13,621 INFO L432 NwaCegarLoop]: 4131 mSDtfsCounter, 4038 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4038 SdHoareTripleChecker+Valid, 4264 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 [2024-11-18 15:43:13,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4038 Valid, 4264 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:43:13,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6591 states. [2024-11-18 15:43:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6591 to 6531. [2024-11-18 15:43:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6531 states, 5640 states have (on average 1.5398936170212767) internal successors, (8685), 5758 states have internal predecessors, (8685), 475 states have call successors, (475), 311 states have call predecessors, (475), 414 states have return successors, (816), 477 states have call predecessors, (816), 473 states have call successors, (816) [2024-11-18 15:43:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6531 states to 6531 states and 9976 transitions. [2024-11-18 15:43:13,826 INFO L78 Accepts]: Start accepts. Automaton has 6531 states and 9976 transitions. Word has length 121 [2024-11-18 15:43:13,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:43:13,827 INFO L471 AbstractCegarLoop]: Abstraction has 6531 states and 9976 transitions. [2024-11-18 15:43:13,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-18 15:43:13,827 INFO L276 IsEmpty]: Start isEmpty. Operand 6531 states and 9976 transitions. [2024-11-18 15:43:13,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-18 15:43:13,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:43:13,835 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-18 15:43:13,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 15:43:14,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-18 15:43:14,040 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:43:14,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:43:14,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1607628711, now seen corresponding path program 1 times [2024-11-18 15:43:14,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:43:14,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775817440] [2024-11-18 15:43:14,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:14,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:43:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-18 15:43:14,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:43:14,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775817440] [2024-11-18 15:43:14,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775817440] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:43:14,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191138752] [2024-11-18 15:43:14,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:14,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:43:14,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:43:14,099 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) [2024-11-18 15:43:14,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 15:43:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:14,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 15:43:14,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:43:14,210 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-18 15:43:14,211 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:43:14,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191138752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:43:14,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:43:14,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 15:43:14,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988899356] [2024-11-18 15:43:14,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:43:14,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:43:14,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:43:14,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:43:14,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:43:14,213 INFO L87 Difference]: Start difference. First operand 6531 states and 9976 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-18 15:43:14,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:43:14,739 INFO L93 Difference]: Finished difference Result 9933 states and 14621 transitions. [2024-11-18 15:43:14,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:43:14,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 138 [2024-11-18 15:43:14,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:43:14,777 INFO L225 Difference]: With dead ends: 9933 [2024-11-18 15:43:14,778 INFO L226 Difference]: Without dead ends: 6859 [2024-11-18 15:43:14,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:43:14,796 INFO L432 NwaCegarLoop]: 4136 mSDtfsCounter, 4059 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4059 SdHoareTripleChecker+Valid, 4277 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:43:14,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4059 Valid, 4277 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:43:14,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6859 states. [2024-11-18 15:43:15,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6859 to 6821. [2024-11-18 15:43:15,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6821 states, 5898 states have (on average 1.513903017972194) internal successors, (8929), 6016 states have internal predecessors, (8929), 481 states have call successors, (481), 337 states have call predecessors, (481), 440 states have return successors, (848), 483 states have call predecessors, (848), 479 states have call successors, (848) [2024-11-18 15:43:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6821 states to 6821 states and 10258 transitions. [2024-11-18 15:43:15,226 INFO L78 Accepts]: Start accepts. Automaton has 6821 states and 10258 transitions. Word has length 138 [2024-11-18 15:43:15,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:43:15,230 INFO L471 AbstractCegarLoop]: Abstraction has 6821 states and 10258 transitions. [2024-11-18 15:43:15,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-18 15:43:15,231 INFO L276 IsEmpty]: Start isEmpty. Operand 6821 states and 10258 transitions. [2024-11-18 15:43:15,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-18 15:43:15,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:43:15,244 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-18 15:43:15,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 15:43:15,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:43:15,445 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:43:15,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:43:15,446 INFO L85 PathProgramCache]: Analyzing trace with hash -247267866, now seen corresponding path program 1 times [2024-11-18 15:43:15,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:43:15,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050353701] [2024-11-18 15:43:15,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:15,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:43:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:15,514 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-18 15:43:15,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:43:15,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050353701] [2024-11-18 15:43:15,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050353701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:43:15,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033631036] [2024-11-18 15:43:15,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:15,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:43:15,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:43:15,518 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) [2024-11-18 15:43:15,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 15:43:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:15,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 15:43:15,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:43:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-18 15:43:15,629 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:43:15,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033631036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:43:15,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:43:15,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 15:43:15,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444601188] [2024-11-18 15:43:15,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:43:15,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:43:15,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:43:15,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:43:15,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:43:15,631 INFO L87 Difference]: Start difference. First operand 6821 states and 10258 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-18 15:43:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:43:16,105 INFO L93 Difference]: Finished difference Result 15833 states and 22512 transitions. [2024-11-18 15:43:16,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:43:16,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 139 [2024-11-18 15:43:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:43:16,204 INFO L225 Difference]: With dead ends: 15833 [2024-11-18 15:43:16,204 INFO L226 Difference]: Without dead ends: 11149 [2024-11-18 15:43:16,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:43:16,234 INFO L432 NwaCegarLoop]: 4226 mSDtfsCounter, 126 mSDsluCounter, 4106 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 8332 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:43:16,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 8332 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:43:16,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11149 states. [2024-11-18 15:43:16,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11149 to 11133. [2024-11-18 15:43:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11133 states, 9340 states have (on average 1.4279443254817987) internal successors, (13337), 9574 states have internal predecessors, (13337), 927 states have call successors, (927), 657 states have call predecessors, (927), 864 states have return successors, (1806), 933 states have call predecessors, (1806), 925 states have call successors, (1806) [2024-11-18 15:43:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11133 states to 11133 states and 16070 transitions. [2024-11-18 15:43:16,953 INFO L78 Accepts]: Start accepts. Automaton has 11133 states and 16070 transitions. Word has length 139 [2024-11-18 15:43:16,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:43:16,954 INFO L471 AbstractCegarLoop]: Abstraction has 11133 states and 16070 transitions. [2024-11-18 15:43:16,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-18 15:43:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 11133 states and 16070 transitions. [2024-11-18 15:43:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-18 15:43:16,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:43:16,975 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-18 15:43:16,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-18 15:43:17,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:43:17,176 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:43:17,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:43:17,177 INFO L85 PathProgramCache]: Analyzing trace with hash -795398658, now seen corresponding path program 1 times [2024-11-18 15:43:17,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:43:17,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878842207] [2024-11-18 15:43:17,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:17,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:43:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 15:43:17,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:43:17,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878842207] [2024-11-18 15:43:17,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878842207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:43:17,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615464832] [2024-11-18 15:43:17,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:17,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:43:17,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:43:17,247 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) [2024-11-18 15:43:17,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 15:43:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:17,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 15:43:17,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:43:17,378 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 15:43:17,379 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:43:17,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615464832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:43:17,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:43:17,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 15:43:17,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775133803] [2024-11-18 15:43:17,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:43:17,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:43:17,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:43:17,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:43:17,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:43:17,381 INFO L87 Difference]: Start difference. First operand 11133 states and 16070 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-18 15:43:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:43:17,863 INFO L93 Difference]: Finished difference Result 15807 states and 22674 transitions. [2024-11-18 15:43:17,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:43:17,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 140 [2024-11-18 15:43:17,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:43:17,913 INFO L225 Difference]: With dead ends: 15807 [2024-11-18 15:43:17,913 INFO L226 Difference]: Without dead ends: 11169 [2024-11-18 15:43:17,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:43:17,929 INFO L432 NwaCegarLoop]: 4195 mSDtfsCounter, 111 mSDsluCounter, 4100 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 8295 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:43:17,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 8295 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:43:17,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11169 states. [2024-11-18 15:43:18,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11169 to 11109. [2024-11-18 15:43:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11109 states, 9316 states have (on average 1.4148776298840704) internal successors, (13181), 9550 states have internal predecessors, (13181), 927 states have call successors, (927), 657 states have call predecessors, (927), 864 states have return successors, (1806), 933 states have call predecessors, (1806), 925 states have call successors, (1806) [2024-11-18 15:43:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11109 states to 11109 states and 15914 transitions. [2024-11-18 15:43:18,523 INFO L78 Accepts]: Start accepts. Automaton has 11109 states and 15914 transitions. Word has length 140 [2024-11-18 15:43:18,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:43:18,524 INFO L471 AbstractCegarLoop]: Abstraction has 11109 states and 15914 transitions. [2024-11-18 15:43:18,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-18 15:43:18,524 INFO L276 IsEmpty]: Start isEmpty. Operand 11109 states and 15914 transitions. [2024-11-18 15:43:18,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-18 15:43:18,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:43:18,542 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-18 15:43:18,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 15:43:18,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-18 15:43:18,749 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:43:18,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:43:18,749 INFO L85 PathProgramCache]: Analyzing trace with hash -746004992, now seen corresponding path program 1 times [2024-11-18 15:43:18,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:43:18,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438527330] [2024-11-18 15:43:18,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:18,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:43:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 15:43:18,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:43:18,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438527330] [2024-11-18 15:43:18,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438527330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:43:18,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264463261] [2024-11-18 15:43:18,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:18,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:43:18,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:43:18,812 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) [2024-11-18 15:43:18,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 15:43:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:18,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 15:43:18,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:43:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-18 15:43:18,922 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:43:18,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264463261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:43:18,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:43:18,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 15:43:18,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522579325] [2024-11-18 15:43:18,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:43:18,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:43:18,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:43:18,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:43:18,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:43:18,923 INFO L87 Difference]: Start difference. First operand 11109 states and 15914 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-18 15:43:19,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:43:19,345 INFO L93 Difference]: Finished difference Result 17681 states and 24964 transitions. [2024-11-18 15:43:19,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:43:19,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 140 [2024-11-18 15:43:19,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:43:19,385 INFO L225 Difference]: With dead ends: 17681 [2024-11-18 15:43:19,385 INFO L226 Difference]: Without dead ends: 9769 [2024-11-18 15:43:19,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:43:19,408 INFO L432 NwaCegarLoop]: 4113 mSDtfsCounter, 4089 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4089 SdHoareTripleChecker+Valid, 4137 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:43:19,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4089 Valid, 4137 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:43:19,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9769 states. [2024-11-18 15:43:19,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9769 to 9337. [2024-11-18 15:43:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9337 states, 7950 states have (on average 1.4026415094339624) internal successors, (11151), 8072 states have internal predecessors, (11151), 755 states have call successors, (755), 535 states have call predecessors, (755), 630 states have return successors, (1162), 745 states have call predecessors, (1162), 753 states have call successors, (1162) [2024-11-18 15:43:19,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9337 states to 9337 states and 13068 transitions. [2024-11-18 15:43:19,886 INFO L78 Accepts]: Start accepts. Automaton has 9337 states and 13068 transitions. Word has length 140 [2024-11-18 15:43:19,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:43:19,887 INFO L471 AbstractCegarLoop]: Abstraction has 9337 states and 13068 transitions. [2024-11-18 15:43:19,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-18 15:43:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 9337 states and 13068 transitions. [2024-11-18 15:43:19,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-18 15:43:19,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:43:19,899 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-18 15:43:19,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 15:43:20,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:43:20,101 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:43:20,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:43:20,101 INFO L85 PathProgramCache]: Analyzing trace with hash 330406047, now seen corresponding path program 1 times [2024-11-18 15:43:20,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:43:20,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186569831] [2024-11-18 15:43:20,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:20,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:43:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 15:43:20,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:43:20,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186569831] [2024-11-18 15:43:20,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186569831] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:43:20,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820666072] [2024-11-18 15:43:20,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:20,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:43:20,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:43:20,166 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) [2024-11-18 15:43:20,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-18 15:43:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:20,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 15:43:20,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:43:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-18 15:43:20,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:43:20,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820666072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:43:20,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:43:20,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-18 15:43:20,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724898080] [2024-11-18 15:43:20,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:43:20,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 15:43:20,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:43:20,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 15:43:20,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 15:43:20,345 INFO L87 Difference]: Start difference. First operand 9337 states and 13068 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-18 15:43:20,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:43:20,653 INFO L93 Difference]: Finished difference Result 12117 states and 16715 transitions. [2024-11-18 15:43:20,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 15:43:20,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2024-11-18 15:43:20,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:43:20,676 INFO L225 Difference]: With dead ends: 12117 [2024-11-18 15:43:20,676 INFO L226 Difference]: Without dead ends: 7421 [2024-11-18 15:43:20,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-18 15:43:20,688 INFO L432 NwaCegarLoop]: 4059 mSDtfsCounter, 4108 mSDsluCounter, 8073 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4116 SdHoareTripleChecker+Valid, 12132 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 15:43:20,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4116 Valid, 12132 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 15:43:20,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7421 states. [2024-11-18 15:43:20,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7421 to 7397. [2024-11-18 15:43:20,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7397 states, 6400 states have (on average 1.42515625) internal successors, (9121), 6454 states have internal predecessors, (9121), 567 states have call successors, (567), 397 states have call predecessors, (567), 428 states have return successors, (766), 553 states have call predecessors, (766), 565 states have call successors, (766) [2024-11-18 15:43:20,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7397 states to 7397 states and 10454 transitions. [2024-11-18 15:43:20,927 INFO L78 Accepts]: Start accepts. Automaton has 7397 states and 10454 transitions. Word has length 141 [2024-11-18 15:43:20,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:43:20,927 INFO L471 AbstractCegarLoop]: Abstraction has 7397 states and 10454 transitions. [2024-11-18 15:43:20,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-18 15:43:20,928 INFO L276 IsEmpty]: Start isEmpty. Operand 7397 states and 10454 transitions. [2024-11-18 15:43:20,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-18 15:43:20,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:43:20,935 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-18 15:43:20,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-18 15:43:21,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:43:21,136 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:43:21,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:43:21,136 INFO L85 PathProgramCache]: Analyzing trace with hash -292875555, now seen corresponding path program 1 times [2024-11-18 15:43:21,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:43:21,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5030589] [2024-11-18 15:43:21,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:21,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:43:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:21,203 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 15:43:21,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:43:21,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5030589] [2024-11-18 15:43:21,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5030589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:43:21,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40049220] [2024-11-18 15:43:21,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:21,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:43:21,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:43:21,205 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) [2024-11-18 15:43:21,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-18 15:43:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:21,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 15:43:21,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:43:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-18 15:43:21,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:43:21,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40049220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:43:21,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:43:21,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-18 15:43:21,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910805976] [2024-11-18 15:43:21,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:43:21,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 15:43:21,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:43:21,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 15:43:21,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 15:43:21,366 INFO L87 Difference]: Start difference. First operand 7397 states and 10454 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-18 15:43:21,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:43:21,840 INFO L93 Difference]: Finished difference Result 11699 states and 15964 transitions. [2024-11-18 15:43:21,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 15:43:21,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2024-11-18 15:43:21,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:43:21,868 INFO L225 Difference]: With dead ends: 11699 [2024-11-18 15:43:21,869 INFO L226 Difference]: Without dead ends: 7025 [2024-11-18 15:43:21,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-18 15:43:21,882 INFO L432 NwaCegarLoop]: 4057 mSDtfsCounter, 4146 mSDsluCounter, 8068 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4155 SdHoareTripleChecker+Valid, 12125 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 15:43:21,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4155 Valid, 12125 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 15:43:21,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7025 states. [2024-11-18 15:43:22,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7025 to 5263. [2024-11-18 15:43:22,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5263 states, 4686 states have (on average 1.479726845924029) internal successors, (6934), 4716 states have internal predecessors, (6934), 331 states have call successors, (331), 229 states have call predecessors, (331), 244 states have return successors, (439), 321 states have call predecessors, (439), 329 states have call successors, (439) [2024-11-18 15:43:22,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5263 states to 5263 states and 7704 transitions. [2024-11-18 15:43:22,205 INFO L78 Accepts]: Start accepts. Automaton has 5263 states and 7704 transitions. Word has length 141 [2024-11-18 15:43:22,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:43:22,206 INFO L471 AbstractCegarLoop]: Abstraction has 5263 states and 7704 transitions. [2024-11-18 15:43:22,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-18 15:43:22,206 INFO L276 IsEmpty]: Start isEmpty. Operand 5263 states and 7704 transitions. [2024-11-18 15:43:22,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-18 15:43:22,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:43:22,209 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-18 15:43:22,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-18 15:43:22,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-18 15:43:22,410 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:43:22,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:43:22,410 INFO L85 PathProgramCache]: Analyzing trace with hash -174434081, now seen corresponding path program 1 times [2024-11-18 15:43:22,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:43:22,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140434433] [2024-11-18 15:43:22,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:22,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:43:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 15:43:22,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:43:22,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140434433] [2024-11-18 15:43:22,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140434433] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:43:22,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645720152] [2024-11-18 15:43:22,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:22,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:43:22,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:43:22,491 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) [2024-11-18 15:43:22,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-18 15:43:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:22,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 15:43:22,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:43:22,687 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 57 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-18 15:43:22,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 15:43:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 15:43:22,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645720152] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 15:43:22,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 15:43:22,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2024-11-18 15:43:22,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485271607] [2024-11-18 15:43:22,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:43:22,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 15:43:22,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:43:22,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 15:43:22,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 15:43:22,803 INFO L87 Difference]: Start difference. First operand 5263 states and 7704 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-18 15:43:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:43:23,247 INFO L93 Difference]: Finished difference Result 9208 states and 12352 transitions. [2024-11-18 15:43:23,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 15:43:23,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 141 [2024-11-18 15:43:23,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:43:23,284 INFO L225 Difference]: With dead ends: 9208 [2024-11-18 15:43:23,288 INFO L226 Difference]: Without dead ends: 7712 [2024-11-18 15:43:23,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 15:43:23,299 INFO L432 NwaCegarLoop]: 4207 mSDtfsCounter, 4184 mSDsluCounter, 4159 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4184 SdHoareTripleChecker+Valid, 8366 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 15:43:23,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4184 Valid, 8366 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 15:43:23,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7712 states. [2024-11-18 15:43:23,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7712 to 6410. [2024-11-18 15:43:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6410 states, 5625 states have (on average 1.4195555555555555) internal successors, (7985), 5659 states have internal predecessors, (7985), 451 states have call successors, (451), 309 states have call predecessors, (451), 332 states have return successors, (597), 445 states have call predecessors, (597), 449 states have call successors, (597) [2024-11-18 15:43:23,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6410 states to 6410 states and 9033 transitions. [2024-11-18 15:43:23,567 INFO L78 Accepts]: Start accepts. Automaton has 6410 states and 9033 transitions. Word has length 141 [2024-11-18 15:43:23,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:43:23,567 INFO L471 AbstractCegarLoop]: Abstraction has 6410 states and 9033 transitions. [2024-11-18 15:43:23,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-18 15:43:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 6410 states and 9033 transitions. [2024-11-18 15:43:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-18 15:43:23,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:43:23,574 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-18 15:43:23,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-18 15:43:23,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-18 15:43:23,775 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:43:23,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:43:23,776 INFO L85 PathProgramCache]: Analyzing trace with hash 132066951, now seen corresponding path program 1 times [2024-11-18 15:43:23,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:43:23,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000885228] [2024-11-18 15:43:23,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:23,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:43:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 15:43:23,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:43:23,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000885228] [2024-11-18 15:43:23,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000885228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:43:23,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048052143] [2024-11-18 15:43:23,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:23,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:43:23,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:43:23,837 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) [2024-11-18 15:43:23,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-18 15:43:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:23,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 15:43:23,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:43:23,929 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-18 15:43:23,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:43:23,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048052143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:43:23,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:43:23,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 15:43:23,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426882783] [2024-11-18 15:43:23,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:43:23,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:43:23,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:43:23,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:43:23,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:43:23,932 INFO L87 Difference]: Start difference. First operand 6410 states and 9033 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 15:43:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:43:24,128 INFO L93 Difference]: Finished difference Result 8469 states and 11470 transitions. [2024-11-18 15:43:24,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:43:24,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 145 [2024-11-18 15:43:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:43:24,145 INFO L225 Difference]: With dead ends: 8469 [2024-11-18 15:43:24,145 INFO L226 Difference]: Without dead ends: 6414 [2024-11-18 15:43:24,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:43:24,152 INFO L432 NwaCegarLoop]: 4105 mSDtfsCounter, 0 mSDsluCounter, 4094 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8199 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:43:24,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8199 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:43:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6414 states. [2024-11-18 15:43:24,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6414 to 6414. [2024-11-18 15:43:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6414 states, 5629 states have (on average 1.4192574169479482) internal successors, (7989), 5663 states have internal predecessors, (7989), 451 states have call successors, (451), 309 states have call predecessors, (451), 332 states have return successors, (597), 445 states have call predecessors, (597), 449 states have call successors, (597) [2024-11-18 15:43:24,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6414 states to 6414 states and 9037 transitions. [2024-11-18 15:43:24,368 INFO L78 Accepts]: Start accepts. Automaton has 6414 states and 9037 transitions. Word has length 145 [2024-11-18 15:43:24,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:43:24,369 INFO L471 AbstractCegarLoop]: Abstraction has 6414 states and 9037 transitions. [2024-11-18 15:43:24,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 15:43:24,369 INFO L276 IsEmpty]: Start isEmpty. Operand 6414 states and 9037 transitions. [2024-11-18 15:43:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-18 15:43:24,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:43:24,373 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-18 15:43:24,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-18 15:43:24,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-18 15:43:24,575 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:43:24,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:43:24,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1028348356, now seen corresponding path program 1 times [2024-11-18 15:43:24,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:43:24,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450754301] [2024-11-18 15:43:24,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:24,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:43:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 15:43:24,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:43:24,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450754301] [2024-11-18 15:43:24,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450754301] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:43:24,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726332334] [2024-11-18 15:43:24,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:24,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:43:24,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:43:24,633 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) [2024-11-18 15:43:24,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-18 15:43:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:24,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 15:43:24,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:43:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-18 15:43:24,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:43:24,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726332334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:43:24,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:43:24,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-11-18 15:43:24,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695353677] [2024-11-18 15:43:24,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:43:24,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 15:43:24,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:43:24,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 15:43:24,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 15:43:24,737 INFO L87 Difference]: Start difference. First operand 6414 states and 9037 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-18 15:43:24,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:43:24,894 INFO L93 Difference]: Finished difference Result 8562 states and 11621 transitions. [2024-11-18 15:43:24,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 15:43:24,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 146 [2024-11-18 15:43:24,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:43:24,912 INFO L225 Difference]: With dead ends: 8562 [2024-11-18 15:43:24,912 INFO L226 Difference]: Without dead ends: 4996 [2024-11-18 15:43:24,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 15:43:24,919 INFO L432 NwaCegarLoop]: 4103 mSDtfsCounter, 0 mSDsluCounter, 12303 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16406 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:43:24,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16406 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:43:24,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4996 states. [2024-11-18 15:43:25,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4996 to 4996. [2024-11-18 15:43:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4996 states, 4459 states have (on average 1.4772370486656201) internal successors, (6587), 4485 states have internal predecessors, (6587), 307 states have call successors, (307), 205 states have call predecessors, (307), 228 states have return successors, (361), 309 states have call predecessors, (361), 305 states have call successors, (361) [2024-11-18 15:43:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4996 states to 4996 states and 7255 transitions. [2024-11-18 15:43:25,078 INFO L78 Accepts]: Start accepts. Automaton has 4996 states and 7255 transitions. Word has length 146 [2024-11-18 15:43:25,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:43:25,078 INFO L471 AbstractCegarLoop]: Abstraction has 4996 states and 7255 transitions. [2024-11-18 15:43:25,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-18 15:43:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 4996 states and 7255 transitions. [2024-11-18 15:43:25,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-18 15:43:25,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:43:25,082 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-18 15:43:25,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-18 15:43:25,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-18 15:43:25,287 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:43:25,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:43:25,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1397305092, now seen corresponding path program 1 times [2024-11-18 15:43:25,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:43:25,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448926053] [2024-11-18 15:43:25,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:25,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:43:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 15:43:25,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:43:25,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448926053] [2024-11-18 15:43:25,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448926053] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:43:25,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772284906] [2024-11-18 15:43:25,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:25,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:43:25,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:43:25,339 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) [2024-11-18 15:43:25,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-18 15:43:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:43:25,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 15:43:25,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:43:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-18 15:43:25,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:43:25,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772284906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:43:25,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:43:25,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-18 15:43:25,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460235533] [2024-11-18 15:43:25,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:43:25,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 15:43:25,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:43:25,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 15:43:25,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 15:43:25,429 INFO L87 Difference]: Start difference. First operand 4996 states and 7255 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-18 15:43:25,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:43:25,562 INFO L93 Difference]: Finished difference Result 6720 states and 9259 transitions. [2024-11-18 15:43:25,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 15:43:25,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 146 [2024-11-18 15:43:25,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:43:25,573 INFO L225 Difference]: With dead ends: 6720 [2024-11-18 15:43:25,573 INFO L226 Difference]: Without dead ends: 2926 [2024-11-18 15:43:25,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 15:43:25,579 INFO L432 NwaCegarLoop]: 4101 mSDtfsCounter, 0 mSDsluCounter, 12297 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16398 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:43:25,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16398 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:43:25,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2024-11-18 15:43:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 2926. [2024-11-18 15:43:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2779 states have (on average 1.6854983807124866) internal successors, (4684), 2787 states have internal predecessors, (4684), 84 states have call successors, (84), 58 states have call predecessors, (84), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2024-11-18 15:43:25,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4855 transitions. [2024-11-18 15:43:25,641 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4855 transitions. Word has length 146 [2024-11-18 15:43:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:43:25,641 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 4855 transitions. [2024-11-18 15:43:25,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-18 15:43:25,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4855 transitions. [2024-11-18 15:43:25,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-18 15:43:25,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:43:25,643 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-18 15:43:25,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-18 15:43:25,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-18 15:43:25,844 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:43:25,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:43:25,844 INFO L85 PathProgramCache]: Analyzing trace with hash -707496704, now seen corresponding path program 1 times [2024-11-18 15:43:25,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:43:25,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719963972] [2024-11-18 15:43:25,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:43:25,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:43:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 15:43:25,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 15:43:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 15:43:25,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 15:43:25,901 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 15:43:25,902 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-18 15:43:25,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-18 15:43:25,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-18 15:43:25,906 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:43:25,976 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 15:43:25,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 03:43:25 BoogieIcfgContainer [2024-11-18 15:43:25,978 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 15:43:25,979 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 15:43:25,979 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 15:43:25,979 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 15:43:25,979 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:43:08" (3/4) ... [2024-11-18 15:43:25,980 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 15:43:26,060 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 15:43:26,061 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 15:43:26,061 INFO L158 Benchmark]: Toolchain (without parser) took 27342.38ms. Allocated memory was 207.6MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 154.2MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-11-18 15:43:26,062 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 107.0MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 15:43:26,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2506.80ms. Allocated memory was 207.6MB in the beginning and 415.2MB in the end (delta: 207.6MB). Free memory was 154.2MB in the beginning and 273.7MB in the end (delta: -119.4MB). Peak memory consumption was 165.8MB. Max. memory is 16.1GB. [2024-11-18 15:43:26,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 301.44ms. Allocated memory is still 415.2MB. Free memory was 273.7MB in the beginning and 195.0MB in the end (delta: 78.6MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2024-11-18 15:43:26,064 INFO L158 Benchmark]: Boogie Preprocessor took 580.92ms. Allocated memory is still 415.2MB. Free memory was 195.0MB in the beginning and 253.2MB in the end (delta: -58.2MB). Peak memory consumption was 107.5MB. Max. memory is 16.1GB. [2024-11-18 15:43:26,064 INFO L158 Benchmark]: RCFGBuilder took 6617.85ms. Allocated memory was 415.2MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 253.2MB in the beginning and 1.2GB in the end (delta: -941.7MB). Peak memory consumption was 245.3MB. Max. memory is 16.1GB. [2024-11-18 15:43:26,065 INFO L158 Benchmark]: TraceAbstraction took 17246.93ms. Allocated memory was 1.6GB in the beginning and 5.1GB in the end (delta: 3.5GB). Free memory was 1.2GB in the beginning and 2.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-11-18 15:43:26,065 INFO L158 Benchmark]: Witness Printer took 81.88ms. Allocated memory is still 5.1GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-18 15:43:26,066 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.15ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 107.0MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2506.80ms. Allocated memory was 207.6MB in the beginning and 415.2MB in the end (delta: 207.6MB). Free memory was 154.2MB in the beginning and 273.7MB in the end (delta: -119.4MB). Peak memory consumption was 165.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 301.44ms. Allocated memory is still 415.2MB. Free memory was 273.7MB in the beginning and 195.0MB in the end (delta: 78.6MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 580.92ms. Allocated memory is still 415.2MB. Free memory was 195.0MB in the beginning and 253.2MB in the end (delta: -58.2MB). Peak memory consumption was 107.5MB. Max. memory is 16.1GB. * RCFGBuilder took 6617.85ms. Allocated memory was 415.2MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 253.2MB in the beginning and 1.2GB in the end (delta: -941.7MB). Peak memory consumption was 245.3MB. Max. memory is 16.1GB. * TraceAbstraction took 17246.93ms. Allocated memory was 1.6GB in the beginning and 5.1GB in the end (delta: 3.5GB). Free memory was 1.2GB in the beginning and 2.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 81.88ms. Allocated memory is still 5.1GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * 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: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, token=0] [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11429] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11434] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11439] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11588] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11457] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11462] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11467] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11593] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11366] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11264] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11366] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11208] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11366] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11227] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 11094]: 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 8 procedures, 2300 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 17.1s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46057 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46003 mSDsluCounter, 181868 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111369 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1857 IncrementalHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 70499 mSDtfsCounter, 1857 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1866 GetRequests, 1782 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11133occurred in iteration=9, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 3892 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 3700 NumberOfCodeBlocks, 3700 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3665 ConstructedInterpolants, 0 QuantifiedInterpolants, 4734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5097 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 30 InterpolantComputations, 17 PerfectInterpolantSequences, 1657/1918 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! [2024-11-18 15:43:26,099 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE