./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.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 a82391ebb044799bad480df1878c271ded14d474016d9ad90c3e7a554ae5460f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:59:49,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:59:49,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:59:49,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:59:49,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:59:49,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:59:49,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:59:49,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:59:49,750 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:59:49,751 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:59:49,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:59:49,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:59:49,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:59:49,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:59:49,755 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:59:49,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:59:49,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:59:49,756 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:59:49,757 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:59:49,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:59:49,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:59:49,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:59:49,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:59:49,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:59:49,762 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:59:49,763 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:59:49,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:59:49,763 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:59:49,763 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:59:49,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:59:49,764 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:59:49,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:59:49,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:59:49,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:59:49,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:59:49,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:59:49,765 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:59:49,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:59:49,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:59:49,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:59:49,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:59:49,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:59:49,771 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 -> a82391ebb044799bad480df1878c271ded14d474016d9ad90c3e7a554ae5460f [2024-11-08 15:59:50,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:59:50,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:59:50,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:59:50,084 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:59:50,084 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:59:50,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-11-08 15:59:51,585 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:59:51,788 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:59:51,789 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-11-08 15:59:51,799 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd656ef87/fe5e3b199c1642e9a2da02dc348dfd1d/FLAGfa5656e72 [2024-11-08 15:59:51,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd656ef87/fe5e3b199c1642e9a2da02dc348dfd1d [2024-11-08 15:59:51,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:59:51,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:59:51,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:59:51,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:59:51,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:59:51,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:59:51" (1/1) ... [2024-11-08 15:59:51,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c384041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:51, skipping insertion in model container [2024-11-08 15:59:51,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:59:51" (1/1) ... [2024-11-08 15:59:51,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:59:52,078 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4067,4080] [2024-11-08 15:59:52,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:59:52,117 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:59:52,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4067,4080] [2024-11-08 15:59:52,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:59:52,177 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:59:52,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:52 WrapperNode [2024-11-08 15:59:52,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:59:52,180 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:59:52,180 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:59:52,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:59:52,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:52" (1/1) ... [2024-11-08 15:59:52,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:52" (1/1) ... [2024-11-08 15:59:52,223 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 295 [2024-11-08 15:59:52,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:59:52,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:59:52,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:59:52,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:59:52,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:52" (1/1) ... [2024-11-08 15:59:52,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:52" (1/1) ... [2024-11-08 15:59:52,239 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:52" (1/1) ... [2024-11-08 15:59:52,266 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:59:52,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:52" (1/1) ... [2024-11-08 15:59:52,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:52" (1/1) ... [2024-11-08 15:59:52,275 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:52" (1/1) ... [2024-11-08 15:59:52,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:52" (1/1) ... [2024-11-08 15:59:52,282 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:52" (1/1) ... [2024-11-08 15:59:52,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:52" (1/1) ... [2024-11-08 15:59:52,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:59:52,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:59:52,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:59:52,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:59:52,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:52" (1/1) ... [2024-11-08 15:59:52,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:59:52,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:59:52,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:59:52,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:59:52,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:59:52,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:59:52,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:59:52,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:59:52,501 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:59:52,503 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:59:52,857 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-08 15:59:52,859 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:59:52,894 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:59:52,894 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:59:52,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:59:52 BoogieIcfgContainer [2024-11-08 15:59:52,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:59:52,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:59:52,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:59:52,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:59:52,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:59:51" (1/3) ... [2024-11-08 15:59:52,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56678985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:59:52, skipping insertion in model container [2024-11-08 15:59:52,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:52" (2/3) ... [2024-11-08 15:59:52,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56678985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:59:52, skipping insertion in model container [2024-11-08 15:59:52,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:59:52" (3/3) ... [2024-11-08 15:59:52,909 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-11-08 15:59:52,935 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:59:52,935 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:59:52,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:59:53,001 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;@7bb70bb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:59:53,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:59:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 61 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:53,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 15:59:53,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:53,013 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] [2024-11-08 15:59:53,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:53,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1007825277, now seen corresponding path program 1 times [2024-11-08 15:59:53,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:53,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116840306] [2024-11-08 15:59:53,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:53,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:53,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:53,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116840306] [2024-11-08 15:59:53,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116840306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:53,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:53,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:59:53,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424795166] [2024-11-08 15:59:53,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:53,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:59:53,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:53,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:59:53,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:53,441 INFO L87 Difference]: Start difference. First operand has 62 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 61 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:53,502 INFO L93 Difference]: Finished difference Result 140 states and 224 transitions. [2024-11-08 15:59:53,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:59:53,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-11-08 15:59:53,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:53,515 INFO L225 Difference]: With dead ends: 140 [2024-11-08 15:59:53,516 INFO L226 Difference]: Without dead ends: 91 [2024-11-08 15:59:53,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:53,523 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 68 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:53,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 215 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:53,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-08 15:59:53,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2024-11-08 15:59:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 88 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 130 transitions. [2024-11-08 15:59:53,561 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 130 transitions. Word has length 36 [2024-11-08 15:59:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:53,561 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 130 transitions. [2024-11-08 15:59:53,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:53,562 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 130 transitions. [2024-11-08 15:59:53,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 15:59:53,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:53,563 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] [2024-11-08 15:59:53,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:59:53,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:53,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:53,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1176817218, now seen corresponding path program 1 times [2024-11-08 15:59:53,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:53,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117810940] [2024-11-08 15:59:53,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:53,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:53,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:53,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:53,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117810940] [2024-11-08 15:59:53,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117810940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:53,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:53,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:59:53,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40308202] [2024-11-08 15:59:53,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:53,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:59:53,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:53,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:59:53,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:53,749 INFO L87 Difference]: Start difference. First operand 89 states and 130 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:53,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:53,775 INFO L93 Difference]: Finished difference Result 213 states and 326 transitions. [2024-11-08 15:59:53,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:59:53,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-08 15:59:53,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:53,778 INFO L225 Difference]: With dead ends: 213 [2024-11-08 15:59:53,778 INFO L226 Difference]: Without dead ends: 143 [2024-11-08 15:59:53,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:53,780 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 48 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:53,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 182 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:53,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-08 15:59:53,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-11-08 15:59:53,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.5142857142857142) internal successors, (212), 140 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:53,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2024-11-08 15:59:53,795 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 37 [2024-11-08 15:59:53,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:53,796 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2024-11-08 15:59:53,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:53,796 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2024-11-08 15:59:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 15:59:53,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:53,798 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] [2024-11-08 15:59:53,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:59:53,798 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:53,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:53,799 INFO L85 PathProgramCache]: Analyzing trace with hash 761408425, now seen corresponding path program 1 times [2024-11-08 15:59:53,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:53,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832601851] [2024-11-08 15:59:53,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:53,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:53,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:53,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832601851] [2024-11-08 15:59:53,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832601851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:53,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:53,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:59:53,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937143381] [2024-11-08 15:59:53,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:53,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:59:53,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:53,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:59:53,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:53,919 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:53,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:53,959 INFO L93 Difference]: Finished difference Result 353 states and 546 transitions. [2024-11-08 15:59:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:59:53,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-11-08 15:59:53,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:53,966 INFO L225 Difference]: With dead ends: 353 [2024-11-08 15:59:53,966 INFO L226 Difference]: Without dead ends: 231 [2024-11-08 15:59:53,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:53,970 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 43 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:53,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:53,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-08 15:59:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2024-11-08 15:59:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.5263157894736843) internal successors, (348), 228 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:53,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 348 transitions. [2024-11-08 15:59:53,989 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 348 transitions. Word has length 38 [2024-11-08 15:59:53,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:53,989 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 348 transitions. [2024-11-08 15:59:53,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 348 transitions. [2024-11-08 15:59:53,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 15:59:53,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:53,990 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] [2024-11-08 15:59:53,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:59:53,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:53,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:53,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2014631486, now seen corresponding path program 1 times [2024-11-08 15:59:53,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:53,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609768763] [2024-11-08 15:59:53,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:53,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:54,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:54,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609768763] [2024-11-08 15:59:54,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609768763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:54,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:54,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:59:54,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570892987] [2024-11-08 15:59:54,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:54,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:59:54,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:54,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:59:54,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:59:54,152 INFO L87 Difference]: Start difference. First operand 229 states and 348 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:54,299 INFO L93 Difference]: Finished difference Result 1489 states and 2322 transitions. [2024-11-08 15:59:54,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:59:54,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-08 15:59:54,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:54,309 INFO L225 Difference]: With dead ends: 1489 [2024-11-08 15:59:54,309 INFO L226 Difference]: Without dead ends: 1279 [2024-11-08 15:59:54,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:59:54,312 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 423 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:54,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 419 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:59:54,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2024-11-08 15:59:54,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 437. [2024-11-08 15:59:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.5137614678899083) internal successors, (660), 436 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 660 transitions. [2024-11-08 15:59:54,374 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 660 transitions. Word has length 39 [2024-11-08 15:59:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:54,375 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 660 transitions. [2024-11-08 15:59:54,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 660 transitions. [2024-11-08 15:59:54,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 15:59:54,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:54,377 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] [2024-11-08 15:59:54,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:59:54,377 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:54,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:54,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1891215654, now seen corresponding path program 1 times [2024-11-08 15:59:54,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:54,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251404396] [2024-11-08 15:59:54,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:54,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:54,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:54,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251404396] [2024-11-08 15:59:54,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251404396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:54,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:54,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:59:54,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674902732] [2024-11-08 15:59:54,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:54,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:59:54,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:54,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:59:54,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:54,464 INFO L87 Difference]: Start difference. First operand 437 states and 660 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:54,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:54,495 INFO L93 Difference]: Finished difference Result 1055 states and 1604 transitions. [2024-11-08 15:59:54,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:59:54,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-11-08 15:59:54,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:54,498 INFO L225 Difference]: With dead ends: 1055 [2024-11-08 15:59:54,498 INFO L226 Difference]: Without dead ends: 637 [2024-11-08 15:59:54,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:54,500 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 34 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:54,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 154 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-08 15:59:54,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 635. [2024-11-08 15:59:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.498422712933754) internal successors, (950), 634 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 950 transitions. [2024-11-08 15:59:54,516 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 950 transitions. Word has length 41 [2024-11-08 15:59:54,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:54,517 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 950 transitions. [2024-11-08 15:59:54,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:54,517 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 950 transitions. [2024-11-08 15:59:54,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 15:59:54,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:54,518 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] [2024-11-08 15:59:54,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:59:54,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:54,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:54,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1870212999, now seen corresponding path program 1 times [2024-11-08 15:59:54,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:54,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53137033] [2024-11-08 15:59:54,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:54,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:54,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:54,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53137033] [2024-11-08 15:59:54,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53137033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:54,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:54,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:59:54,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139410824] [2024-11-08 15:59:54,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:54,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:59:54,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:54,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:59:54,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:59:54,820 INFO L87 Difference]: Start difference. First operand 635 states and 950 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:54,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:54,891 INFO L93 Difference]: Finished difference Result 1251 states and 1880 transitions. [2024-11-08 15:59:54,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:59:54,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-11-08 15:59:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:54,896 INFO L225 Difference]: With dead ends: 1251 [2024-11-08 15:59:54,897 INFO L226 Difference]: Without dead ends: 637 [2024-11-08 15:59:54,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:59:54,899 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 82 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:54,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 195 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:54,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-08 15:59:54,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 635. [2024-11-08 15:59:54,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.4794952681388012) internal successors, (938), 634 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 938 transitions. [2024-11-08 15:59:54,920 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 938 transitions. Word has length 41 [2024-11-08 15:59:54,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:54,921 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 938 transitions. [2024-11-08 15:59:54,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:54,922 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 938 transitions. [2024-11-08 15:59:54,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 15:59:54,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:54,922 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] [2024-11-08 15:59:54,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:59:54,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:54,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:54,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2143937547, now seen corresponding path program 1 times [2024-11-08 15:59:54,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:54,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875276958] [2024-11-08 15:59:54,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:54,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:55,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:55,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875276958] [2024-11-08 15:59:55,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875276958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:55,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:55,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:59:55,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050900629] [2024-11-08 15:59:55,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:55,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:59:55,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:55,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:59:55,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:59:55,039 INFO L87 Difference]: Start difference. First operand 635 states and 938 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:55,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:55,103 INFO L93 Difference]: Finished difference Result 1249 states and 1855 transitions. [2024-11-08 15:59:55,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:59:55,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-11-08 15:59:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:55,106 INFO L225 Difference]: With dead ends: 1249 [2024-11-08 15:59:55,106 INFO L226 Difference]: Without dead ends: 635 [2024-11-08 15:59:55,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:59:55,111 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 200 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:55,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 61 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:55,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-08 15:59:55,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2024-11-08 15:59:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.4605678233438486) internal successors, (926), 634 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:55,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 926 transitions. [2024-11-08 15:59:55,124 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 926 transitions. Word has length 42 [2024-11-08 15:59:55,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:55,124 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 926 transitions. [2024-11-08 15:59:55,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:55,124 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 926 transitions. [2024-11-08 15:59:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 15:59:55,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:55,129 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] [2024-11-08 15:59:55,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:59:55,129 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:55,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:55,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1278405158, now seen corresponding path program 1 times [2024-11-08 15:59:55,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:55,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342115405] [2024-11-08 15:59:55,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:55,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:55,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:55,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342115405] [2024-11-08 15:59:55,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342115405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:55,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:55,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:59:55,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669215232] [2024-11-08 15:59:55,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:55,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:59:55,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:55,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:59:55,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:59:55,403 INFO L87 Difference]: Start difference. First operand 635 states and 926 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:55,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:55,427 INFO L93 Difference]: Finished difference Result 669 states and 975 transitions. [2024-11-08 15:59:55,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:59:55,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-11-08 15:59:55,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:55,430 INFO L225 Difference]: With dead ends: 669 [2024-11-08 15:59:55,431 INFO L226 Difference]: Without dead ends: 667 [2024-11-08 15:59:55,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:59:55,432 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:55,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:55,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-11-08 15:59:55,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2024-11-08 15:59:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 1.4324324324324325) internal successors, (954), 666 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 954 transitions. [2024-11-08 15:59:55,461 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 954 transitions. Word has length 42 [2024-11-08 15:59:55,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:55,462 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 954 transitions. [2024-11-08 15:59:55,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:55,463 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 954 transitions. [2024-11-08 15:59:55,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 15:59:55,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:55,465 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 15:59:55,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:59:55,466 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:55,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:55,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1616122195, now seen corresponding path program 1 times [2024-11-08 15:59:55,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:55,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360124655] [2024-11-08 15:59:55,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:55,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 15:59:55,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:55,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360124655] [2024-11-08 15:59:55,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360124655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:55,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:55,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:59:55,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851460509] [2024-11-08 15:59:55,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:55,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:59:55,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:55,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:59:55,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:59:55,610 INFO L87 Difference]: Start difference. First operand 667 states and 954 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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-11-08 15:59:55,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:55,684 INFO L93 Difference]: Finished difference Result 2735 states and 3928 transitions. [2024-11-08 15:59:55,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:59:55,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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 60 [2024-11-08 15:59:55,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:55,695 INFO L225 Difference]: With dead ends: 2735 [2024-11-08 15:59:55,695 INFO L226 Difference]: Without dead ends: 2089 [2024-11-08 15:59:55,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:59:55,697 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 213 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:55,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 325 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2024-11-08 15:59:55,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1311. [2024-11-08 15:59:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1310 states have (on average 1.4305343511450381) internal successors, (1874), 1310 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1874 transitions. [2024-11-08 15:59:55,733 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1874 transitions. Word has length 60 [2024-11-08 15:59:55,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:55,733 INFO L471 AbstractCegarLoop]: Abstraction has 1311 states and 1874 transitions. [2024-11-08 15:59:55,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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-11-08 15:59:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1874 transitions. [2024-11-08 15:59:55,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 15:59:55,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:55,736 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 15:59:55,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:59:55,736 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:55,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:55,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1524898995, now seen corresponding path program 1 times [2024-11-08 15:59:55,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:55,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322578791] [2024-11-08 15:59:55,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:55,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:59:55,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:55,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322578791] [2024-11-08 15:59:55,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322578791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:55,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:55,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:59:55,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920535993] [2024-11-08 15:59:55,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:55,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:59:55,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:55,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:59:55,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:59:55,869 INFO L87 Difference]: Start difference. First operand 1311 states and 1874 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:55,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:55,940 INFO L93 Difference]: Finished difference Result 3379 states and 4848 transitions. [2024-11-08 15:59:55,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:59:55,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-08 15:59:55,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:55,950 INFO L225 Difference]: With dead ends: 3379 [2024-11-08 15:59:55,950 INFO L226 Difference]: Without dead ends: 2733 [2024-11-08 15:59:55,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:59:55,953 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 208 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:55,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 355 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:55,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2024-11-08 15:59:55,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2279. [2024-11-08 15:59:55,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2279 states, 2278 states have (on average 1.4240561896400352) internal successors, (3244), 2278 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:56,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3244 transitions. [2024-11-08 15:59:56,001 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3244 transitions. Word has length 60 [2024-11-08 15:59:56,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:56,001 INFO L471 AbstractCegarLoop]: Abstraction has 2279 states and 3244 transitions. [2024-11-08 15:59:56,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3244 transitions. [2024-11-08 15:59:56,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 15:59:56,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:56,002 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 15:59:56,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:59:56,003 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:56,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:56,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1912167623, now seen corresponding path program 1 times [2024-11-08 15:59:56,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:56,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409901441] [2024-11-08 15:59:56,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:56,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 15:59:56,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:56,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409901441] [2024-11-08 15:59:56,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409901441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:56,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:56,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:59:56,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618915366] [2024-11-08 15:59:56,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:56,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:59:56,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:56,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:59:56,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:59:56,116 INFO L87 Difference]: Start difference. First operand 2279 states and 3244 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:56,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:56,189 INFO L93 Difference]: Finished difference Result 3631 states and 5216 transitions. [2024-11-08 15:59:56,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:59:56,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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 60 [2024-11-08 15:59:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:56,201 INFO L225 Difference]: With dead ends: 3631 [2024-11-08 15:59:56,201 INFO L226 Difference]: Without dead ends: 3181 [2024-11-08 15:59:56,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:59:56,205 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 207 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:56,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 330 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:56,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2024-11-08 15:59:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 2727. [2024-11-08 15:59:56,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2727 states, 2726 states have (on average 1.4277329420396185) internal successors, (3892), 2726 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:56,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2727 states to 2727 states and 3892 transitions. [2024-11-08 15:59:56,264 INFO L78 Accepts]: Start accepts. Automaton has 2727 states and 3892 transitions. Word has length 60 [2024-11-08 15:59:56,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:56,264 INFO L471 AbstractCegarLoop]: Abstraction has 2727 states and 3892 transitions. [2024-11-08 15:59:56,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:56,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2727 states and 3892 transitions. [2024-11-08 15:59:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 15:59:56,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:56,266 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:59:56,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:59:56,266 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:56,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:56,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1791952020, now seen corresponding path program 1 times [2024-11-08 15:59:56,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:56,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494516898] [2024-11-08 15:59:56,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:56,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:56,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:56,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494516898] [2024-11-08 15:59:56,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494516898] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:59:56,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816239006] [2024-11-08 15:59:56,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:56,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:59:56,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:59:56,564 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:59:56,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:59:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:56,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 15:59:56,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:59:57,213 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:57,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:59:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:57,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816239006] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:59:57,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:59:57,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-08 15:59:57,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014109612] [2024-11-08 15:59:57,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:59:57,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 15:59:57,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:57,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 15:59:57,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2024-11-08 15:59:57,895 INFO L87 Difference]: Start difference. First operand 2727 states and 3892 transitions. Second operand has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 22 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:58,574 INFO L93 Difference]: Finished difference Result 9729 states and 13803 transitions. [2024-11-08 15:59:58,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 15:59:58,575 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 22 states have internal predecessors, (139), 0 states have call successors, (0), 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 61 [2024-11-08 15:59:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:58,596 INFO L225 Difference]: With dead ends: 9729 [2024-11-08 15:59:58,597 INFO L226 Difference]: Without dead ends: 7023 [2024-11-08 15:59:58,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=355, Invalid=1051, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 15:59:58,603 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 596 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:58,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 556 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 15:59:58,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7023 states. [2024-11-08 15:59:58,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7023 to 5817. [2024-11-08 15:59:58,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5817 states, 5816 states have (on average 1.4126547455295735) internal successors, (8216), 5816 states have internal predecessors, (8216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5817 states to 5817 states and 8216 transitions. [2024-11-08 15:59:58,710 INFO L78 Accepts]: Start accepts. Automaton has 5817 states and 8216 transitions. Word has length 61 [2024-11-08 15:59:58,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:58,710 INFO L471 AbstractCegarLoop]: Abstraction has 5817 states and 8216 transitions. [2024-11-08 15:59:58,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 22 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 5817 states and 8216 transitions. [2024-11-08 15:59:58,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 15:59:58,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:58,712 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:59:58,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 15:59:58,913 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,SelfDestructingSolverStorable11 [2024-11-08 15:59:58,913 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:58,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:58,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2085128461, now seen corresponding path program 1 times [2024-11-08 15:59:58,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:58,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917092290] [2024-11-08 15:59:58,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:58,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 15:59:59,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:59,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917092290] [2024-11-08 15:59:59,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917092290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:59:59,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640417180] [2024-11-08 15:59:59,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:59,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:59:59,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:59:59,095 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:59:59,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 15:59:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:59,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 15:59:59,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:59:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 15:59:59,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:59:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 15:59:59,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640417180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:59:59,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:59:59,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2024-11-08 15:59:59,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926056979] [2024-11-08 15:59:59,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:59:59,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 15:59:59,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:59,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 15:59:59,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:59:59,592 INFO L87 Difference]: Start difference. First operand 5817 states and 8216 transitions. Second operand has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:59,681 INFO L93 Difference]: Finished difference Result 17175 states and 24494 transitions. [2024-11-08 15:59:59,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:59:59,682 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 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 62 [2024-11-08 15:59:59,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:59,723 INFO L225 Difference]: With dead ends: 17175 [2024-11-08 15:59:59,723 INFO L226 Difference]: Without dead ends: 12889 [2024-11-08 15:59:59,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:59:59,734 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 281 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:59,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 470 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12889 states. [2024-11-08 15:59:59,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12889 to 12883. [2024-11-08 15:59:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12883 states, 12882 states have (on average 1.3861201676758268) internal successors, (17856), 12882 states have internal predecessors, (17856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12883 states to 12883 states and 17856 transitions. [2024-11-08 15:59:59,978 INFO L78 Accepts]: Start accepts. Automaton has 12883 states and 17856 transitions. Word has length 62 [2024-11-08 15:59:59,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:59,979 INFO L471 AbstractCegarLoop]: Abstraction has 12883 states and 17856 transitions. [2024-11-08 15:59:59,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:59,979 INFO L276 IsEmpty]: Start isEmpty. Operand 12883 states and 17856 transitions. [2024-11-08 15:59:59,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 15:59:59,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:59,982 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:00:00,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 16:00:00,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 16:00:00,183 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:00:00,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:00,183 INFO L85 PathProgramCache]: Analyzing trace with hash 653717303, now seen corresponding path program 1 times [2024-11-08 16:00:00,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:00,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058199858] [2024-11-08 16:00:00,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:00,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:00,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:00,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058199858] [2024-11-08 16:00:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058199858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:00:00,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004144207] [2024-11-08 16:00:00,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:00,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:00:00,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:00:00,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:00:00,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 16:00:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:00,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 16:00:00,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:00:01,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:01,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:00:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:01,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004144207] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:00:01,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:00:01,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-08 16:00:01,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971728543] [2024-11-08 16:00:01,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:00:01,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 16:00:01,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:01,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 16:00:01,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-11-08 16:00:01,514 INFO L87 Difference]: Start difference. First operand 12883 states and 17856 transitions. Second operand has 21 states, 21 states have (on average 6.380952380952381) internal successors, (134), 20 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:02,459 INFO L93 Difference]: Finished difference Result 63807 states and 88525 transitions. [2024-11-08 16:00:02,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 16:00:02,460 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.380952380952381) internal successors, (134), 20 states have internal predecessors, (134), 0 states have call successors, (0), 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 62 [2024-11-08 16:00:02,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:02,569 INFO L225 Difference]: With dead ends: 63807 [2024-11-08 16:00:02,569 INFO L226 Difference]: Without dead ends: 50945 [2024-11-08 16:00:02,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=428, Invalid=1294, Unknown=0, NotChecked=0, Total=1722 [2024-11-08 16:00:02,601 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 1249 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:02,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1249 Valid, 467 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:00:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50945 states. [2024-11-08 16:00:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50945 to 29627. [2024-11-08 16:00:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29627 states, 29626 states have (on average 1.3616080469857557) internal successors, (40339), 29626 states have internal predecessors, (40339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:03,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29627 states to 29627 states and 40339 transitions. [2024-11-08 16:00:03,310 INFO L78 Accepts]: Start accepts. Automaton has 29627 states and 40339 transitions. Word has length 62 [2024-11-08 16:00:03,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:03,311 INFO L471 AbstractCegarLoop]: Abstraction has 29627 states and 40339 transitions. [2024-11-08 16:00:03,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.380952380952381) internal successors, (134), 20 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:03,311 INFO L276 IsEmpty]: Start isEmpty. Operand 29627 states and 40339 transitions. [2024-11-08 16:00:03,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 16:00:03,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:03,313 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:00:03,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 16:00:03,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:00:03,514 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:00:03,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:03,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1807663409, now seen corresponding path program 1 times [2024-11-08 16:00:03,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:03,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573562750] [2024-11-08 16:00:03,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:03,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:04,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:04,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573562750] [2024-11-08 16:00:04,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573562750] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:00:04,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43563773] [2024-11-08 16:00:04,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:04,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:00:04,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:00:04,024 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:00:04,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 16:00:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:04,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 16:00:04,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:00:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:05,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:00:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:05,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43563773] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:00:05,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:00:05,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-11-08 16:00:05,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201103264] [2024-11-08 16:00:05,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:00:05,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 16:00:05,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:05,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 16:00:05,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2024-11-08 16:00:05,815 INFO L87 Difference]: Start difference. First operand 29627 states and 40339 transitions. Second operand has 32 states, 32 states have (on average 5.28125) internal successors, (169), 32 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:34,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:34,819 INFO L93 Difference]: Finished difference Result 466146 states and 641922 transitions. [2024-11-08 16:00:34,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 527 states. [2024-11-08 16:00:34,819 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.28125) internal successors, (169), 32 states have internal predecessors, (169), 0 states have call successors, (0), 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 62 [2024-11-08 16:00:34,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:35,805 INFO L225 Difference]: With dead ends: 466146 [2024-11-08 16:00:35,805 INFO L226 Difference]: Without dead ends: 436540 [2024-11-08 16:00:36,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 555 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148097 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=27805, Invalid=281887, Unknown=0, NotChecked=0, Total=309692 [2024-11-08 16:00:36,098 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 19057 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 2939 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19057 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 3232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 2939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:36,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19057 Valid, 1855 Invalid, 3232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 2939 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 16:00:36,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436540 states. [2024-11-08 16:00:39,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436540 to 116008. [2024-11-08 16:00:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116008 states, 116007 states have (on average 1.3753911401898162) internal successors, (159555), 116007 states have internal predecessors, (159555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116008 states to 116008 states and 159555 transitions. [2024-11-08 16:00:39,994 INFO L78 Accepts]: Start accepts. Automaton has 116008 states and 159555 transitions. Word has length 62 [2024-11-08 16:00:39,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:39,995 INFO L471 AbstractCegarLoop]: Abstraction has 116008 states and 159555 transitions. [2024-11-08 16:00:39,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.28125) internal successors, (169), 32 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 116008 states and 159555 transitions. [2024-11-08 16:00:40,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 16:00:40,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:40,004 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 16:00:40,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 16:00:40,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 16:00:40,205 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:00:40,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:40,205 INFO L85 PathProgramCache]: Analyzing trace with hash -196942823, now seen corresponding path program 1 times [2024-11-08 16:00:40,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:40,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098757012] [2024-11-08 16:00:40,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:40,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:40,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:40,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098757012] [2024-11-08 16:00:40,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098757012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:40,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:40,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:00:40,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191793198] [2024-11-08 16:00:40,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:40,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:00:40,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:40,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:00:40,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:00:40,281 INFO L87 Difference]: Start difference. First operand 116008 states and 159555 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:40,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:40,961 INFO L93 Difference]: Finished difference Result 227777 states and 313604 transitions. [2024-11-08 16:00:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:00:40,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-08 16:00:40,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:41,324 INFO L225 Difference]: With dead ends: 227777 [2024-11-08 16:00:41,324 INFO L226 Difference]: Without dead ends: 111790 [2024-11-08 16:00:41,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:00:41,383 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 36 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:41,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 173 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:00:41,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111790 states. [2024-11-08 16:00:42,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111790 to 107438. [2024-11-08 16:00:42,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107438 states, 107437 states have (on average 1.3477572903189776) internal successors, (144799), 107437 states have internal predecessors, (144799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107438 states to 107438 states and 144799 transitions. [2024-11-08 16:00:43,177 INFO L78 Accepts]: Start accepts. Automaton has 107438 states and 144799 transitions. Word has length 63 [2024-11-08 16:00:43,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:43,177 INFO L471 AbstractCegarLoop]: Abstraction has 107438 states and 144799 transitions. [2024-11-08 16:00:43,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:43,177 INFO L276 IsEmpty]: Start isEmpty. Operand 107438 states and 144799 transitions. [2024-11-08 16:00:43,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 16:00:43,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:43,179 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:00:43,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 16:00:43,179 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:00:43,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:43,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1628783719, now seen corresponding path program 1 times [2024-11-08 16:00:43,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:43,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094711240] [2024-11-08 16:00:43,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:43,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:43,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:43,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094711240] [2024-11-08 16:00:43,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094711240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:00:43,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404251375] [2024-11-08 16:00:43,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:43,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:00:43,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:00:43,747 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:00:43,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 16:00:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:43,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 16:00:43,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:00:45,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:45,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:00:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:46,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404251375] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:00:46,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:00:46,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 15] total 38 [2024-11-08 16:00:46,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189093622] [2024-11-08 16:00:46,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:00:46,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-08 16:00:46,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:46,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-08 16:00:46,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1224, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 16:00:46,294 INFO L87 Difference]: Start difference. First operand 107438 states and 144799 transitions. Second operand has 38 states, 38 states have (on average 4.447368421052632) internal successors, (169), 38 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:56,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:56,301 INFO L93 Difference]: Finished difference Result 393570 states and 525216 transitions. [2024-11-08 16:00:56,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-11-08 16:00:56,301 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.447368421052632) internal successors, (169), 38 states have internal predecessors, (169), 0 states have call successors, (0), 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 63 [2024-11-08 16:00:56,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:56,715 INFO L225 Difference]: With dead ends: 393570 [2024-11-08 16:00:56,716 INFO L226 Difference]: Without dead ends: 325055 [2024-11-08 16:00:56,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8910 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=4812, Invalid=20628, Unknown=0, NotChecked=0, Total=25440 [2024-11-08 16:00:56,797 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 3237 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3237 SdHoareTripleChecker+Valid, 2203 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:56,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3237 Valid, 2203 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 16:00:56,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325055 states. [2024-11-08 16:00:59,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325055 to 236016. [2024-11-08 16:00:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236016 states, 236015 states have (on average 1.3453466940660552) internal successors, (317522), 236015 states have internal predecessors, (317522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:01:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236016 states to 236016 states and 317522 transitions. [2024-11-08 16:01:00,396 INFO L78 Accepts]: Start accepts. Automaton has 236016 states and 317522 transitions. Word has length 63 [2024-11-08 16:01:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:01:00,396 INFO L471 AbstractCegarLoop]: Abstraction has 236016 states and 317522 transitions. [2024-11-08 16:01:00,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.447368421052632) internal successors, (169), 38 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:01:00,397 INFO L276 IsEmpty]: Start isEmpty. Operand 236016 states and 317522 transitions. [2024-11-08 16:01:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 16:01:00,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:01:00,399 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:01:00,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 16:01:00,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 16:01:00,600 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:01:00,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:01:00,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1490295141, now seen corresponding path program 1 times [2024-11-08 16:01:00,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:01:00,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068590030] [2024-11-08 16:01:00,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:01:00,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:01:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:01:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 16:01:00,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:01:00,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068590030] [2024-11-08 16:01:01,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068590030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:01:01,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:01:01,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:01:01,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087817586] [2024-11-08 16:01:01,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:01:01,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:01:01,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:01:01,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:01:01,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:01:01,322 INFO L87 Difference]: Start difference. First operand 236016 states and 317522 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:01:02,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:01:02,830 INFO L93 Difference]: Finished difference Result 422375 states and 569297 transitions. [2024-11-08 16:01:02,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:01:02,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 64 [2024-11-08 16:01:02,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:01:03,100 INFO L225 Difference]: With dead ends: 422375 [2024-11-08 16:01:03,100 INFO L226 Difference]: Without dead ends: 186380 [2024-11-08 16:01:03,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:01:03,985 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 50 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:01:03,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 92 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:01:04,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186380 states. [2024-11-08 16:01:05,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186380 to 186380. [2024-11-08 16:01:05,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186380 states, 186379 states have (on average 1.332693060913515) internal successors, (248386), 186379 states have internal predecessors, (248386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:01:06,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186380 states to 186380 states and 248386 transitions. [2024-11-08 16:01:06,682 INFO L78 Accepts]: Start accepts. Automaton has 186380 states and 248386 transitions. Word has length 64 [2024-11-08 16:01:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:01:06,683 INFO L471 AbstractCegarLoop]: Abstraction has 186380 states and 248386 transitions. [2024-11-08 16:01:06,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:01:06,683 INFO L276 IsEmpty]: Start isEmpty. Operand 186380 states and 248386 transitions. [2024-11-08 16:01:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 16:01:06,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:01:06,685 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:01:06,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 16:01:06,686 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:01:06,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:01:06,686 INFO L85 PathProgramCache]: Analyzing trace with hash -941448499, now seen corresponding path program 1 times [2024-11-08 16:01:06,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:01:06,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827449672] [2024-11-08 16:01:06,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:01:06,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:01:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:01:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 16:01:06,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:01:06,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827449672] [2024-11-08 16:01:06,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827449672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:01:06,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:01:06,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:01:06,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353781259] [2024-11-08 16:01:06,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:01:06,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:01:06,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:01:06,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:01:06,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:01:06,725 INFO L87 Difference]: Start difference. First operand 186380 states and 248386 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:01:07,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:01:07,418 INFO L93 Difference]: Finished difference Result 357641 states and 476929 transitions. [2024-11-08 16:01:07,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:01:07,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 65 [2024-11-08 16:01:07,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted.