./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label43.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label43.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 443b39ef03d047933d04d3c4124d0553fdbdc2364608b268fc568d4113c9c65f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:47:49,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:47:49,969 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:47:49,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:47:49,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:47:49,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:47:49,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:47:49,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:47:49,999 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:47:50,000 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:47:50,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:47:50,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:47:50,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:47:50,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:47:50,001 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:47:50,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:47:50,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:47:50,002 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:47:50,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:47:50,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:47:50,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:47:50,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:47:50,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:47:50,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:47:50,005 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:47:50,005 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:47:50,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:47:50,005 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:47:50,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:47:50,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:47:50,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:47:50,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:47:50,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:47:50,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:47:50,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:47:50,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:47:50,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:47:50,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:47:50,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:47:50,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:47:50,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:47:50,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:47:50,010 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 -> 443b39ef03d047933d04d3c4124d0553fdbdc2364608b268fc568d4113c9c65f [2024-10-13 23:47:50,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:47:50,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:47:50,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:47:50,223 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:47:50,224 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:47:50,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label43.c [2024-10-13 23:47:51,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:47:51,763 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:47:51,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label43.c [2024-10-13 23:47:51,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9524ff11/47befcea078c47de9bc7e9349138f983/FLAG3e0c1cc3d [2024-10-13 23:47:51,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9524ff11/47befcea078c47de9bc7e9349138f983 [2024-10-13 23:47:51,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:47:51,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:47:51,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:47:51,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:47:51,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:47:51,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:47:51" (1/1) ... [2024-10-13 23:47:51,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@244bef60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:51, skipping insertion in model container [2024-10-13 23:47:51,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:47:51" (1/1) ... [2024-10-13 23:47:51,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:47:52,034 WARN L248 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/Problem15_label43.c[7052,7065] [2024-10-13 23:47:52,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:47:52,301 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:47:52,328 WARN L248 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/Problem15_label43.c[7052,7065] [2024-10-13 23:47:52,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:47:52,543 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:47:52,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:52 WrapperNode [2024-10-13 23:47:52,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:47:52,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:47:52,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:47:52,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:47:52,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:52" (1/1) ... [2024-10-13 23:47:52,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:52" (1/1) ... [2024-10-13 23:47:52,747 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-10-13 23:47:52,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:47:52,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:47:52,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:47:52,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:47:52,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:52" (1/1) ... [2024-10-13 23:47:52,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:52" (1/1) ... [2024-10-13 23:47:52,802 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:52" (1/1) ... [2024-10-13 23:47:52,876 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-10-13 23:47:52,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:52" (1/1) ... [2024-10-13 23:47:52,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:52" (1/1) ... [2024-10-13 23:47:52,928 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:52" (1/1) ... [2024-10-13 23:47:52,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:52" (1/1) ... [2024-10-13 23:47:52,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:52" (1/1) ... [2024-10-13 23:47:52,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:52" (1/1) ... [2024-10-13 23:47:52,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:47:52,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:47:52,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:47:52,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:47:52,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:52" (1/1) ... [2024-10-13 23:47:52,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:47:53,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:47:53,021 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-10-13 23:47:53,029 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-10-13 23:47:53,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:47:53,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:47:53,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:47:53,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:47:53,118 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:47:53,119 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:47:55,162 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-10-13 23:47:55,166 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:47:55,207 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:47:55,208 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:47:55,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:47:55 BoogieIcfgContainer [2024-10-13 23:47:55,208 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:47:55,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:47:55,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:47:55,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:47:55,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:47:51" (1/3) ... [2024-10-13 23:47:55,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e36806a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:47:55, skipping insertion in model container [2024-10-13 23:47:55,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:52" (2/3) ... [2024-10-13 23:47:55,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e36806a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:47:55, skipping insertion in model container [2024-10-13 23:47:55,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:47:55" (3/3) ... [2024-10-13 23:47:55,214 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label43.c [2024-10-13 23:47:55,226 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:47:55,226 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:47:55,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:47:55,276 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;@218a9c2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:47:55,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:47:55,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 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-10-13 23:47:55,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 23:47:55,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:47:55,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:47:55,287 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:47:55,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:47:55,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1846958559, now seen corresponding path program 1 times [2024-10-13 23:47:55,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:47:55,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229084484] [2024-10-13 23:47:55,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:47:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:47:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:47:55,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:47:55,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:47:55,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229084484] [2024-10-13 23:47:55,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229084484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:47:55,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:47:55,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:47:55,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841316909] [2024-10-13 23:47:55,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:47:55,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:47:55,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:47:55,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:47:55,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:47:55,442 INFO L87 Difference]: Start difference. First operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 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 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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-10-13 23:47:55,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:47:55,481 INFO L93 Difference]: Finished difference Result 723 states and 1375 transitions. [2024-10-13 23:47:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:47:55,485 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-10-13 23:47:55,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:47:55,493 INFO L225 Difference]: With dead ends: 723 [2024-10-13 23:47:55,493 INFO L226 Difference]: Without dead ends: 360 [2024-10-13 23:47:55,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:47:55,499 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:47:55,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 623 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:47:55,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-13 23:47:55,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-10-13 23:47:55,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 0 states have call successors, (0), 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-10-13 23:47:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2024-10-13 23:47:55,540 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 57 [2024-10-13 23:47:55,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:47:55,542 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2024-10-13 23:47:55,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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-10-13 23:47:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2024-10-13 23:47:55,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 23:47:55,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:47:55,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:47:55,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:47:55,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:47:55,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:47:55,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1358242336, now seen corresponding path program 1 times [2024-10-13 23:47:55,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:47:55,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318915615] [2024-10-13 23:47:55,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:47:55,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:47:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:47:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:47:55,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:47:55,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318915615] [2024-10-13 23:47:55,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318915615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:47:55,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:47:55,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:47:55,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082267991] [2024-10-13 23:47:55,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:47:55,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:47:55,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:47:55,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:47:55,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:47:55,760 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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-10-13 23:47:57,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:47:57,162 INFO L93 Difference]: Finished difference Result 1023 states and 1787 transitions. [2024-10-13 23:47:57,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:47:57,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-10-13 23:47:57,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:47:57,166 INFO L225 Difference]: With dead ends: 1023 [2024-10-13 23:47:57,166 INFO L226 Difference]: Without dead ends: 664 [2024-10-13 23:47:57,168 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-10-13 23:47:57,168 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 259 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:47:57,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 316 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:47:57,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2024-10-13 23:47:57,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 662. [2024-10-13 23:47:57,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.4826021180030258) internal successors, (980), 661 states have internal predecessors, (980), 0 states have call successors, (0), 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-10-13 23:47:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 980 transitions. [2024-10-13 23:47:57,196 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 980 transitions. Word has length 57 [2024-10-13 23:47:57,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:47:57,197 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 980 transitions. [2024-10-13 23:47:57,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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-10-13 23:47:57,197 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 980 transitions. [2024-10-13 23:47:57,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 23:47:57,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:47:57,200 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:47:57,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:47:57,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:47:57,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:47:57,201 INFO L85 PathProgramCache]: Analyzing trace with hash 131384399, now seen corresponding path program 1 times [2024-10-13 23:47:57,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:47:57,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917052848] [2024-10-13 23:47:57,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:47:57,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:47:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:47:57,489 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:47:57,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:47:57,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917052848] [2024-10-13 23:47:57,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917052848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:47:57,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:47:57,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:47:57,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996191287] [2024-10-13 23:47:57,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:47:57,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:47:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:47:57,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:47:57,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:47:57,496 INFO L87 Difference]: Start difference. First operand 662 states and 980 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 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-10-13 23:47:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:47:58,538 INFO L93 Difference]: Finished difference Result 1623 states and 2314 transitions. [2024-10-13 23:47:58,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:47:58,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-10-13 23:47:58,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:47:58,541 INFO L225 Difference]: With dead ends: 1623 [2024-10-13 23:47:58,541 INFO L226 Difference]: Without dead ends: 962 [2024-10-13 23:47:58,543 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-10-13 23:47:58,544 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:47:58,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 335 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:47:58,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-10-13 23:47:58,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2024-10-13 23:47:58,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.3631633714880333) internal successors, (1310), 961 states have internal predecessors, (1310), 0 states have call successors, (0), 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-10-13 23:47:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1310 transitions. [2024-10-13 23:47:58,561 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1310 transitions. Word has length 122 [2024-10-13 23:47:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:47:58,562 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1310 transitions. [2024-10-13 23:47:58,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 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-10-13 23:47:58,562 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1310 transitions. [2024-10-13 23:47:58,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 23:47:58,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:47:58,565 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:47:58,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:47:58,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:47:58,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:47:58,568 INFO L85 PathProgramCache]: Analyzing trace with hash -364887318, now seen corresponding path program 1 times [2024-10-13 23:47:58,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:47:58,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505728532] [2024-10-13 23:47:58,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:47:58,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:47:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:47:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:47:58,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:47:58,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505728532] [2024-10-13 23:47:58,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505728532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:47:58,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:47:58,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:47:58,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611223916] [2024-10-13 23:47:58,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:47:58,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:47:58,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:47:58,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:47:58,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:47:58,711 INFO L87 Difference]: Start difference. First operand 962 states and 1310 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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-10-13 23:48:00,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:00,375 INFO L93 Difference]: Finished difference Result 2228 states and 3185 transitions. [2024-10-13 23:48:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:00,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2024-10-13 23:48:00,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:00,380 INFO L225 Difference]: With dead ends: 2228 [2024-10-13 23:48:00,380 INFO L226 Difference]: Without dead ends: 1566 [2024-10-13 23:48:00,381 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-10-13 23:48:00,382 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 256 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:00,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 316 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 23:48:00,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-10-13 23:48:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1265. [2024-10-13 23:48:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.3045886075949367) internal successors, (1649), 1264 states have internal predecessors, (1649), 0 states have call successors, (0), 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-10-13 23:48:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1649 transitions. [2024-10-13 23:48:00,399 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1649 transitions. Word has length 127 [2024-10-13 23:48:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:00,399 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1649 transitions. [2024-10-13 23:48:00,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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-10-13 23:48:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1649 transitions. [2024-10-13 23:48:00,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-13 23:48:00,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:00,404 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:48:00,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:48:00,404 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:00,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:00,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2142793201, now seen corresponding path program 1 times [2024-10-13 23:48:00,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:00,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169163640] [2024-10-13 23:48:00,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:00,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:48:00,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:00,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169163640] [2024-10-13 23:48:00,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169163640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:00,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:00,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:48:00,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543831503] [2024-10-13 23:48:00,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:00,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:48:00,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:00,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:48:00,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:48:00,644 INFO L87 Difference]: Start difference. First operand 1265 states and 1649 transitions. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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-10-13 23:48:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:03,329 INFO L93 Difference]: Finished difference Result 4669 states and 6169 transitions. [2024-10-13 23:48:03,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:48:03,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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 223 [2024-10-13 23:48:03,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:03,354 INFO L225 Difference]: With dead ends: 4669 [2024-10-13 23:48:03,354 INFO L226 Difference]: Without dead ends: 3405 [2024-10-13 23:48:03,357 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-10-13 23:48:03,357 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 487 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 2549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:03,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 374 Invalid, 2549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:48:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2024-10-13 23:48:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 3380. [2024-10-13 23:48:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3380 states, 3379 states have (on average 1.2370523823616455) internal successors, (4180), 3379 states have internal predecessors, (4180), 0 states have call successors, (0), 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-10-13 23:48:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 4180 transitions. [2024-10-13 23:48:03,458 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 4180 transitions. Word has length 223 [2024-10-13 23:48:03,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:03,462 INFO L471 AbstractCegarLoop]: Abstraction has 3380 states and 4180 transitions. [2024-10-13 23:48:03,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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-10-13 23:48:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 4180 transitions. [2024-10-13 23:48:03,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-10-13 23:48:03,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:03,467 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:48:03,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:48:03,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:03,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:03,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1661012037, now seen corresponding path program 1 times [2024-10-13 23:48:03,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:03,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175620359] [2024-10-13 23:48:03,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:03,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-13 23:48:03,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:03,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175620359] [2024-10-13 23:48:03,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175620359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:03,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:03,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:48:03,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543428765] [2024-10-13 23:48:03,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:03,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:03,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:03,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:03,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:03,677 INFO L87 Difference]: Start difference. First operand 3380 states and 4180 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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-10-13 23:48:04,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:04,931 INFO L93 Difference]: Finished difference Result 8562 states and 10755 transitions. [2024-10-13 23:48:04,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:04,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 227 [2024-10-13 23:48:04,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:04,945 INFO L225 Difference]: With dead ends: 8562 [2024-10-13 23:48:04,945 INFO L226 Difference]: Without dead ends: 5482 [2024-10-13 23:48:04,950 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-10-13 23:48:04,950 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:04,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 337 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 23:48:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5482 states. [2024-10-13 23:48:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5482 to 5477. [2024-10-13 23:48:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 5476 states have (on average 1.1689189189189189) internal successors, (6401), 5476 states have internal predecessors, (6401), 0 states have call successors, (0), 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-10-13 23:48:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 6401 transitions. [2024-10-13 23:48:05,017 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 6401 transitions. Word has length 227 [2024-10-13 23:48:05,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:05,018 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 6401 transitions. [2024-10-13 23:48:05,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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-10-13 23:48:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 6401 transitions. [2024-10-13 23:48:05,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-10-13 23:48:05,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:05,022 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:48:05,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:48:05,022 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:05,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:05,023 INFO L85 PathProgramCache]: Analyzing trace with hash -964966005, now seen corresponding path program 1 times [2024-10-13 23:48:05,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:05,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760914734] [2024-10-13 23:48:05,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:05,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-13 23:48:05,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:05,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760914734] [2024-10-13 23:48:05,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760914734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:05,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:05,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:48:05,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289931217] [2024-10-13 23:48:05,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:05,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:05,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:05,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:05,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:05,451 INFO L87 Difference]: Start difference. First operand 5477 states and 6401 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 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-10-13 23:48:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:07,022 INFO L93 Difference]: Finished difference Result 10654 states and 12490 transitions. [2024-10-13 23:48:07,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:07,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 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 329 [2024-10-13 23:48:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:07,042 INFO L225 Difference]: With dead ends: 10654 [2024-10-13 23:48:07,042 INFO L226 Difference]: Without dead ends: 5477 [2024-10-13 23:48:07,046 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-10-13 23:48:07,046 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:07,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 357 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 23:48:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5477 states. [2024-10-13 23:48:07,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5477 to 5477. [2024-10-13 23:48:07,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 5476 states have (on average 1.1678232286340395) internal successors, (6395), 5476 states have internal predecessors, (6395), 0 states have call successors, (0), 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-10-13 23:48:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 6395 transitions. [2024-10-13 23:48:07,101 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 6395 transitions. Word has length 329 [2024-10-13 23:48:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:07,102 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 6395 transitions. [2024-10-13 23:48:07,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 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-10-13 23:48:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 6395 transitions. [2024-10-13 23:48:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-10-13 23:48:07,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:07,105 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, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-10-13 23:48:07,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:48:07,105 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:07,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:07,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1270028560, now seen corresponding path program 1 times [2024-10-13 23:48:07,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:07,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951467303] [2024-10-13 23:48:07,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:07,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:07,234 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-13 23:48:07,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:07,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951467303] [2024-10-13 23:48:07,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951467303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:07,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:07,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:48:07,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848411474] [2024-10-13 23:48:07,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:07,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:07,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:07,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:07,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:07,237 INFO L87 Difference]: Start difference. First operand 5477 states and 6395 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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-10-13 23:48:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:08,435 INFO L93 Difference]: Finished difference Result 11850 states and 14152 transitions. [2024-10-13 23:48:08,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:08,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 344 [2024-10-13 23:48:08,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:08,452 INFO L225 Difference]: With dead ends: 11850 [2024-10-13 23:48:08,452 INFO L226 Difference]: Without dead ends: 6673 [2024-10-13 23:48:08,456 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-10-13 23:48:08,456 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 256 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:08,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 320 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:48:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6673 states. [2024-10-13 23:48:08,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6673 to 5174. [2024-10-13 23:48:08,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5174 states, 5173 states have (on average 1.174946839358206) internal successors, (6078), 5173 states have internal predecessors, (6078), 0 states have call successors, (0), 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-10-13 23:48:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5174 states to 5174 states and 6078 transitions. [2024-10-13 23:48:08,526 INFO L78 Accepts]: Start accepts. Automaton has 5174 states and 6078 transitions. Word has length 344 [2024-10-13 23:48:08,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:08,527 INFO L471 AbstractCegarLoop]: Abstraction has 5174 states and 6078 transitions. [2024-10-13 23:48:08,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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-10-13 23:48:08,527 INFO L276 IsEmpty]: Start isEmpty. Operand 5174 states and 6078 transitions. [2024-10-13 23:48:08,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2024-10-13 23:48:08,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:08,533 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:48:08,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:48:08,534 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:08,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:08,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1108328669, now seen corresponding path program 1 times [2024-10-13 23:48:08,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:08,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391492889] [2024-10-13 23:48:08,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:08,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-13 23:48:08,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:08,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391492889] [2024-10-13 23:48:08,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391492889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:08,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:08,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:48:08,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078702440] [2024-10-13 23:48:08,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:08,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:08,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:08,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:08,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:08,757 INFO L87 Difference]: Start difference. First operand 5174 states and 6078 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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-10-13 23:48:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:10,079 INFO L93 Difference]: Finished difference Result 12150 states and 14568 transitions. [2024-10-13 23:48:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:10,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 403 [2024-10-13 23:48:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:10,114 INFO L225 Difference]: With dead ends: 12150 [2024-10-13 23:48:10,114 INFO L226 Difference]: Without dead ends: 7276 [2024-10-13 23:48:10,122 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-10-13 23:48:10,126 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 270 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:10,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 634 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:48:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7276 states. [2024-10-13 23:48:10,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7276 to 6379. [2024-10-13 23:48:10,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6379 states, 6378 states have (on average 1.1560050172467857) internal successors, (7373), 6378 states have internal predecessors, (7373), 0 states have call successors, (0), 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-10-13 23:48:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6379 states to 6379 states and 7373 transitions. [2024-10-13 23:48:10,274 INFO L78 Accepts]: Start accepts. Automaton has 6379 states and 7373 transitions. Word has length 403 [2024-10-13 23:48:10,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:10,275 INFO L471 AbstractCegarLoop]: Abstraction has 6379 states and 7373 transitions. [2024-10-13 23:48:10,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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-10-13 23:48:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 6379 states and 7373 transitions. [2024-10-13 23:48:10,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-10-13 23:48:10,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:10,284 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:48:10,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:48:10,287 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:10,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:10,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1532694065, now seen corresponding path program 1 times [2024-10-13 23:48:10,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:10,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670424730] [2024-10-13 23:48:10,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:10,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:10,602 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:48:10,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:10,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670424730] [2024-10-13 23:48:10,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670424730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:10,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:10,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:48:10,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60303110] [2024-10-13 23:48:10,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:10,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:10,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:10,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:10,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:10,610 INFO L87 Difference]: Start difference. First operand 6379 states and 7373 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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-10-13 23:48:11,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:11,827 INFO L93 Difference]: Finished difference Result 14562 states and 17154 transitions. [2024-10-13 23:48:11,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:11,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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 409 [2024-10-13 23:48:11,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:11,838 INFO L225 Difference]: With dead ends: 14562 [2024-10-13 23:48:11,839 INFO L226 Difference]: Without dead ends: 8483 [2024-10-13 23:48:11,843 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-10-13 23:48:11,844 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 250 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:11,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 598 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 23:48:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8483 states. [2024-10-13 23:48:11,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8483 to 8181. [2024-10-13 23:48:11,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8181 states, 8180 states have (on average 1.1356968215158925) internal successors, (9290), 8180 states have internal predecessors, (9290), 0 states have call successors, (0), 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-10-13 23:48:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8181 states to 8181 states and 9290 transitions. [2024-10-13 23:48:11,914 INFO L78 Accepts]: Start accepts. Automaton has 8181 states and 9290 transitions. Word has length 409 [2024-10-13 23:48:11,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:11,914 INFO L471 AbstractCegarLoop]: Abstraction has 8181 states and 9290 transitions. [2024-10-13 23:48:11,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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-10-13 23:48:11,914 INFO L276 IsEmpty]: Start isEmpty. Operand 8181 states and 9290 transitions. [2024-10-13 23:48:11,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2024-10-13 23:48:11,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:11,917 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:48:11,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:48:11,918 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:11,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:11,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1497587632, now seen corresponding path program 1 times [2024-10-13 23:48:11,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:11,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797609437] [2024-10-13 23:48:11,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:11,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-13 23:48:12,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:12,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797609437] [2024-10-13 23:48:12,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797609437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:12,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:12,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:48:12,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841999055] [2024-10-13 23:48:12,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:12,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:12,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:12,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:12,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:12,150 INFO L87 Difference]: Start difference. First operand 8181 states and 9290 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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-10-13 23:48:13,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:13,318 INFO L93 Difference]: Finished difference Result 17856 states and 20651 transitions. [2024-10-13 23:48:13,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:13,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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 425 [2024-10-13 23:48:13,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:13,342 INFO L225 Difference]: With dead ends: 17856 [2024-10-13 23:48:13,342 INFO L226 Difference]: Without dead ends: 9975 [2024-10-13 23:48:13,350 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-10-13 23:48:13,351 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 245 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:13,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 616 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:48:13,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9975 states. [2024-10-13 23:48:13,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9975 to 9672. [2024-10-13 23:48:13,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9672 states, 9671 states have (on average 1.1267707579360977) internal successors, (10897), 9671 states have internal predecessors, (10897), 0 states have call successors, (0), 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-10-13 23:48:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9672 states to 9672 states and 10897 transitions. [2024-10-13 23:48:13,438 INFO L78 Accepts]: Start accepts. Automaton has 9672 states and 10897 transitions. Word has length 425 [2024-10-13 23:48:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:13,438 INFO L471 AbstractCegarLoop]: Abstraction has 9672 states and 10897 transitions. [2024-10-13 23:48:13,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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-10-13 23:48:13,439 INFO L276 IsEmpty]: Start isEmpty. Operand 9672 states and 10897 transitions. [2024-10-13 23:48:13,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2024-10-13 23:48:13,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:13,444 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:48:13,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:48:13,444 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:13,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:13,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1185316387, now seen corresponding path program 1 times [2024-10-13 23:48:13,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:13,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31069116] [2024-10-13 23:48:13,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:13,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-10-13 23:48:13,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:13,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31069116] [2024-10-13 23:48:13,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31069116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:13,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:13,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:48:13,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214211901] [2024-10-13 23:48:13,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:13,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:13,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:13,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:13,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:13,669 INFO L87 Difference]: Start difference. First operand 9672 states and 10897 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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-10-13 23:48:14,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:14,866 INFO L93 Difference]: Finished difference Result 21435 states and 24445 transitions. [2024-10-13 23:48:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:14,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 521 [2024-10-13 23:48:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:14,881 INFO L225 Difference]: With dead ends: 21435 [2024-10-13 23:48:14,882 INFO L226 Difference]: Without dead ends: 12063 [2024-10-13 23:48:14,891 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-10-13 23:48:14,892 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 357 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:14,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 444 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:48:14,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12063 states. [2024-10-13 23:48:14,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12063 to 12063. [2024-10-13 23:48:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12063 states, 12062 states have (on average 1.1321505554634388) internal successors, (13656), 12062 states have internal predecessors, (13656), 0 states have call successors, (0), 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-10-13 23:48:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12063 states to 12063 states and 13656 transitions. [2024-10-13 23:48:14,993 INFO L78 Accepts]: Start accepts. Automaton has 12063 states and 13656 transitions. Word has length 521 [2024-10-13 23:48:14,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:14,994 INFO L471 AbstractCegarLoop]: Abstraction has 12063 states and 13656 transitions. [2024-10-13 23:48:14,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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-10-13 23:48:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 12063 states and 13656 transitions. [2024-10-13 23:48:14,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2024-10-13 23:48:14,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:14,999 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:48:14,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:48:14,999 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:14,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:15,000 INFO L85 PathProgramCache]: Analyzing trace with hash -139081121, now seen corresponding path program 1 times [2024-10-13 23:48:15,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:15,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772302361] [2024-10-13 23:48:15,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:15,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-13 23:48:15,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:15,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772302361] [2024-10-13 23:48:15,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772302361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:15,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:15,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:48:15,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305504726] [2024-10-13 23:48:15,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:15,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:15,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:15,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:15,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:15,448 INFO L87 Difference]: Start difference. First operand 12063 states and 13656 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 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-10-13 23:48:16,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:16,782 INFO L93 Difference]: Finished difference Result 28624 states and 32701 transitions. [2024-10-13 23:48:16,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:16,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 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 545 [2024-10-13 23:48:16,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:16,800 INFO L225 Difference]: With dead ends: 28624 [2024-10-13 23:48:16,800 INFO L226 Difference]: Without dead ends: 16861 [2024-10-13 23:48:16,807 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-10-13 23:48:16,808 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 246 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:16,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 618 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:48:16,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16861 states. [2024-10-13 23:48:16,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16861 to 15953. [2024-10-13 23:48:16,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15953 states, 15952 states have (on average 1.125438816449348) internal successors, (17953), 15952 states have internal predecessors, (17953), 0 states have call successors, (0), 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-10-13 23:48:16,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15953 states to 15953 states and 17953 transitions. [2024-10-13 23:48:16,932 INFO L78 Accepts]: Start accepts. Automaton has 15953 states and 17953 transitions. Word has length 545 [2024-10-13 23:48:16,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:16,933 INFO L471 AbstractCegarLoop]: Abstraction has 15953 states and 17953 transitions. [2024-10-13 23:48:16,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 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-10-13 23:48:16,933 INFO L276 IsEmpty]: Start isEmpty. Operand 15953 states and 17953 transitions. [2024-10-13 23:48:16,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2024-10-13 23:48:16,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:16,940 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:48:16,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 23:48:16,941 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:16,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:16,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1714189343, now seen corresponding path program 1 times [2024-10-13 23:48:16,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:16,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921677876] [2024-10-13 23:48:16,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:16,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 608 proven. 39 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-10-13 23:48:17,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:17,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921677876] [2024-10-13 23:48:17,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921677876] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:48:17,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615089464] [2024-10-13 23:48:17,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:17,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:48:17,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:48:17,427 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-10-13 23:48:17,432 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-10-13 23:48:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:17,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 23:48:17,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:48:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 647 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-10-13 23:48:18,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:48:18,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615089464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:18,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:48:18,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:48:18,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500991827] [2024-10-13 23:48:18,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:18,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:48:18,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:18,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:48:18,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:48:18,378 INFO L87 Difference]: Start difference. First operand 15953 states and 17953 transitions. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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-10-13 23:48:19,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:19,859 INFO L93 Difference]: Finished difference Result 33702 states and 37865 transitions. [2024-10-13 23:48:19,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:48:19,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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 612 [2024-10-13 23:48:19,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:19,883 INFO L225 Difference]: With dead ends: 33702 [2024-10-13 23:48:19,883 INFO L226 Difference]: Without dead ends: 17451 [2024-10-13 23:48:19,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:48:19,897 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 316 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:19,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 388 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:48:19,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17451 states. [2024-10-13 23:48:20,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17451 to 16850. [2024-10-13 23:48:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16850 states, 16849 states have (on average 1.1204225770075376) internal successors, (18878), 16849 states have internal predecessors, (18878), 0 states have call successors, (0), 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-10-13 23:48:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16850 states to 16850 states and 18878 transitions. [2024-10-13 23:48:20,046 INFO L78 Accepts]: Start accepts. Automaton has 16850 states and 18878 transitions. Word has length 612 [2024-10-13 23:48:20,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:20,046 INFO L471 AbstractCegarLoop]: Abstraction has 16850 states and 18878 transitions. [2024-10-13 23:48:20,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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-10-13 23:48:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand 16850 states and 18878 transitions. [2024-10-13 23:48:20,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2024-10-13 23:48:20,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:20,055 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:48:20,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 23:48:20,256 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,SelfDestructingSolverStorable13 [2024-10-13 23:48:20,256 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:20,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:20,257 INFO L85 PathProgramCache]: Analyzing trace with hash -937086162, now seen corresponding path program 1 times [2024-10-13 23:48:20,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:20,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386189770] [2024-10-13 23:48:20,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:20,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 403 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-10-13 23:48:20,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:20,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386189770] [2024-10-13 23:48:20,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386189770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:20,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:20,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:48:20,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732314714] [2024-10-13 23:48:20,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:20,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:20,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:20,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:20,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:20,603 INFO L87 Difference]: Start difference. First operand 16850 states and 18878 transitions. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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-10-13 23:48:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:21,662 INFO L93 Difference]: Finished difference Result 33697 states and 37753 transitions. [2024-10-13 23:48:21,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:21,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 637 [2024-10-13 23:48:21,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:21,679 INFO L225 Difference]: With dead ends: 33697 [2024-10-13 23:48:21,679 INFO L226 Difference]: Without dead ends: 16848 [2024-10-13 23:48:21,690 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-10-13 23:48:21,691 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 464 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:21,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 69 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:48:21,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16848 states. [2024-10-13 23:48:21,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16848 to 16848. [2024-10-13 23:48:21,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16848 states, 16847 states have (on average 1.1203181575354662) internal successors, (18874), 16847 states have internal predecessors, (18874), 0 states have call successors, (0), 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-10-13 23:48:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16848 states to 16848 states and 18874 transitions. [2024-10-13 23:48:21,817 INFO L78 Accepts]: Start accepts. Automaton has 16848 states and 18874 transitions. Word has length 637 [2024-10-13 23:48:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:21,817 INFO L471 AbstractCegarLoop]: Abstraction has 16848 states and 18874 transitions. [2024-10-13 23:48:21,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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-10-13 23:48:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 16848 states and 18874 transitions. [2024-10-13 23:48:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2024-10-13 23:48:21,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:21,826 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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-10-13 23:48:21,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 23:48:21,826 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:21,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:21,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1695255698, now seen corresponding path program 1 times [2024-10-13 23:48:21,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:21,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778063470] [2024-10-13 23:48:21,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:21,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-10-13 23:48:22,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:22,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778063470] [2024-10-13 23:48:22,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778063470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:22,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:22,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:48:22,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393890406] [2024-10-13 23:48:22,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:22,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:22,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:22,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:22,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:22,446 INFO L87 Difference]: Start difference. First operand 16848 states and 18874 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-10-13 23:48:23,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:23,482 INFO L93 Difference]: Finished difference Result 33701 states and 37755 transitions. [2024-10-13 23:48:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:23,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 658 [2024-10-13 23:48:23,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:23,508 INFO L225 Difference]: With dead ends: 33701 [2024-10-13 23:48:23,509 INFO L226 Difference]: Without dead ends: 16854 [2024-10-13 23:48:23,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-13 23:48:23,520 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 335 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:23,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 169 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:48:23,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16854 states. [2024-10-13 23:48:23,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16854 to 16549. [2024-10-13 23:48:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16549 states, 16548 states have (on average 1.1123398598017888) internal successors, (18407), 16548 states have internal predecessors, (18407), 0 states have call successors, (0), 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-10-13 23:48:23,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16549 states to 16549 states and 18407 transitions. [2024-10-13 23:48:23,645 INFO L78 Accepts]: Start accepts. Automaton has 16549 states and 18407 transitions. Word has length 658 [2024-10-13 23:48:23,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:23,646 INFO L471 AbstractCegarLoop]: Abstraction has 16549 states and 18407 transitions. [2024-10-13 23:48:23,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-10-13 23:48:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 16549 states and 18407 transitions. [2024-10-13 23:48:23,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2024-10-13 23:48:23,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:23,654 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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] [2024-10-13 23:48:23,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 23:48:23,654 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:23,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:23,655 INFO L85 PathProgramCache]: Analyzing trace with hash -329861048, now seen corresponding path program 1 times [2024-10-13 23:48:23,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:23,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392861659] [2024-10-13 23:48:23,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:23,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:24,096 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2024-10-13 23:48:24,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:24,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392861659] [2024-10-13 23:48:24,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392861659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:24,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:24,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:48:24,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971115820] [2024-10-13 23:48:24,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:24,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:24,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:24,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:24,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:24,099 INFO L87 Difference]: Start difference. First operand 16549 states and 18407 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-10-13 23:48:26,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 23:48:27,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:27,043 INFO L93 Difference]: Finished difference Result 37306 states and 41605 transitions. [2024-10-13 23:48:27,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:27,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 682 [2024-10-13 23:48:27,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:27,063 INFO L225 Difference]: With dead ends: 37306 [2024-10-13 23:48:27,064 INFO L226 Difference]: Without dead ends: 20758 [2024-10-13 23:48:27,075 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-10-13 23:48:27,076 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 299 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:27,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 523 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 23:48:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20758 states. [2024-10-13 23:48:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20758 to 20144. [2024-10-13 23:48:27,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20144 states, 20143 states have (on average 1.1191480911482898) internal successors, (22543), 20143 states have internal predecessors, (22543), 0 states have call successors, (0), 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-10-13 23:48:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20144 states to 20144 states and 22543 transitions. [2024-10-13 23:48:27,234 INFO L78 Accepts]: Start accepts. Automaton has 20144 states and 22543 transitions. Word has length 682 [2024-10-13 23:48:27,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:27,235 INFO L471 AbstractCegarLoop]: Abstraction has 20144 states and 22543 transitions. [2024-10-13 23:48:27,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-10-13 23:48:27,235 INFO L276 IsEmpty]: Start isEmpty. Operand 20144 states and 22543 transitions. [2024-10-13 23:48:27,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2024-10-13 23:48:27,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:27,247 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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] [2024-10-13 23:48:27,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 23:48:27,247 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:27,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:27,248 INFO L85 PathProgramCache]: Analyzing trace with hash -665452666, now seen corresponding path program 1 times [2024-10-13 23:48:27,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:27,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369794795] [2024-10-13 23:48:27,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:27,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2024-10-13 23:48:27,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:27,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369794795] [2024-10-13 23:48:27,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369794795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:27,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:27,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:48:27,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270453474] [2024-10-13 23:48:27,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:27,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:27,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:27,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:27,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:27,891 INFO L87 Difference]: Start difference. First operand 20144 states and 22543 transitions. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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-10-13 23:48:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:29,320 INFO L93 Difference]: Finished difference Result 48944 states and 54790 transitions. [2024-10-13 23:48:29,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:29,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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 723 [2024-10-13 23:48:29,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:29,350 INFO L225 Difference]: With dead ends: 48944 [2024-10-13 23:48:29,350 INFO L226 Difference]: Without dead ends: 22821 [2024-10-13 23:48:29,365 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-10-13 23:48:29,366 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 305 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:29,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 515 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:48:29,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22821 states. [2024-10-13 23:48:29,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22821 to 19232. [2024-10-13 23:48:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19232 states, 19231 states have (on average 1.075867089594925) internal successors, (20690), 19231 states have internal predecessors, (20690), 0 states have call successors, (0), 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-10-13 23:48:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19232 states to 19232 states and 20690 transitions. [2024-10-13 23:48:29,551 INFO L78 Accepts]: Start accepts. Automaton has 19232 states and 20690 transitions. Word has length 723 [2024-10-13 23:48:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:29,551 INFO L471 AbstractCegarLoop]: Abstraction has 19232 states and 20690 transitions. [2024-10-13 23:48:29,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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-10-13 23:48:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 19232 states and 20690 transitions. [2024-10-13 23:48:29,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 900 [2024-10-13 23:48:29,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:29,564 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, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 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, 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] [2024-10-13 23:48:29,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 23:48:29,564 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:29,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:29,564 INFO L85 PathProgramCache]: Analyzing trace with hash 557576969, now seen corresponding path program 1 times [2024-10-13 23:48:29,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:29,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399703674] [2024-10-13 23:48:29,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:29,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 848 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-10-13 23:48:30,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:30,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399703674] [2024-10-13 23:48:30,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399703674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:30,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:30,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:48:30,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942868739] [2024-10-13 23:48:30,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:30,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:30,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:30,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:30,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:30,014 INFO L87 Difference]: Start difference. First operand 19232 states and 20690 transitions. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 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-10-13 23:48:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:31,048 INFO L93 Difference]: Finished difference Result 46236 states and 49629 transitions. [2024-10-13 23:48:31,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:31,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 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 899 [2024-10-13 23:48:31,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:31,073 INFO L225 Difference]: With dead ends: 46236 [2024-10-13 23:48:31,074 INFO L226 Difference]: Without dead ends: 27005 [2024-10-13 23:48:31,086 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-10-13 23:48:31,087 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 97 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:31,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 167 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:48:31,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27005 states. [2024-10-13 23:48:31,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27005 to 24314. [2024-10-13 23:48:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24314 states, 24313 states have (on average 1.0656438942129725) internal successors, (25909), 24313 states have internal predecessors, (25909), 0 states have call successors, (0), 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-10-13 23:48:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24314 states to 24314 states and 25909 transitions. [2024-10-13 23:48:31,274 INFO L78 Accepts]: Start accepts. Automaton has 24314 states and 25909 transitions. Word has length 899 [2024-10-13 23:48:31,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:31,274 INFO L471 AbstractCegarLoop]: Abstraction has 24314 states and 25909 transitions. [2024-10-13 23:48:31,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 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-10-13 23:48:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 24314 states and 25909 transitions. [2024-10-13 23:48:31,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2024-10-13 23:48:31,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:31,288 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:48:31,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 23:48:31,289 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:31,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:31,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1860084960, now seen corresponding path program 1 times [2024-10-13 23:48:31,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:31,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808794081] [2024-10-13 23:48:31,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:31,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 792 proven. 0 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-10-13 23:48:31,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:31,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808794081] [2024-10-13 23:48:31,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808794081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:31,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:31,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:48:31,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450988194] [2024-10-13 23:48:31,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:31,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:31,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:31,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:31,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:31,675 INFO L87 Difference]: Start difference. First operand 24314 states and 25909 transitions. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 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-10-13 23:48:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:32,457 INFO L93 Difference]: Finished difference Result 49523 states and 52752 transitions. [2024-10-13 23:48:32,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:32,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 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 955 [2024-10-13 23:48:32,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:32,480 INFO L225 Difference]: With dead ends: 49523 [2024-10-13 23:48:32,480 INFO L226 Difference]: Without dead ends: 25210 [2024-10-13 23:48:32,494 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-10-13 23:48:32,495 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 312 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:32,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 554 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:48:32,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25210 states. [2024-10-13 23:48:32,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25210 to 24313. [2024-10-13 23:48:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24313 states, 24312 states have (on average 1.0656054623231326) internal successors, (25907), 24312 states have internal predecessors, (25907), 0 states have call successors, (0), 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-10-13 23:48:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24313 states to 24313 states and 25907 transitions. [2024-10-13 23:48:32,675 INFO L78 Accepts]: Start accepts. Automaton has 24313 states and 25907 transitions. Word has length 955 [2024-10-13 23:48:32,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:32,676 INFO L471 AbstractCegarLoop]: Abstraction has 24313 states and 25907 transitions. [2024-10-13 23:48:32,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 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-10-13 23:48:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 24313 states and 25907 transitions. [2024-10-13 23:48:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 990 [2024-10-13 23:48:32,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:32,689 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, 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, 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, 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, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:48:32,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 23:48:32,689 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:32,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:32,690 INFO L85 PathProgramCache]: Analyzing trace with hash 669109060, now seen corresponding path program 1 times [2024-10-13 23:48:32,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:32,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844055379] [2024-10-13 23:48:32,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:32,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1472 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 1249 trivial. 0 not checked. [2024-10-13 23:48:33,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:33,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844055379] [2024-10-13 23:48:33,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844055379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:33,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:33,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:48:33,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276192570] [2024-10-13 23:48:33,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:33,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:33,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:33,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:33,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:33,314 INFO L87 Difference]: Start difference. First operand 24313 states and 25907 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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-10-13 23:48:34,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:34,444 INFO L93 Difference]: Finished difference Result 51031 states and 54305 transitions. [2024-10-13 23:48:34,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:34,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 989 [2024-10-13 23:48:34,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:34,446 INFO L225 Difference]: With dead ends: 51031 [2024-10-13 23:48:34,446 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 23:48:34,462 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-10-13 23:48:34,463 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 296 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:34,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 433 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:48:34,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 23:48:34,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 23:48:34,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-10-13 23:48:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 23:48:34,464 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 989 [2024-10-13 23:48:34,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:34,465 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 23:48:34,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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-10-13 23:48:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 23:48:34,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 23:48:34,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 23:48:34,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 23:48:34,470 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:48:34,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 23:48:36,663 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 23:48:36,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:48:36 BoogieIcfgContainer [2024-10-13 23:48:36,685 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 23:48:36,686 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 23:48:36,686 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 23:48:36,686 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 23:48:36,686 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:47:55" (3/4) ... [2024-10-13 23:48:36,688 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 23:48:36,708 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-13 23:48:36,710 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 23:48:36,711 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 23:48:36,713 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 23:48:36,908 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 23:48:36,909 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 23:48:36,909 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 23:48:36,909 INFO L158 Benchmark]: Toolchain (without parser) took 45111.52ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 91.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 525.7MB. Max. memory is 16.1GB. [2024-10-13 23:48:36,909 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 23:48:36,909 INFO L158 Benchmark]: CACSL2BoogieTranslator took 745.67ms. Allocated memory is still 167.8MB. Free memory was 91.1MB in the beginning and 62.9MB in the end (delta: 28.2MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. [2024-10-13 23:48:36,909 INFO L158 Benchmark]: Boogie Procedure Inliner took 224.65ms. Allocated memory was 167.8MB in the beginning and 249.6MB in the end (delta: 81.8MB). Free memory was 61.9MB in the beginning and 183.5MB in the end (delta: -121.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 23:48:36,910 INFO L158 Benchmark]: Boogie Preprocessor took 217.00ms. Allocated memory is still 249.6MB. Free memory was 183.5MB in the beginning and 124.8MB in the end (delta: 58.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-10-13 23:48:36,910 INFO L158 Benchmark]: RCFGBuilder took 2220.56ms. Allocated memory is still 249.6MB. Free memory was 124.8MB in the beginning and 131.9MB in the end (delta: -7.1MB). Peak memory consumption was 94.0MB. Max. memory is 16.1GB. [2024-10-13 23:48:36,913 INFO L158 Benchmark]: TraceAbstraction took 41475.99ms. Allocated memory was 249.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 131.9MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-10-13 23:48:36,913 INFO L158 Benchmark]: Witness Printer took 222.82ms. Allocated memory is still 1.7GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 23:48:36,914 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 745.67ms. Allocated memory is still 167.8MB. Free memory was 91.1MB in the beginning and 62.9MB in the end (delta: 28.2MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 224.65ms. Allocated memory was 167.8MB in the beginning and 249.6MB in the end (delta: 81.8MB). Free memory was 61.9MB in the beginning and 183.5MB in the end (delta: -121.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 217.00ms. Allocated memory is still 249.6MB. Free memory was 183.5MB in the beginning and 124.8MB in the end (delta: 58.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2220.56ms. Allocated memory is still 249.6MB. Free memory was 124.8MB in the beginning and 131.9MB in the end (delta: -7.1MB). Peak memory consumption was 94.0MB. Max. memory is 16.1GB. * TraceAbstraction took 41475.99ms. Allocated memory was 249.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 131.9MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 222.82ms. Allocated memory is still 1.7GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 191]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 362 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.2s, OverallIterations: 21, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 28.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5649 SdHoareTripleChecker+Valid, 26.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5649 mSDsluCounter, 8706 SdHoareTripleChecker+Invalid, 22.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 752 mSDsCounter, 3554 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20209 IncrementalHoareTripleChecker+Invalid, 23763 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3554 mSolverCounterUnsat, 7954 mSDtfsCounter, 20209 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 672 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24314occurred in iteration=19, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 12939 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 10556 NumberOfCodeBlocks, 10556 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 10534 ConstructedInterpolants, 0 QuantifiedInterpolants, 21736 SizeOfPredicates, 0 NumberOfNonLiveVariables, 747 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 22 InterpolantComputations, 21 PerfectInterpolantSequences, 11464/11503 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Loop Invariant Derived loop invariant: (((((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a0 + 60))) && (((long long) a29 + 127) <= 0)) || ((0 <= ((long long) 57 + a29)) && (((long long) 89 + a4) <= 0))) || ((2 == a2) && (44 <= a29))) || ((((long long) 42 + a4) <= 0) && (2 != a2))) || ((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85)))) || ((((long long) 89 + a4) <= 0) && (0 <= ((long long) a0 + 60)))) || ((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0))) RESULT: Ultimate proved your program to be correct! [2024-10-13 23:48:36,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE