./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.3.ufo.BOUNDED-8.pals.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 92cde93213bbdc81547d3bc892d5e318fc734fba39005e38f7e15156190bb05f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:00:25,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:00:25,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:00:25,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:00:25,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:00:25,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:00:25,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:00:25,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:00:25,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:00:25,748 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:00:25,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:00:25,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:00:25,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:00:25,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:00:25,750 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:00:25,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:00:25,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:00:25,751 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:00:25,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:00:25,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:00:25,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:00:25,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:00:25,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:00:25,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:00:25,752 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:00:25,753 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:00:25,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:00:25,753 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:00:25,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:00:25,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:00:25,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:00:25,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:00:25,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:00:25,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:00:25,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:00:25,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:00:25,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:00:25,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:00:25,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:00:25,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:00:25,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:00:25,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:00:25,758 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 -> 92cde93213bbdc81547d3bc892d5e318fc734fba39005e38f7e15156190bb05f [2024-10-12 20:00:25,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:00:25,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:00:25,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:00:25,990 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:00:25,990 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:00:25,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c [2024-10-12 20:00:27,244 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:00:27,409 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:00:27,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c [2024-10-12 20:00:27,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9cbc1fa6/3501f65280db48e8bdb74eee1077cbf4/FLAGee1951273 [2024-10-12 20:00:27,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9cbc1fa6/3501f65280db48e8bdb74eee1077cbf4 [2024-10-12 20:00:27,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:00:27,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:00:27,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:00:27,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:00:27,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:00:27,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:00:27" (1/1) ... [2024-10-12 20:00:27,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a843ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:00:27, skipping insertion in model container [2024-10-12 20:00:27,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:00:27" (1/1) ... [2024-10-12 20:00:27,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:00:27,740 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c[28194,28207] [2024-10-12 20:00:27,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:00:27,758 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:00:27,832 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c[28194,28207] [2024-10-12 20:00:27,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:00:27,856 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:00:27,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:00:27 WrapperNode [2024-10-12 20:00:27,858 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:00:27,859 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:00:27,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:00:27,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:00:27,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:00:27" (1/1) ... [2024-10-12 20:00:27,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:00:27" (1/1) ... [2024-10-12 20:00:27,919 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 958 [2024-10-12 20:00:27,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:00:27,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:00:27,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:00:27,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:00:27,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:00:27" (1/1) ... [2024-10-12 20:00:27,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:00:27" (1/1) ... [2024-10-12 20:00:27,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:00:27" (1/1) ... [2024-10-12 20:00:27,961 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:00:27,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:00:27" (1/1) ... [2024-10-12 20:00:27,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:00:27" (1/1) ... [2024-10-12 20:00:27,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:00:27" (1/1) ... [2024-10-12 20:00:27,999 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:00:27" (1/1) ... [2024-10-12 20:00:28,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:00:27" (1/1) ... [2024-10-12 20:00:28,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:00:27" (1/1) ... [2024-10-12 20:00:28,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:00:28,015 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:00:28,015 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:00:28,015 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:00:28,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:00:27" (1/1) ... [2024-10-12 20:00:28,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:00:28,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:00:28,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:00:28,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:00:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:00:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:00:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:00:28,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:00:28,210 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:00:28,211 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:00:29,009 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-10-12 20:00:29,010 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:00:29,063 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:00:29,065 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 20:00:29,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:00:29 BoogieIcfgContainer [2024-10-12 20:00:29,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:00:29,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:00:29,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:00:29,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:00:29,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:00:27" (1/3) ... [2024-10-12 20:00:29,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba60ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:00:29, skipping insertion in model container [2024-10-12 20:00:29,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:00:27" (2/3) ... [2024-10-12 20:00:29,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba60ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:00:29, skipping insertion in model container [2024-10-12 20:00:29,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:00:29" (3/3) ... [2024-10-12 20:00:29,073 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.BOUNDED-8.pals.c [2024-10-12 20:00:29,088 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:00:29,088 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:00:29,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:00:29,160 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;@4aea3e67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:00:29,160 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:00:29,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 275 states, 273 states have (on average 1.84981684981685) internal successors, (505), 274 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:29,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:00:29,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:29,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:29,176 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:29,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:29,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1890370261, now seen corresponding path program 1 times [2024-10-12 20:00:29,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:29,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028646331] [2024-10-12 20:00:29,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:29,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:29,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:29,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:29,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028646331] [2024-10-12 20:00:29,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028646331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:29,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:29,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 20:00:29,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249982927] [2024-10-12 20:00:29,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:29,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 20:00:29,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:29,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 20:00:29,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 20:00:29,568 INFO L87 Difference]: Start difference. First operand has 275 states, 273 states have (on average 1.84981684981685) internal successors, (505), 274 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:29,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:29,621 INFO L93 Difference]: Finished difference Result 361 states and 658 transitions. [2024-10-12 20:00:29,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 20:00:29,625 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-12 20:00:29,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:29,636 INFO L225 Difference]: With dead ends: 361 [2024-10-12 20:00:29,636 INFO L226 Difference]: Without dead ends: 273 [2024-10-12 20:00:29,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 20:00:29,640 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:00:29,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 498 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:00:29,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-12 20:00:29,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-10-12 20:00:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 1.838235294117647) internal successors, (500), 272 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 500 transitions. [2024-10-12 20:00:29,697 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 500 transitions. Word has length 74 [2024-10-12 20:00:29,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:29,697 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 500 transitions. [2024-10-12 20:00:29,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 500 transitions. [2024-10-12 20:00:29,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:00:29,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:29,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:29,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:00:29,707 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:29,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:29,708 INFO L85 PathProgramCache]: Analyzing trace with hash 599158701, now seen corresponding path program 1 times [2024-10-12 20:00:29,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:29,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049380173] [2024-10-12 20:00:29,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:29,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:29,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:29,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049380173] [2024-10-12 20:00:29,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049380173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:29,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:29,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:00:29,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402817186] [2024-10-12 20:00:29,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:29,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:00:29,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:29,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:00:29,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:00:29,974 INFO L87 Difference]: Start difference. First operand 273 states and 500 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:30,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:30,082 INFO L93 Difference]: Finished difference Result 359 states and 651 transitions. [2024-10-12 20:00:30,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:00:30,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-12 20:00:30,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:30,084 INFO L225 Difference]: With dead ends: 359 [2024-10-12 20:00:30,084 INFO L226 Difference]: Without dead ends: 273 [2024-10-12 20:00:30,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:00:30,086 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 0 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:00:30,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1446 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:00:30,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-12 20:00:30,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-10-12 20:00:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 1.6838235294117647) internal successors, (458), 272 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 458 transitions. [2024-10-12 20:00:30,104 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 458 transitions. Word has length 74 [2024-10-12 20:00:30,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:30,105 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 458 transitions. [2024-10-12 20:00:30,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 458 transitions. [2024-10-12 20:00:30,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 20:00:30,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:30,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:30,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:00:30,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:30,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:30,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1162766459, now seen corresponding path program 1 times [2024-10-12 20:00:30,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:30,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040844566] [2024-10-12 20:00:30,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:30,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:30,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:30,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:30,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040844566] [2024-10-12 20:00:30,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040844566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:30,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:30,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:00:30,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775328268] [2024-10-12 20:00:30,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:30,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:00:30,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:30,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:00:30,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:30,277 INFO L87 Difference]: Start difference. First operand 273 states and 458 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:30,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:30,332 INFO L93 Difference]: Finished difference Result 428 states and 733 transitions. [2024-10-12 20:00:30,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:00:30,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-12 20:00:30,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:30,335 INFO L225 Difference]: With dead ends: 428 [2024-10-12 20:00:30,335 INFO L226 Difference]: Without dead ends: 345 [2024-10-12 20:00:30,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:30,337 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 119 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 967 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-10-12 20:00:30,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 967 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:00:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-12 20:00:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2024-10-12 20:00:30,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.6929824561403508) internal successors, (579), 342 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:30,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 579 transitions. [2024-10-12 20:00:30,348 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 579 transitions. Word has length 115 [2024-10-12 20:00:30,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:30,348 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 579 transitions. [2024-10-12 20:00:30,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:30,349 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 579 transitions. [2024-10-12 20:00:30,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-12 20:00:30,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:30,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:30,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:00:30,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:30,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:30,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1368270817, now seen corresponding path program 1 times [2024-10-12 20:00:30,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:30,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190184666] [2024-10-12 20:00:30,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:30,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:30,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:30,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190184666] [2024-10-12 20:00:30,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190184666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:30,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:30,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:00:30,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476230083] [2024-10-12 20:00:30,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:30,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:00:30,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:30,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:00:30,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:30,489 INFO L87 Difference]: Start difference. First operand 343 states and 579 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:30,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:30,520 INFO L93 Difference]: Finished difference Result 497 states and 852 transitions. [2024-10-12 20:00:30,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:00:30,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-10-12 20:00:30,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:30,523 INFO L225 Difference]: With dead ends: 497 [2024-10-12 20:00:30,523 INFO L226 Difference]: Without dead ends: 414 [2024-10-12 20:00:30,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:30,524 INFO L432 NwaCegarLoop]: 564 mSDtfsCounter, 128 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1001 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-10-12 20:00:30,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1001 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:00:30,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-12 20:00:30,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 412. [2024-10-12 20:00:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.705596107055961) internal successors, (701), 411 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 701 transitions. [2024-10-12 20:00:30,543 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 701 transitions. Word has length 118 [2024-10-12 20:00:30,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:30,543 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 701 transitions. [2024-10-12 20:00:30,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:30,543 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 701 transitions. [2024-10-12 20:00:30,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-12 20:00:30,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:30,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:30,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:00:30,545 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:30,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:30,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2027226664, now seen corresponding path program 1 times [2024-10-12 20:00:30,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:30,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28592081] [2024-10-12 20:00:30,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:30,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:30,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:30,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28592081] [2024-10-12 20:00:30,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28592081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:30,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:30,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:00:30,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638856742] [2024-10-12 20:00:30,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:30,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:00:30,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:30,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:00:30,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:30,677 INFO L87 Difference]: Start difference. First operand 412 states and 701 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:30,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:30,718 INFO L93 Difference]: Finished difference Result 825 states and 1428 transitions. [2024-10-12 20:00:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:00:30,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-10-12 20:00:30,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:30,721 INFO L225 Difference]: With dead ends: 825 [2024-10-12 20:00:30,721 INFO L226 Difference]: Without dead ends: 605 [2024-10-12 20:00:30,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:30,724 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 120 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:00:30,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 978 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:00:30,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-10-12 20:00:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2024-10-12 20:00:30,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 602 states have (on average 1.7192691029900333) internal successors, (1035), 602 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:30,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1035 transitions. [2024-10-12 20:00:30,742 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1035 transitions. Word has length 118 [2024-10-12 20:00:30,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:30,743 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 1035 transitions. [2024-10-12 20:00:30,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1035 transitions. [2024-10-12 20:00:30,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 20:00:30,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:30,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:30,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:00:30,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:30,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:30,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1291342842, now seen corresponding path program 1 times [2024-10-12 20:00:30,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:30,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387049473] [2024-10-12 20:00:30,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:30,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:30,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:30,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387049473] [2024-10-12 20:00:30,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387049473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:30,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:30,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:00:30,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126525718] [2024-10-12 20:00:30,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:30,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:00:30,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:30,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:00:30,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:30,876 INFO L87 Difference]: Start difference. First operand 603 states and 1035 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:30,912 INFO L93 Difference]: Finished difference Result 1008 states and 1746 transitions. [2024-10-12 20:00:30,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:00:30,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-10-12 20:00:30,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:30,915 INFO L225 Difference]: With dead ends: 1008 [2024-10-12 20:00:30,915 INFO L226 Difference]: Without dead ends: 788 [2024-10-12 20:00:30,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:30,921 INFO L432 NwaCegarLoop]: 553 mSDtfsCounter, 121 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 991 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-10-12 20:00:30,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 991 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:00:30,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-10-12 20:00:30,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 786. [2024-10-12 20:00:30,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.7222929936305733) internal successors, (1352), 785 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1352 transitions. [2024-10-12 20:00:30,937 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1352 transitions. Word has length 121 [2024-10-12 20:00:30,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:30,939 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1352 transitions. [2024-10-12 20:00:30,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:30,939 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1352 transitions. [2024-10-12 20:00:30,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 20:00:30,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:30,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:30,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:00:30,941 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:30,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:30,941 INFO L85 PathProgramCache]: Analyzing trace with hash -645813627, now seen corresponding path program 1 times [2024-10-12 20:00:30,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:30,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929142626] [2024-10-12 20:00:30,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:30,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:31,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:31,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:31,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929142626] [2024-10-12 20:00:31,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929142626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:31,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:31,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:00:31,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52153401] [2024-10-12 20:00:31,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:31,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:00:31,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:31,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:00:31,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:31,077 INFO L87 Difference]: Start difference. First operand 786 states and 1352 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:31,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:31,110 INFO L93 Difference]: Finished difference Result 1879 states and 3259 transitions. [2024-10-12 20:00:31,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:00:31,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-10-12 20:00:31,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:31,115 INFO L225 Difference]: With dead ends: 1879 [2024-10-12 20:00:31,115 INFO L226 Difference]: Without dead ends: 1292 [2024-10-12 20:00:31,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:31,117 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 113 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:00:31,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 969 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:00:31,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2024-10-12 20:00:31,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1290. [2024-10-12 20:00:31,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1289 states have (on average 1.7214895267649342) internal successors, (2219), 1289 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 2219 transitions. [2024-10-12 20:00:31,144 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 2219 transitions. Word has length 121 [2024-10-12 20:00:31,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:31,144 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 2219 transitions. [2024-10-12 20:00:31,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:31,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 2219 transitions. [2024-10-12 20:00:31,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 20:00:31,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:31,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:31,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:00:31,146 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:31,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:31,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1710397733, now seen corresponding path program 1 times [2024-10-12 20:00:31,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:31,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236765533] [2024-10-12 20:00:31,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:31,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:31,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:31,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236765533] [2024-10-12 20:00:31,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236765533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:31,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:31,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:00:31,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494207587] [2024-10-12 20:00:31,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:31,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:00:31,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:31,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:00:31,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:31,255 INFO L87 Difference]: Start difference. First operand 1290 states and 2219 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:31,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:31,288 INFO L93 Difference]: Finished difference Result 2345 states and 4056 transitions. [2024-10-12 20:00:31,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:00:31,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-10-12 20:00:31,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:31,294 INFO L225 Difference]: With dead ends: 2345 [2024-10-12 20:00:31,294 INFO L226 Difference]: Without dead ends: 1758 [2024-10-12 20:00:31,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:31,296 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 114 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 981 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-10-12 20:00:31,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 981 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:00:31,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2024-10-12 20:00:31,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1756. [2024-10-12 20:00:31,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1755 states have (on average 1.7179487179487178) internal successors, (3015), 1755 states have internal predecessors, (3015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 3015 transitions. [2024-10-12 20:00:31,330 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 3015 transitions. Word has length 124 [2024-10-12 20:00:31,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:31,331 INFO L471 AbstractCegarLoop]: Abstraction has 1756 states and 3015 transitions. [2024-10-12 20:00:31,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:31,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 3015 transitions. [2024-10-12 20:00:31,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 20:00:31,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:31,332 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:31,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:00:31,332 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:31,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:31,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2059424284, now seen corresponding path program 1 times [2024-10-12 20:00:31,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:31,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608765456] [2024-10-12 20:00:31,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:31,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:31,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:31,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:31,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608765456] [2024-10-12 20:00:31,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608765456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:31,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:31,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:00:31,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080659084] [2024-10-12 20:00:31,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:31,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:00:31,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:31,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:00:31,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:31,441 INFO L87 Difference]: Start difference. First operand 1756 states and 3015 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:31,483 INFO L93 Difference]: Finished difference Result 4613 states and 7922 transitions. [2024-10-12 20:00:31,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:00:31,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-10-12 20:00:31,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:31,495 INFO L225 Difference]: With dead ends: 4613 [2024-10-12 20:00:31,496 INFO L226 Difference]: Without dead ends: 3063 [2024-10-12 20:00:31,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-10-12 20:00:31,500 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 106 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:00:31,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 960 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:00:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2024-10-12 20:00:31,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 3061. [2024-10-12 20:00:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3061 states, 3060 states have (on average 1.7029411764705882) internal successors, (5211), 3060 states have internal predecessors, (5211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 5211 transitions. [2024-10-12 20:00:31,555 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 5211 transitions. Word has length 124 [2024-10-12 20:00:31,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:31,555 INFO L471 AbstractCegarLoop]: Abstraction has 3061 states and 5211 transitions. [2024-10-12 20:00:31,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:31,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 5211 transitions. [2024-10-12 20:00:31,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-12 20:00:31,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:31,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:31,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:00:31,557 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:31,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:31,557 INFO L85 PathProgramCache]: Analyzing trace with hash -982220166, now seen corresponding path program 1 times [2024-10-12 20:00:31,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:31,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873930586] [2024-10-12 20:00:31,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:31,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:31,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:31,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:31,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873930586] [2024-10-12 20:00:31,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873930586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:31,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:31,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:00:31,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795801730] [2024-10-12 20:00:31,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:31,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:00:31,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:31,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:00:31,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:31,670 INFO L87 Difference]: Start difference. First operand 3061 states and 5211 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:31,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:31,712 INFO L93 Difference]: Finished difference Result 5790 states and 9886 transitions. [2024-10-12 20:00:31,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:00:31,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2024-10-12 20:00:31,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:31,725 INFO L225 Difference]: With dead ends: 5790 [2024-10-12 20:00:31,726 INFO L226 Difference]: Without dead ends: 4240 [2024-10-12 20:00:31,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:31,730 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 107 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 971 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-10-12 20:00:31,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 971 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:00:31,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4240 states. [2024-10-12 20:00:31,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4240 to 4238. [2024-10-12 20:00:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4238 states, 4237 states have (on average 1.6931791361812603) internal successors, (7174), 4237 states have internal predecessors, (7174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:31,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4238 states to 4238 states and 7174 transitions. [2024-10-12 20:00:31,798 INFO L78 Accepts]: Start accepts. Automaton has 4238 states and 7174 transitions. Word has length 127 [2024-10-12 20:00:31,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:31,798 INFO L471 AbstractCegarLoop]: Abstraction has 4238 states and 7174 transitions. [2024-10-12 20:00:31,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:31,799 INFO L276 IsEmpty]: Start isEmpty. Operand 4238 states and 7174 transitions. [2024-10-12 20:00:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-12 20:00:31,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:31,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:31,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:00:31,800 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:31,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:31,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1464193915, now seen corresponding path program 1 times [2024-10-12 20:00:31,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:31,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302639189] [2024-10-12 20:00:31,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:31,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:32,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:32,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302639189] [2024-10-12 20:00:32,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302639189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:32,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:32,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:00:32,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386054726] [2024-10-12 20:00:32,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:32,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:00:32,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:32,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:00:32,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:00:32,011 INFO L87 Difference]: Start difference. First operand 4238 states and 7174 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:32,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:32,366 INFO L93 Difference]: Finished difference Result 27159 states and 46476 transitions. [2024-10-12 20:00:32,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:00:32,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2024-10-12 20:00:32,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:32,436 INFO L225 Difference]: With dead ends: 27159 [2024-10-12 20:00:32,436 INFO L226 Difference]: Without dead ends: 23134 [2024-10-12 20:00:32,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:00:32,452 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 1640 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:00:32,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1640 Valid, 2744 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:00:32,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23134 states. [2024-10-12 20:00:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23134 to 8114. [2024-10-12 20:00:32,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8114 states, 8113 states have (on average 1.6853198570195982) internal successors, (13673), 8113 states have internal predecessors, (13673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:32,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8114 states to 8114 states and 13673 transitions. [2024-10-12 20:00:32,748 INFO L78 Accepts]: Start accepts. Automaton has 8114 states and 13673 transitions. Word has length 127 [2024-10-12 20:00:32,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:32,749 INFO L471 AbstractCegarLoop]: Abstraction has 8114 states and 13673 transitions. [2024-10-12 20:00:32,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 8114 states and 13673 transitions. [2024-10-12 20:00:32,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-12 20:00:32,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:32,750 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:32,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:00:32,750 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:32,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:32,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1786425182, now seen corresponding path program 1 times [2024-10-12 20:00:32,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:32,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100827813] [2024-10-12 20:00:32,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:32,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:32,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:32,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100827813] [2024-10-12 20:00:32,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100827813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:32,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:32,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:00:32,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37035054] [2024-10-12 20:00:32,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:32,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:00:32,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:32,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:00:32,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:00:32,891 INFO L87 Difference]: Start difference. First operand 8114 states and 13673 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:33,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:33,090 INFO L93 Difference]: Finished difference Result 26847 states and 45588 transitions. [2024-10-12 20:00:33,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:00:33,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-10-12 20:00:33,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:33,126 INFO L225 Difference]: With dead ends: 26847 [2024-10-12 20:00:33,126 INFO L226 Difference]: Without dead ends: 18946 [2024-10-12 20:00:33,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:00:33,143 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 419 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:00:33,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1439 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:00:33,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18946 states. [2024-10-12 20:00:33,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18946 to 13475. [2024-10-12 20:00:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13475 states, 13474 states have (on average 1.684651922220573) internal successors, (22699), 13474 states have internal predecessors, (22699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:33,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13475 states to 13475 states and 22699 transitions. [2024-10-12 20:00:33,470 INFO L78 Accepts]: Start accepts. Automaton has 13475 states and 22699 transitions. Word has length 128 [2024-10-12 20:00:33,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:33,471 INFO L471 AbstractCegarLoop]: Abstraction has 13475 states and 22699 transitions. [2024-10-12 20:00:33,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 13475 states and 22699 transitions. [2024-10-12 20:00:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 20:00:33,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:33,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:33,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:00:33,472 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:33,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:33,472 INFO L85 PathProgramCache]: Analyzing trace with hash -518146162, now seen corresponding path program 1 times [2024-10-12 20:00:33,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:33,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750331037] [2024-10-12 20:00:33,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:33,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:33,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:33,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:33,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750331037] [2024-10-12 20:00:33,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750331037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:33,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:33,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:00:33,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597492482] [2024-10-12 20:00:33,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:33,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:00:33,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:33,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:00:33,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:00:33,655 INFO L87 Difference]: Start difference. First operand 13475 states and 22699 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:34,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:34,060 INFO L93 Difference]: Finished difference Result 44285 states and 74776 transitions. [2024-10-12 20:00:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:00:34,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2024-10-12 20:00:34,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:34,118 INFO L225 Difference]: With dead ends: 44285 [2024-10-12 20:00:34,119 INFO L226 Difference]: Without dead ends: 31023 [2024-10-12 20:00:34,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:00:34,149 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 417 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:00:34,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1441 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:00:34,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31023 states. [2024-10-12 20:00:34,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31023 to 22160. [2024-10-12 20:00:34,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22160 states, 22159 states have (on average 1.6753012320050544) internal successors, (37123), 22159 states have internal predecessors, (37123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:34,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22160 states to 22160 states and 37123 transitions. [2024-10-12 20:00:34,713 INFO L78 Accepts]: Start accepts. Automaton has 22160 states and 37123 transitions. Word has length 129 [2024-10-12 20:00:34,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:34,713 INFO L471 AbstractCegarLoop]: Abstraction has 22160 states and 37123 transitions. [2024-10-12 20:00:34,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 22160 states and 37123 transitions. [2024-10-12 20:00:34,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-12 20:00:34,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:34,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:34,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:00:34,715 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:34,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:34,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1060037959, now seen corresponding path program 1 times [2024-10-12 20:00:34,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:34,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587484987] [2024-10-12 20:00:34,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:34,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:34,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:34,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587484987] [2024-10-12 20:00:34,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587484987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:34,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:34,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:00:34,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605978989] [2024-10-12 20:00:34,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:34,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:00:34,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:34,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:00:34,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:00:34,878 INFO L87 Difference]: Start difference. First operand 22160 states and 37123 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 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-10-12 20:00:35,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:35,418 INFO L93 Difference]: Finished difference Result 72619 states and 121924 transitions. [2024-10-12 20:00:35,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:00:35,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 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) Word has length 130 [2024-10-12 20:00:35,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:35,507 INFO L225 Difference]: With dead ends: 72619 [2024-10-12 20:00:35,507 INFO L226 Difference]: Without dead ends: 50672 [2024-10-12 20:00:35,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:00:35,530 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 415 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:00:35,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1443 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:00:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50672 states. [2024-10-12 20:00:36,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50672 to 36273. [2024-10-12 20:00:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36273 states, 36272 states have (on average 1.6659406704896338) internal successors, (60427), 36272 states have internal predecessors, (60427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:36,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36273 states to 36273 states and 60427 transitions. [2024-10-12 20:00:36,407 INFO L78 Accepts]: Start accepts. Automaton has 36273 states and 60427 transitions. Word has length 130 [2024-10-12 20:00:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:36,408 INFO L471 AbstractCegarLoop]: Abstraction has 36273 states and 60427 transitions. [2024-10-12 20:00:36,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 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-10-12 20:00:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 36273 states and 60427 transitions. [2024-10-12 20:00:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 20:00:36,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:36,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:36,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:00:36,410 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:36,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:36,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1550410089, now seen corresponding path program 1 times [2024-10-12 20:00:36,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:36,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625627556] [2024-10-12 20:00:36,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:36,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:36,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:36,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625627556] [2024-10-12 20:00:36,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625627556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:36,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:36,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:00:36,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596663340] [2024-10-12 20:00:36,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:36,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:00:36,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:36,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:00:36,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:00:36,666 INFO L87 Difference]: Start difference. First operand 36273 states and 60427 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:37,561 INFO L93 Difference]: Finished difference Result 117553 states and 196264 transitions. [2024-10-12 20:00:37,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:00:37,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2024-10-12 20:00:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:37,725 INFO L225 Difference]: With dead ends: 117553 [2024-10-12 20:00:37,725 INFO L226 Difference]: Without dead ends: 81493 [2024-10-12 20:00:37,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:00:37,762 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 413 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:00:37,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1451 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:00:37,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81493 states. [2024-10-12 20:00:38,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81493 to 58658. [2024-10-12 20:00:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58658 states, 58657 states have (on average 1.656869597831461) internal successors, (97187), 58657 states have internal predecessors, (97187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:39,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58658 states to 58658 states and 97187 transitions. [2024-10-12 20:00:39,211 INFO L78 Accepts]: Start accepts. Automaton has 58658 states and 97187 transitions. Word has length 131 [2024-10-12 20:00:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:39,214 INFO L471 AbstractCegarLoop]: Abstraction has 58658 states and 97187 transitions. [2024-10-12 20:00:39,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 58658 states and 97187 transitions. [2024-10-12 20:00:39,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 20:00:39,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:39,215 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:39,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:00:39,215 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:39,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:39,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1067749953, now seen corresponding path program 1 times [2024-10-12 20:00:39,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:39,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716646038] [2024-10-12 20:00:39,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:39,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:39,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:39,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716646038] [2024-10-12 20:00:39,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716646038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:39,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:39,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:00:39,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382386808] [2024-10-12 20:00:39,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:39,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:00:39,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:39,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:00:39,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:00:39,639 INFO L87 Difference]: Start difference. First operand 58658 states and 97187 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:40,470 INFO L93 Difference]: Finished difference Result 117105 states and 194033 transitions. [2024-10-12 20:00:40,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:00:40,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-10-12 20:00:40,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:40,592 INFO L225 Difference]: With dead ends: 117105 [2024-10-12 20:00:40,592 INFO L226 Difference]: Without dead ends: 58660 [2024-10-12 20:00:40,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:00:40,639 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 427 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:00:40,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1718 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:00:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58660 states. [2024-10-12 20:00:41,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58660 to 58658. [2024-10-12 20:00:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58658 states, 58657 states have (on average 1.6462144330599928) internal successors, (96562), 58657 states have internal predecessors, (96562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:41,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58658 states to 58658 states and 96562 transitions. [2024-10-12 20:00:41,820 INFO L78 Accepts]: Start accepts. Automaton has 58658 states and 96562 transitions. Word has length 133 [2024-10-12 20:00:41,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:41,820 INFO L471 AbstractCegarLoop]: Abstraction has 58658 states and 96562 transitions. [2024-10-12 20:00:41,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 58658 states and 96562 transitions. [2024-10-12 20:00:41,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 20:00:41,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:41,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:41,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:00:41,823 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:41,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:41,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1987540452, now seen corresponding path program 1 times [2024-10-12 20:00:41,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:41,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731742908] [2024-10-12 20:00:41,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:41,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:42,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:42,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731742908] [2024-10-12 20:00:42,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731742908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:42,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:42,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:00:42,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992210179] [2024-10-12 20:00:42,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:42,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:00:42,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:42,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:00:42,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:00:42,094 INFO L87 Difference]: Start difference. First operand 58658 states and 96562 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:43,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:43,479 INFO L93 Difference]: Finished difference Result 171535 states and 282829 transitions. [2024-10-12 20:00:43,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:00:43,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2024-10-12 20:00:43,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:43,670 INFO L225 Difference]: With dead ends: 171535 [2024-10-12 20:00:43,671 INFO L226 Difference]: Without dead ends: 113090 [2024-10-12 20:00:43,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:00:43,715 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 419 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:00:43,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1729 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:00:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113090 states. [2024-10-12 20:00:45,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113090 to 113088. [2024-10-12 20:00:45,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113088 states, 113087 states have (on average 1.6322919522137822) internal successors, (184591), 113087 states have internal predecessors, (184591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113088 states to 113088 states and 184591 transitions. [2024-10-12 20:00:45,933 INFO L78 Accepts]: Start accepts. Automaton has 113088 states and 184591 transitions. Word has length 136 [2024-10-12 20:00:45,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:45,934 INFO L471 AbstractCegarLoop]: Abstraction has 113088 states and 184591 transitions. [2024-10-12 20:00:45,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 113088 states and 184591 transitions. [2024-10-12 20:00:45,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-12 20:00:45,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:45,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:45,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:00:45,936 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:45,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:45,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1469661750, now seen corresponding path program 1 times [2024-10-12 20:00:45,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:45,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869352784] [2024-10-12 20:00:45,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:45,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:46,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:46,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869352784] [2024-10-12 20:00:46,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869352784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:46,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:46,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:00:46,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322183790] [2024-10-12 20:00:46,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:46,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:00:46,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:46,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:00:46,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:00:46,610 INFO L87 Difference]: Start difference. First operand 113088 states and 184591 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:47,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:47,511 INFO L93 Difference]: Finished difference Result 116962 states and 190400 transitions. [2024-10-12 20:00:47,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:00:47,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2024-10-12 20:00:47,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:47,682 INFO L225 Difference]: With dead ends: 116962 [2024-10-12 20:00:47,682 INFO L226 Difference]: Without dead ends: 116960 [2024-10-12 20:00:47,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:00:47,711 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 0 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:00:47,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1348 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:00:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116960 states. [2024-10-12 20:00:49,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116960 to 116960. [2024-10-12 20:00:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116960 states, 116959 states have (on average 1.6111286861207774) internal successors, (188436), 116959 states have internal predecessors, (188436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116960 states to 116960 states and 188436 transitions. [2024-10-12 20:00:50,070 INFO L78 Accepts]: Start accepts. Automaton has 116960 states and 188436 transitions. Word has length 137 [2024-10-12 20:00:50,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:50,070 INFO L471 AbstractCegarLoop]: Abstraction has 116960 states and 188436 transitions. [2024-10-12 20:00:50,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:50,070 INFO L276 IsEmpty]: Start isEmpty. Operand 116960 states and 188436 transitions. [2024-10-12 20:00:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 20:00:50,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:50,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:50,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:00:50,078 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:50,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:50,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1115574285, now seen corresponding path program 1 times [2024-10-12 20:00:50,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:50,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898285129] [2024-10-12 20:00:50,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:50,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:50,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:50,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898285129] [2024-10-12 20:00:50,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898285129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:50,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:50,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:00:50,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418621626] [2024-10-12 20:00:50,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:50,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:00:50,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:50,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:00:50,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:50,160 INFO L87 Difference]: Start difference. First operand 116960 states and 188436 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:52,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:52,448 INFO L93 Difference]: Finished difference Result 349877 states and 563316 transitions. [2024-10-12 20:00:52,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:00:52,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2024-10-12 20:00:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:52,846 INFO L225 Difference]: With dead ends: 349877 [2024-10-12 20:00:52,847 INFO L226 Difference]: Without dead ends: 232977 [2024-10-12 20:00:52,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:52,927 INFO L432 NwaCegarLoop]: 759 mSDtfsCounter, 377 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:00:52,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1200 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:00:53,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232977 states. [2024-10-12 20:00:56,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232977 to 232975. [2024-10-12 20:00:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232975 states, 232974 states have (on average 1.5998695133362522) internal successors, (372728), 232974 states have internal predecessors, (372728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232975 states to 232975 states and 372728 transitions. [2024-10-12 20:00:57,685 INFO L78 Accepts]: Start accepts. Automaton has 232975 states and 372728 transitions. Word has length 171 [2024-10-12 20:00:57,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:57,686 INFO L471 AbstractCegarLoop]: Abstraction has 232975 states and 372728 transitions. [2024-10-12 20:00:57,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 232975 states and 372728 transitions. [2024-10-12 20:00:57,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 20:00:57,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:57,696 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:57,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:00:57,697 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:57,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:57,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2085463740, now seen corresponding path program 1 times [2024-10-12 20:00:57,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:57,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024337390] [2024-10-12 20:00:57,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:57,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 20:00:57,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:57,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024337390] [2024-10-12 20:00:57,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024337390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:57,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:57,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:00:57,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025371468] [2024-10-12 20:00:57,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:57,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:00:57,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:57,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:00:57,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:57,844 INFO L87 Difference]: Start difference. First operand 232975 states and 372728 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:01:02,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:02,746 INFO L93 Difference]: Finished difference Result 696911 states and 1114187 transitions. [2024-10-12 20:01:02,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:01:02,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 171 [2024-10-12 20:01:02,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:03,646 INFO L225 Difference]: With dead ends: 696911 [2024-10-12 20:01:03,646 INFO L226 Difference]: Without dead ends: 464040 [2024-10-12 20:01:03,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:01:03,810 INFO L432 NwaCegarLoop]: 689 mSDtfsCounter, 318 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:03,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1130 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:01:04,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464040 states.