./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label54.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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/eca-rers2012/Problem13_label54.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 49ff6ba228d081d26cec6b087caf15954318cb178107abc089cabcbe5599946d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:24:05,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:24:05,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:24:05,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:24:05,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:24:06,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:24:06,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:24:06,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:24:06,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:24:06,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:24:06,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:24:06,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:24:06,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:24:06,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:24:06,028 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:24:06,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:24:06,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:24:06,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:24:06,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:24:06,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:24:06,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:24:06,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:24:06,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:24:06,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:24:06,037 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:24:06,037 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:24:06,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:24:06,037 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:24:06,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:24:06,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:24:06,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:24:06,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:24:06,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:24:06,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:24:06,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:24:06,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:24:06,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:24:06,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:24:06,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:24:06,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:24:06,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:24:06,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:24:06,040 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 -> 49ff6ba228d081d26cec6b087caf15954318cb178107abc089cabcbe5599946d [2024-11-08 11:24:06,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:24:06,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:24:06,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:24:06,228 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:24:06,228 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:24:06,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label54.c [2024-11-08 11:24:07,526 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:24:07,829 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:24:07,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label54.c [2024-11-08 11:24:07,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a2b41867/a1322b674fe4465686e7820b258b8cb8/FLAG40998b5b8 [2024-11-08 11:24:08,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a2b41867/a1322b674fe4465686e7820b258b8cb8 [2024-11-08 11:24:08,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:24:08,085 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:24:08,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:24:08,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:24:08,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:24:08,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:24:08" (1/1) ... [2024-11-08 11:24:08,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26186f38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:08, skipping insertion in model container [2024-11-08 11:24:08,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:24:08" (1/1) ... [2024-11-08 11:24:08,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:24:08,427 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/eca-rers2012/Problem13_label54.c[4044,4057] [2024-11-08 11:24:09,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:24:09,162 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:24:09,176 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/eca-rers2012/Problem13_label54.c[4044,4057] [2024-11-08 11:24:09,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:24:09,575 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:24:09,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:09 WrapperNode [2024-11-08 11:24:09,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:24:09,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:24:09,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:24:09,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:24:09,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:09" (1/1) ... [2024-11-08 11:24:09,632 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:09" (1/1) ... [2024-11-08 11:24:10,124 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-08 11:24:10,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:24:10,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:24:10,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:24:10,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:24:10,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:09" (1/1) ... [2024-11-08 11:24:10,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:09" (1/1) ... [2024-11-08 11:24:10,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:09" (1/1) ... [2024-11-08 11:24:10,451 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-08 11:24:10,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:09" (1/1) ... [2024-11-08 11:24:10,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:09" (1/1) ... [2024-11-08 11:24:10,640 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:09" (1/1) ... [2024-11-08 11:24:10,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:09" (1/1) ... [2024-11-08 11:24:10,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:09" (1/1) ... [2024-11-08 11:24:10,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:09" (1/1) ... [2024-11-08 11:24:10,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:24:10,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:24:10,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:24:10,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:24:10,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:09" (1/1) ... [2024-11-08 11:24:10,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:24:10,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:24:10,835 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-08 11:24:10,837 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-08 11:24:10,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:24:10,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:24:10,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:24:10,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:24:10,938 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:24:10,940 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:24:15,871 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-08 11:24:15,871 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:24:15,909 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:24:15,910 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:24:15,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:24:15 BoogieIcfgContainer [2024-11-08 11:24:15,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:24:15,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:24:15,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:24:15,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:24:15,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:24:08" (1/3) ... [2024-11-08 11:24:15,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdc963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:24:15, skipping insertion in model container [2024-11-08 11:24:15,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:09" (2/3) ... [2024-11-08 11:24:15,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdc963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:24:15, skipping insertion in model container [2024-11-08 11:24:15,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:24:15" (3/3) ... [2024-11-08 11:24:15,917 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label54.c [2024-11-08 11:24:15,929 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:24:15,930 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:24:15,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:24:16,000 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;@49c06293, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:24:16,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:24:16,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:16,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 11:24:16,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:16,012 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] [2024-11-08 11:24:16,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:16,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:16,017 INFO L85 PathProgramCache]: Analyzing trace with hash -438767135, now seen corresponding path program 1 times [2024-11-08 11:24:16,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:16,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522673313] [2024-11-08 11:24:16,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:16,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:16,232 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-08 11:24:16,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:16,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522673313] [2024-11-08 11:24:16,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522673313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:16,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:24:16,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:24:16,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031247094] [2024-11-08 11:24:16,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:16,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:24:16,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:16,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:24:16,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:16,259 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:19,682 INFO L93 Difference]: Finished difference Result 3147 states and 5806 transitions. [2024-11-08 11:24:19,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:24:19,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-08 11:24:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:19,702 INFO L225 Difference]: With dead ends: 3147 [2024-11-08 11:24:19,702 INFO L226 Difference]: Without dead ends: 1964 [2024-11-08 11:24:19,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:19,710 INFO L432 NwaCegarLoop]: 764 mSDtfsCounter, 1152 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:19,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 992 Invalid, 3298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-08 11:24:19,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2024-11-08 11:24:19,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1951. [2024-11-08 11:24:19,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1950 states have (on average 1.6538461538461537) internal successors, (3225), 1950 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 3225 transitions. [2024-11-08 11:24:19,796 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 3225 transitions. Word has length 27 [2024-11-08 11:24:19,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:19,797 INFO L471 AbstractCegarLoop]: Abstraction has 1951 states and 3225 transitions. [2024-11-08 11:24:19,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 3225 transitions. [2024-11-08 11:24:19,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 11:24:19,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:19,801 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:24:19,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:24:19,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:19,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:19,803 INFO L85 PathProgramCache]: Analyzing trace with hash 575451273, now seen corresponding path program 1 times [2024-11-08 11:24:19,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:19,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679501686] [2024-11-08 11:24:19,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:19,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:24:20,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:20,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679501686] [2024-11-08 11:24:20,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679501686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:20,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:24:20,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:24:20,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777867875] [2024-11-08 11:24:20,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:20,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:24:20,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:20,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:24:20,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:20,014 INFO L87 Difference]: Start difference. First operand 1951 states and 3225 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:23,589 INFO L93 Difference]: Finished difference Result 5542 states and 9222 transitions. [2024-11-08 11:24:23,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:24:23,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-11-08 11:24:23,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:23,599 INFO L225 Difference]: With dead ends: 5542 [2024-11-08 11:24:23,599 INFO L226 Difference]: Without dead ends: 3593 [2024-11-08 11:24:23,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:23,601 INFO L432 NwaCegarLoop]: 872 mSDtfsCounter, 924 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:23,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1009 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [749 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-08 11:24:23,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2024-11-08 11:24:23,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 3581. [2024-11-08 11:24:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3581 states, 3580 states have (on average 1.5050279329608938) internal successors, (5388), 3580 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:23,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 5388 transitions. [2024-11-08 11:24:23,638 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 5388 transitions. Word has length 98 [2024-11-08 11:24:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:23,638 INFO L471 AbstractCegarLoop]: Abstraction has 3581 states and 5388 transitions. [2024-11-08 11:24:23,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 5388 transitions. [2024-11-08 11:24:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 11:24:23,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:23,641 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:24:23,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:24:23,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:23,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:23,644 INFO L85 PathProgramCache]: Analyzing trace with hash 228222636, now seen corresponding path program 1 times [2024-11-08 11:24:23,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:23,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558839966] [2024-11-08 11:24:23,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:23,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:23,798 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:24:23,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:23,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558839966] [2024-11-08 11:24:23,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558839966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:23,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:24:23,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:24:23,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890558604] [2024-11-08 11:24:23,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:23,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:24:23,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:23,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:24:23,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:23,800 INFO L87 Difference]: Start difference. First operand 3581 states and 5388 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:26,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:26,494 INFO L93 Difference]: Finished difference Result 10352 states and 15625 transitions. [2024-11-08 11:24:26,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:24:26,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-11-08 11:24:26,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:26,512 INFO L225 Difference]: With dead ends: 10352 [2024-11-08 11:24:26,513 INFO L226 Difference]: Without dead ends: 6773 [2024-11-08 11:24:26,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:26,518 INFO L432 NwaCegarLoop]: 1021 mSDtfsCounter, 785 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:26,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1172 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 11:24:26,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2024-11-08 11:24:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6749. [2024-11-08 11:24:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6749 states, 6748 states have (on average 1.3252815649081209) internal successors, (8943), 6748 states have internal predecessors, (8943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:26,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6749 states to 6749 states and 8943 transitions. [2024-11-08 11:24:26,599 INFO L78 Accepts]: Start accepts. Automaton has 6749 states and 8943 transitions. Word has length 112 [2024-11-08 11:24:26,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:26,600 INFO L471 AbstractCegarLoop]: Abstraction has 6749 states and 8943 transitions. [2024-11-08 11:24:26,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:26,602 INFO L276 IsEmpty]: Start isEmpty. Operand 6749 states and 8943 transitions. [2024-11-08 11:24:26,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 11:24:26,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:26,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:24:26,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:24:26,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:26,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:26,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1558843312, now seen corresponding path program 1 times [2024-11-08 11:24:26,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:26,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066810526] [2024-11-08 11:24:26,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:26,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:24:26,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:26,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066810526] [2024-11-08 11:24:26,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066810526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:26,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:24:26,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:24:26,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106650311] [2024-11-08 11:24:26,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:26,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:24:26,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:26,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:24:26,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:26,929 INFO L87 Difference]: Start difference. First operand 6749 states and 8943 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:30,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:30,083 INFO L93 Difference]: Finished difference Result 19804 states and 26220 transitions. [2024-11-08 11:24:30,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:24:30,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2024-11-08 11:24:30,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:30,114 INFO L225 Difference]: With dead ends: 19804 [2024-11-08 11:24:30,115 INFO L226 Difference]: Without dead ends: 13057 [2024-11-08 11:24:30,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:30,127 INFO L432 NwaCegarLoop]: 883 mSDtfsCounter, 865 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 3205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:30,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1035 Invalid, 3205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 11:24:30,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13057 states. [2024-11-08 11:24:30,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13057 to 13052. [2024-11-08 11:24:30,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13052 states, 13051 states have (on average 1.217914336066202) internal successors, (15895), 13051 states have internal predecessors, (15895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13052 states to 13052 states and 15895 transitions. [2024-11-08 11:24:30,341 INFO L78 Accepts]: Start accepts. Automaton has 13052 states and 15895 transitions. Word has length 141 [2024-11-08 11:24:30,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:30,342 INFO L471 AbstractCegarLoop]: Abstraction has 13052 states and 15895 transitions. [2024-11-08 11:24:30,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:30,342 INFO L276 IsEmpty]: Start isEmpty. Operand 13052 states and 15895 transitions. [2024-11-08 11:24:30,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-08 11:24:30,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:30,348 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:24:30,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:24:30,349 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:30,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:30,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1789674140, now seen corresponding path program 1 times [2024-11-08 11:24:30,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:30,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243171665] [2024-11-08 11:24:30,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:30,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:30,932 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 11:24:30,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:30,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243171665] [2024-11-08 11:24:30,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243171665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:30,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:24:30,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:24:30,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702805692] [2024-11-08 11:24:30,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:30,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:24:30,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:30,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:24:30,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:30,937 INFO L87 Difference]: Start difference. First operand 13052 states and 15895 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:33,409 INFO L93 Difference]: Finished difference Result 26889 states and 32590 transitions. [2024-11-08 11:24:33,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:24:33,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219 [2024-11-08 11:24:33,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:33,454 INFO L225 Difference]: With dead ends: 26889 [2024-11-08 11:24:33,454 INFO L226 Difference]: Without dead ends: 13839 [2024-11-08 11:24:33,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:33,481 INFO L432 NwaCegarLoop]: 1084 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:33,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1213 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 11:24:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13839 states. [2024-11-08 11:24:33,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13839 to 13839. [2024-11-08 11:24:33,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13839 states, 13838 states have (on average 1.2058823529411764) internal successors, (16687), 13838 states have internal predecessors, (16687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13839 states to 13839 states and 16687 transitions. [2024-11-08 11:24:33,793 INFO L78 Accepts]: Start accepts. Automaton has 13839 states and 16687 transitions. Word has length 219 [2024-11-08 11:24:33,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:33,793 INFO L471 AbstractCegarLoop]: Abstraction has 13839 states and 16687 transitions. [2024-11-08 11:24:33,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 13839 states and 16687 transitions. [2024-11-08 11:24:33,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-08 11:24:33,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:33,796 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:24:33,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:24:33,797 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:33,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:33,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1420967643, now seen corresponding path program 1 times [2024-11-08 11:24:33,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:33,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786418910] [2024-11-08 11:24:33,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:33,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:24:34,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:34,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786418910] [2024-11-08 11:24:34,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786418910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:34,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:24:34,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:24:34,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643898686] [2024-11-08 11:24:34,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:34,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:24:34,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:34,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:24:34,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:34,178 INFO L87 Difference]: Start difference. First operand 13839 states and 16687 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:37,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:37,318 INFO L93 Difference]: Finished difference Result 33200 states and 41058 transitions. [2024-11-08 11:24:37,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:24:37,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2024-11-08 11:24:37,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:37,366 INFO L225 Difference]: With dead ends: 33200 [2024-11-08 11:24:37,366 INFO L226 Difference]: Without dead ends: 20150 [2024-11-08 11:24:37,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:37,382 INFO L432 NwaCegarLoop]: 823 mSDtfsCounter, 861 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:37,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 943 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 11:24:37,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20150 states. [2024-11-08 11:24:37,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20150 to 20140. [2024-11-08 11:24:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20140 states, 20139 states have (on average 1.1898803316947217) internal successors, (23963), 20139 states have internal predecessors, (23963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20140 states to 20140 states and 23963 transitions. [2024-11-08 11:24:37,587 INFO L78 Accepts]: Start accepts. Automaton has 20140 states and 23963 transitions. Word has length 226 [2024-11-08 11:24:37,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:37,589 INFO L471 AbstractCegarLoop]: Abstraction has 20140 states and 23963 transitions. [2024-11-08 11:24:37,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:37,589 INFO L276 IsEmpty]: Start isEmpty. Operand 20140 states and 23963 transitions. [2024-11-08 11:24:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 11:24:37,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:37,591 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:24:37,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:24:37,591 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:37,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:37,591 INFO L85 PathProgramCache]: Analyzing trace with hash -206220480, now seen corresponding path program 1 times [2024-11-08 11:24:37,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:37,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853066032] [2024-11-08 11:24:37,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:37,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:24:37,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:37,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853066032] [2024-11-08 11:24:37,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853066032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:37,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:24:37,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:24:37,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141387888] [2024-11-08 11:24:37,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:37,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:24:37,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:37,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:24:37,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:37,700 INFO L87 Difference]: Start difference. First operand 20140 states and 23963 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:40,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:40,321 INFO L93 Difference]: Finished difference Result 39361 states and 46953 transitions. [2024-11-08 11:24:40,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:24:40,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 241 [2024-11-08 11:24:40,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:40,348 INFO L225 Difference]: With dead ends: 39361 [2024-11-08 11:24:40,349 INFO L226 Difference]: Without dead ends: 20010 [2024-11-08 11:24:40,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:40,366 INFO L432 NwaCegarLoop]: 1505 mSDtfsCounter, 1037 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:40,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1642 Invalid, 2952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 11:24:40,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20010 states. [2024-11-08 11:24:40,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20010 to 19220. [2024-11-08 11:24:40,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19220 states, 19219 states have (on average 1.1321608824600655) internal successors, (21759), 19219 states have internal predecessors, (21759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19220 states to 19220 states and 21759 transitions. [2024-11-08 11:24:40,513 INFO L78 Accepts]: Start accepts. Automaton has 19220 states and 21759 transitions. Word has length 241 [2024-11-08 11:24:40,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:40,513 INFO L471 AbstractCegarLoop]: Abstraction has 19220 states and 21759 transitions. [2024-11-08 11:24:40,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:40,514 INFO L276 IsEmpty]: Start isEmpty. Operand 19220 states and 21759 transitions. [2024-11-08 11:24:40,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-11-08 11:24:40,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:40,522 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:24:40,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:24:40,522 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:40,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash 113626786, now seen corresponding path program 1 times [2024-11-08 11:24:40,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:40,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362963486] [2024-11-08 11:24:40,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:40,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-08 11:24:40,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:40,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362963486] [2024-11-08 11:24:40,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362963486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:40,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:24:40,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:24:40,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550816521] [2024-11-08 11:24:40,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:40,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:24:40,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:40,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:24:40,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:40,732 INFO L87 Difference]: Start difference. First operand 19220 states and 21759 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:42,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 11:24:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:45,026 INFO L93 Difference]: Finished difference Result 43955 states and 50452 transitions. [2024-11-08 11:24:45,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:24:45,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 315 [2024-11-08 11:24:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:45,054 INFO L225 Difference]: With dead ends: 43955 [2024-11-08 11:24:45,054 INFO L226 Difference]: Without dead ends: 25524 [2024-11-08 11:24:45,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:45,069 INFO L432 NwaCegarLoop]: 1777 mSDtfsCounter, 841 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 721 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 3252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 721 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:45,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 1919 Invalid, 3252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [721 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-08 11:24:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25524 states. [2024-11-08 11:24:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25524 to 24733. [2024-11-08 11:24:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24733 states, 24732 states have (on average 1.118591298722303) internal successors, (27665), 24732 states have internal predecessors, (27665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24733 states to 24733 states and 27665 transitions. [2024-11-08 11:24:45,259 INFO L78 Accepts]: Start accepts. Automaton has 24733 states and 27665 transitions. Word has length 315 [2024-11-08 11:24:45,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:45,260 INFO L471 AbstractCegarLoop]: Abstraction has 24733 states and 27665 transitions. [2024-11-08 11:24:45,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:45,260 INFO L276 IsEmpty]: Start isEmpty. Operand 24733 states and 27665 transitions. [2024-11-08 11:24:45,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-08 11:24:45,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:45,263 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:24:45,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:24:45,263 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:45,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:45,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1008172382, now seen corresponding path program 1 times [2024-11-08 11:24:45,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:45,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964724990] [2024-11-08 11:24:45,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:45,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 11:24:45,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:45,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964724990] [2024-11-08 11:24:45,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964724990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:45,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:24:45,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:24:45,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537315630] [2024-11-08 11:24:45,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:45,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:24:45,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:45,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:24:45,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:24:45,567 INFO L87 Difference]: Start difference. First operand 24733 states and 27665 transitions. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:51,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:51,201 INFO L93 Difference]: Finished difference Result 91376 states and 102287 transitions. [2024-11-08 11:24:51,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:24:51,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 324 [2024-11-08 11:24:51,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:51,272 INFO L225 Difference]: With dead ends: 91376 [2024-11-08 11:24:51,272 INFO L226 Difference]: Without dead ends: 67432 [2024-11-08 11:24:51,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:24:51,302 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 1718 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 6001 mSolverCounterSat, 1098 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 7099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1098 IncrementalHoareTripleChecker+Valid, 6001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:51,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1718 Valid, 764 Invalid, 7099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1098 Valid, 6001 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-08 11:24:51,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67432 states. [2024-11-08 11:24:51,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67432 to 64949. [2024-11-08 11:24:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64949 states, 64948 states have (on average 1.1045605715341504) internal successors, (71739), 64948 states have internal predecessors, (71739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64949 states to 64949 states and 71739 transitions. [2024-11-08 11:24:51,857 INFO L78 Accepts]: Start accepts. Automaton has 64949 states and 71739 transitions. Word has length 324 [2024-11-08 11:24:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:51,858 INFO L471 AbstractCegarLoop]: Abstraction has 64949 states and 71739 transitions. [2024-11-08 11:24:51,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:51,858 INFO L276 IsEmpty]: Start isEmpty. Operand 64949 states and 71739 transitions. [2024-11-08 11:24:51,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-08 11:24:51,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:51,861 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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-08 11:24:51,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:24:51,862 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:51,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:51,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1249030675, now seen corresponding path program 1 times [2024-11-08 11:24:51,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:51,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029203423] [2024-11-08 11:24:51,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:51,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 11:24:52,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:52,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029203423] [2024-11-08 11:24:52,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029203423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:52,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:24:52,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:24:52,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540942271] [2024-11-08 11:24:52,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:52,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:24:52,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:52,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:24:52,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:52,081 INFO L87 Difference]: Start difference. First operand 64949 states and 71739 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:55,572 INFO L93 Difference]: Finished difference Result 142510 states and 156966 transitions. [2024-11-08 11:24:55,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:24:55,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 324 [2024-11-08 11:24:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:55,900 INFO L225 Difference]: With dead ends: 142510 [2024-11-08 11:24:55,901 INFO L226 Difference]: Without dead ends: 77563 [2024-11-08 11:24:55,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:55,933 INFO L432 NwaCegarLoop]: 1000 mSDtfsCounter, 728 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 2869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:55,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1175 Invalid, 2869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2689 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 11:24:55,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77563 states. [2024-11-08 11:24:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77563 to 75978. [2024-11-08 11:24:56,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75978 states, 75977 states have (on average 1.0951472156047224) internal successors, (83206), 75977 states have internal predecessors, (83206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75978 states to 75978 states and 83206 transitions. [2024-11-08 11:24:56,608 INFO L78 Accepts]: Start accepts. Automaton has 75978 states and 83206 transitions. Word has length 324 [2024-11-08 11:24:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:56,608 INFO L471 AbstractCegarLoop]: Abstraction has 75978 states and 83206 transitions. [2024-11-08 11:24:56,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 75978 states and 83206 transitions. [2024-11-08 11:24:56,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2024-11-08 11:24:56,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:56,612 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-11-08 11:24:56,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:24:56,612 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:56,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:56,612 INFO L85 PathProgramCache]: Analyzing trace with hash -152484837, now seen corresponding path program 1 times [2024-11-08 11:24:56,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:56,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659605911] [2024-11-08 11:24:56,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:56,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 218 proven. 113 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 11:24:58,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:58,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659605911] [2024-11-08 11:24:58,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659605911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:24:58,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529694758] [2024-11-08 11:24:58,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:58,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:24:58,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:24:58,025 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-08 11:24:58,028 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-08 11:24:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:58,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:24:58,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:24:58,351 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-08 11:24:58,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:24:58,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529694758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:58,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:24:58,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-08 11:24:58,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057851196] [2024-11-08 11:24:58,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:58,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:24:58,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:58,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:24:58,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:24:58,353 INFO L87 Difference]: Start difference. First operand 75978 states and 83206 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:01,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:25:01,389 INFO L93 Difference]: Finished difference Result 151165 states and 165617 transitions. [2024-11-08 11:25:01,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:25:01,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 353 [2024-11-08 11:25:01,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:25:01,488 INFO L225 Difference]: With dead ends: 151165 [2024-11-08 11:25:01,489 INFO L226 Difference]: Without dead ends: 75976 [2024-11-08 11:25:01,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:25:01,535 INFO L432 NwaCegarLoop]: 1341 mSDtfsCounter, 1112 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2462 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:25:01,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 1420 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2462 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 11:25:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75976 states. [2024-11-08 11:25:02,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75976 to 75975. [2024-11-08 11:25:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75975 states, 75974 states have (on average 1.0758680601258326) internal successors, (81738), 75974 states have internal predecessors, (81738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75975 states to 75975 states and 81738 transitions. [2024-11-08 11:25:02,585 INFO L78 Accepts]: Start accepts. Automaton has 75975 states and 81738 transitions. Word has length 353 [2024-11-08 11:25:02,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:25:02,585 INFO L471 AbstractCegarLoop]: Abstraction has 75975 states and 81738 transitions. [2024-11-08 11:25:02,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:02,586 INFO L276 IsEmpty]: Start isEmpty. Operand 75975 states and 81738 transitions. [2024-11-08 11:25:02,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2024-11-08 11:25:02,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:25:02,590 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:25:02,607 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-08 11:25:02,794 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,SelfDestructingSolverStorable10 [2024-11-08 11:25:02,795 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:25:02,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:25:02,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2109393606, now seen corresponding path program 1 times [2024-11-08 11:25:02,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:25:02,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698610061] [2024-11-08 11:25:02,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:25:02,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:25:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:25:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-08 11:25:03,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:25:03,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698610061] [2024-11-08 11:25:03,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698610061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:25:03,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:25:03,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:25:03,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571429029] [2024-11-08 11:25:03,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:25:03,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:25:03,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:25:03,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:25:03,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:25:03,183 INFO L87 Difference]: Start difference. First operand 75975 states and 81738 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:06,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:25:06,710 INFO L93 Difference]: Finished difference Result 171631 states and 185876 transitions. [2024-11-08 11:25:06,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:25:06,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 383 [2024-11-08 11:25:06,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:25:06,952 INFO L225 Difference]: With dead ends: 171631 [2024-11-08 11:25:06,952 INFO L226 Difference]: Without dead ends: 96445 [2024-11-08 11:25:06,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:25:06,977 INFO L432 NwaCegarLoop]: 799 mSDtfsCounter, 891 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 934 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 3346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 934 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:25:06,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 881 Invalid, 3346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [934 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 11:25:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96445 states. [2024-11-08 11:25:07,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96445 to 93279. [2024-11-08 11:25:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93279 states, 93278 states have (on average 1.08082291644332) internal successors, (100817), 93278 states have internal predecessors, (100817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93279 states to 93279 states and 100817 transitions. [2024-11-08 11:25:08,159 INFO L78 Accepts]: Start accepts. Automaton has 93279 states and 100817 transitions. Word has length 383 [2024-11-08 11:25:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:25:08,161 INFO L471 AbstractCegarLoop]: Abstraction has 93279 states and 100817 transitions. [2024-11-08 11:25:08,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 93279 states and 100817 transitions. [2024-11-08 11:25:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2024-11-08 11:25:08,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:25:08,175 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 11:25:08,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:25:08,175 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:25:08,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:25:08,175 INFO L85 PathProgramCache]: Analyzing trace with hash 66240533, now seen corresponding path program 1 times [2024-11-08 11:25:08,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:25:08,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156276334] [2024-11-08 11:25:08,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:25:08,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:25:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:25:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-08 11:25:08,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:25:08,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156276334] [2024-11-08 11:25:08,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156276334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:25:08,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:25:08,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:25:08,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180155992] [2024-11-08 11:25:08,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:25:08,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:25:08,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:25:08,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:25:08,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:25:08,659 INFO L87 Difference]: Start difference. First operand 93279 states and 100817 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:25:12,552 INFO L93 Difference]: Finished difference Result 185777 states and 200858 transitions. [2024-11-08 11:25:12,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:25:12,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 421 [2024-11-08 11:25:12,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:25:12,671 INFO L225 Difference]: With dead ends: 185777 [2024-11-08 11:25:12,671 INFO L226 Difference]: Without dead ends: 93287 [2024-11-08 11:25:12,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:25:12,690 INFO L432 NwaCegarLoop]: 1699 mSDtfsCounter, 794 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 679 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 3173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 679 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:25:12,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1841 Invalid, 3173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [679 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-08 11:25:12,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93287 states. [2024-11-08 11:25:13,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93287 to 92482. [2024-11-08 11:25:13,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92482 states, 92481 states have (on average 1.0581200462797764) internal successors, (97856), 92481 states have internal predecessors, (97856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92482 states to 92482 states and 97856 transitions. [2024-11-08 11:25:13,563 INFO L78 Accepts]: Start accepts. Automaton has 92482 states and 97856 transitions. Word has length 421 [2024-11-08 11:25:13,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:25:13,564 INFO L471 AbstractCegarLoop]: Abstraction has 92482 states and 97856 transitions. [2024-11-08 11:25:13,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:13,564 INFO L276 IsEmpty]: Start isEmpty. Operand 92482 states and 97856 transitions. [2024-11-08 11:25:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2024-11-08 11:25:13,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:25:13,572 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:25:13,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 11:25:13,572 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:25:13,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:25:13,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1419491106, now seen corresponding path program 1 times [2024-11-08 11:25:13,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:25:13,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391802297] [2024-11-08 11:25:13,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:25:13,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:25:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:25:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 287 proven. 113 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 11:25:15,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:25:15,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391802297] [2024-11-08 11:25:15,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391802297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:25:15,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687661652] [2024-11-08 11:25:15,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:25:15,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:25:15,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:25:15,481 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-08 11:25:15,482 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-08 11:25:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:25:15,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:25:15,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:25:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-08 11:25:15,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:25:15,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687661652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:25:15,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:25:15,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-08 11:25:15,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7777579] [2024-11-08 11:25:15,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:25:15,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:25:15,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:25:15,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:25:15,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:25:15,808 INFO L87 Difference]: Start difference. First operand 92482 states and 97856 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:18,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:25:18,891 INFO L93 Difference]: Finished difference Result 180995 states and 192682 transitions. [2024-11-08 11:25:18,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:25:18,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 457 [2024-11-08 11:25:18,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:25:19,012 INFO L225 Difference]: With dead ends: 180995 [2024-11-08 11:25:19,013 INFO L226 Difference]: Without dead ends: 102688 [2024-11-08 11:25:19,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:25:19,060 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 1128 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2257 mSolverCounterSat, 799 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 3056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 799 IncrementalHoareTripleChecker+Valid, 2257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:25:19,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1128 Valid, 367 Invalid, 3056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [799 Valid, 2257 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 11:25:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102688 states. [2024-11-08 11:25:20,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102688 to 102688. [2024-11-08 11:25:20,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102688 states, 102687 states have (on average 1.0576022281301432) internal successors, (108602), 102687 states have internal predecessors, (108602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102688 states to 102688 states and 108602 transitions. [2024-11-08 11:25:20,585 INFO L78 Accepts]: Start accepts. Automaton has 102688 states and 108602 transitions. Word has length 457 [2024-11-08 11:25:20,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:25:20,585 INFO L471 AbstractCegarLoop]: Abstraction has 102688 states and 108602 transitions. [2024-11-08 11:25:20,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:20,586 INFO L276 IsEmpty]: Start isEmpty. Operand 102688 states and 108602 transitions. [2024-11-08 11:25:20,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2024-11-08 11:25:20,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:25:20,597 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:25:20,610 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-08 11:25:20,797 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,SelfDestructingSolverStorable13 [2024-11-08 11:25:20,798 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:25:20,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:25:20,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1347184657, now seen corresponding path program 1 times [2024-11-08 11:25:20,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:25:20,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980588088] [2024-11-08 11:25:20,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:25:20,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:25:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:25:22,424 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 287 proven. 113 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 11:25:22,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:25:22,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980588088] [2024-11-08 11:25:22,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980588088] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:25:22,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876200394] [2024-11-08 11:25:22,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:25:22,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:25:22,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:25:22,427 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-08 11:25:22,428 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-08 11:25:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:25:22,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:25:22,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:25:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-08 11:25:23,055 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:25:23,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876200394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:25:23,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:25:23,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-08 11:25:23,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097152394] [2024-11-08 11:25:23,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:25:23,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:25:23,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:25:23,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:25:23,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:25:23,058 INFO L87 Difference]: Start difference. First operand 102688 states and 108602 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:25,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:25:25,795 INFO L93 Difference]: Finished difference Result 195936 states and 207583 transitions. [2024-11-08 11:25:25,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:25:25,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 473 [2024-11-08 11:25:25,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:25:25,922 INFO L225 Difference]: With dead ends: 195936 [2024-11-08 11:25:25,923 INFO L226 Difference]: Without dead ends: 105846 [2024-11-08 11:25:25,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:25:25,975 INFO L432 NwaCegarLoop]: 992 mSDtfsCounter, 680 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2431 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 2539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:25:25,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1121 Invalid, 2539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2431 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 11:25:26,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105846 states. [2024-11-08 11:25:26,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105846 to 105837. [2024-11-08 11:25:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105837 states, 105836 states have (on average 1.051787671491742) internal successors, (111317), 105836 states have internal predecessors, (111317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105837 states to 105837 states and 111317 transitions. [2024-11-08 11:25:27,436 INFO L78 Accepts]: Start accepts. Automaton has 105837 states and 111317 transitions. Word has length 473 [2024-11-08 11:25:27,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:25:27,437 INFO L471 AbstractCegarLoop]: Abstraction has 105837 states and 111317 transitions. [2024-11-08 11:25:27,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand 105837 states and 111317 transitions. [2024-11-08 11:25:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2024-11-08 11:25:27,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:25:27,448 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:25:27,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 11:25:27,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:25:27,649 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:25:27,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:25:27,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1426219641, now seen corresponding path program 1 times [2024-11-08 11:25:27,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:25:27,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216557148] [2024-11-08 11:25:27,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:25:27,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:25:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:25:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2024-11-08 11:25:27,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:25:27,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216557148] [2024-11-08 11:25:27,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216557148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:25:27,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:25:27,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:25:27,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121565425] [2024-11-08 11:25:27,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:25:27,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:25:27,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:25:27,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:25:27,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:25:27,934 INFO L87 Difference]: Start difference. First operand 105837 states and 111317 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:25:30,236 INFO L93 Difference]: Finished difference Result 196696 states and 207202 transitions. [2024-11-08 11:25:30,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:25:30,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 512 [2024-11-08 11:25:30,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:25:30,345 INFO L225 Difference]: With dead ends: 196696 [2024-11-08 11:25:30,346 INFO L226 Difference]: Without dead ends: 105034 [2024-11-08 11:25:30,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:25:30,376 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 1558 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:25:30,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 275 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 11:25:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105034 states. [2024-11-08 11:25:31,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105034 to 105033. [2024-11-08 11:25:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105033 states, 105032 states have (on average 1.0504893746667683) internal successors, (110335), 105032 states have internal predecessors, (110335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105033 states to 105033 states and 110335 transitions. [2024-11-08 11:25:31,584 INFO L78 Accepts]: Start accepts. Automaton has 105033 states and 110335 transitions. Word has length 512 [2024-11-08 11:25:31,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:25:31,584 INFO L471 AbstractCegarLoop]: Abstraction has 105033 states and 110335 transitions. [2024-11-08 11:25:31,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 105033 states and 110335 transitions. [2024-11-08 11:25:31,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2024-11-08 11:25:31,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:25:31,594 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:25:31,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 11:25:31,594 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:25:31,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:25:31,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1193820110, now seen corresponding path program 1 times [2024-11-08 11:25:31,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:25:31,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808705422] [2024-11-08 11:25:31,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:25:31,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:25:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:25:32,364 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-08 11:25:32,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:25:32,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808705422] [2024-11-08 11:25:32,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808705422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:25:32,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:25:32,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:25:32,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791920554] [2024-11-08 11:25:32,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:25:32,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:25:32,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:25:32,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:25:32,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:25:32,367 INFO L87 Difference]: Start difference. First operand 105033 states and 110335 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:25:35,109 INFO L93 Difference]: Finished difference Result 196682 states and 207037 transitions. [2024-11-08 11:25:35,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:25:35,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 526 [2024-11-08 11:25:35,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:25:35,235 INFO L225 Difference]: With dead ends: 196682 [2024-11-08 11:25:35,235 INFO L226 Difference]: Without dead ends: 105824 [2024-11-08 11:25:35,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:25:35,292 INFO L432 NwaCegarLoop]: 1704 mSDtfsCounter, 609 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1828 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:25:35,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1828 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 11:25:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105824 states. [2024-11-08 11:25:36,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105824 to 105821. [2024-11-08 11:25:36,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105821 states, 105820 states have (on average 1.0503685503685503) internal successors, (111150), 105820 states have internal predecessors, (111150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105821 states to 105821 states and 111150 transitions. [2024-11-08 11:25:36,537 INFO L78 Accepts]: Start accepts. Automaton has 105821 states and 111150 transitions. Word has length 526 [2024-11-08 11:25:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:25:36,537 INFO L471 AbstractCegarLoop]: Abstraction has 105821 states and 111150 transitions. [2024-11-08 11:25:36,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:25:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 105821 states and 111150 transitions. [2024-11-08 11:25:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2024-11-08 11:25:36,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:25:36,548 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:25:36,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 11:25:36,548 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:25:36,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:25:36,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1535643174, now seen corresponding path program 1 times [2024-11-08 11:25:36,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:25:36,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525612695] [2024-11-08 11:25:36,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:25:36,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:25:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:25:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 623 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2024-11-08 11:25:36,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:25:36,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525612695] [2024-11-08 11:25:36,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525612695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:25:36,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:25:36,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:25:36,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060443990] [2024-11-08 11:25:36,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:25:36,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:25:36,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:25:36,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:25:37,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:25:37,131 INFO L87 Difference]: Start difference. First operand 105821 states and 111150 transitions. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)