./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 cd7d66127097bee693df60b26ad836789e8e18ef088953d4d01590e6c82035a4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:54:07,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:54:07,434 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:54:07,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:54:07,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:54:07,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:54:07,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:54:07,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:54:07,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:54:07,467 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:54:07,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:54:07,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:54:07,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:54:07,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:54:07,468 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:54:07,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:54:07,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:54:07,468 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:54:07,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:54:07,469 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:54:07,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:54:07,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:54:07,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:54:07,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:54:07,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:54:07,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:54:07,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:54:07,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:54:07,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:54:07,470 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> cd7d66127097bee693df60b26ad836789e8e18ef088953d4d01590e6c82035a4 [2025-01-09 04:54:07,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:54:07,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:54:07,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:54:07,801 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:54:07,801 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:54:07,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-01-09 04:54:09,722 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d477fcd4/13d8a7463d5d4cd8ba3e735d8e598cca/FLAGf607e8939 [2025-01-09 04:54:09,999 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:54:10,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-01-09 04:54:10,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d477fcd4/13d8a7463d5d4cd8ba3e735d8e598cca/FLAGf607e8939 [2025-01-09 04:54:10,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d477fcd4/13d8a7463d5d4cd8ba3e735d8e598cca [2025-01-09 04:54:10,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:54:10,040 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:54:10,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:54:10,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:54:10,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:54:10,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:54:10" (1/1) ... [2025-01-09 04:54:10,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48b85788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:10, skipping insertion in model container [2025-01-09 04:54:10,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:54:10" (1/1) ... [2025-01-09 04:54:10,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:54:10,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7669,7682] [2025-01-09 04:54:10,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:54:10,276 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:54:10,304 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7669,7682] [2025-01-09 04:54:10,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:54:10,327 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:54:10,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:10 WrapperNode [2025-01-09 04:54:10,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:54:10,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:54:10,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:54:10,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:54:10,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:10" (1/1) ... [2025-01-09 04:54:10,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:10" (1/1) ... [2025-01-09 04:54:10,361 INFO L138 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 625 [2025-01-09 04:54:10,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:54:10,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:54:10,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:54:10,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:54:10,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:10" (1/1) ... [2025-01-09 04:54:10,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:10" (1/1) ... [2025-01-09 04:54:10,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:10" (1/1) ... [2025-01-09 04:54:10,378 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]. [2025-01-09 04:54:10,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:10" (1/1) ... [2025-01-09 04:54:10,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:10" (1/1) ... [2025-01-09 04:54:10,383 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:10" (1/1) ... [2025-01-09 04:54:10,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:10" (1/1) ... [2025-01-09 04:54:10,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:10" (1/1) ... [2025-01-09 04:54:10,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:10" (1/1) ... [2025-01-09 04:54:10,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:10" (1/1) ... [2025-01-09 04:54:10,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:54:10,391 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:54:10,391 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:54:10,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:54:10,392 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:10" (1/1) ... [2025-01-09 04:54:10,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:54:10,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:54:10,419 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:54:10,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:54:10,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:54:10,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:54:10,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:54:10,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:54:10,527 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:54:10,529 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:54:10,873 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-01-09 04:54:10,873 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:54:10,881 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:54:10,881 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:54:10,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:54:10 BoogieIcfgContainer [2025-01-09 04:54:10,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:54:10,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:54:10,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:54:10,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:54:10,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:54:10" (1/3) ... [2025-01-09 04:54:10,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4509d907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:54:10, skipping insertion in model container [2025-01-09 04:54:10,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:10" (2/3) ... [2025-01-09 04:54:10,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4509d907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:54:10, skipping insertion in model container [2025-01-09 04:54:10,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:54:10" (3/3) ... [2025-01-09 04:54:10,887 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-01-09 04:54:10,897 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:54:10,898 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 138 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:54:10,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:54:10,961 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;@5a82dee1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:54:10,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:54:10,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:54:10,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:10,971 INFO L218 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] [2025-01-09 04:54:10,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:10,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:10,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2006546999, now seen corresponding path program 1 times [2025-01-09 04:54:10,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:10,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704789089] [2025-01-09 04:54:10,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:10,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:11,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:54:11,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:54:11,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:11,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:11,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:11,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704789089] [2025-01-09 04:54:11,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704789089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:11,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:11,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:54:11,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815922482] [2025-01-09 04:54:11,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:11,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:54:11,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:11,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:54:11,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:11,304 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:11,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:11,364 INFO L93 Difference]: Finished difference Result 300 states and 490 transitions. [2025-01-09 04:54:11,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:54:11,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-01-09 04:54:11,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:11,377 INFO L225 Difference]: With dead ends: 300 [2025-01-09 04:54:11,378 INFO L226 Difference]: Without dead ends: 209 [2025-01-09 04:54:11,380 INFO L434 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 [2025-01-09 04:54:11,384 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 159 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:11,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 471 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:54:11,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-09 04:54:11,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2025-01-09 04:54:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.4466019417475728) internal successors, (298), 206 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:11,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 298 transitions. [2025-01-09 04:54:11,426 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 298 transitions. Word has length 87 [2025-01-09 04:54:11,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:11,427 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 298 transitions. [2025-01-09 04:54:11,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:11,427 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 298 transitions. [2025-01-09 04:54:11,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 04:54:11,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:11,429 INFO L218 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] [2025-01-09 04:54:11,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:54:11,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:11,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:11,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1559740613, now seen corresponding path program 1 times [2025-01-09 04:54:11,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:11,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792117832] [2025-01-09 04:54:11,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:11,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:11,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 04:54:11,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 04:54:11,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:11,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:11,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:11,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:11,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792117832] [2025-01-09 04:54:11,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792117832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:11,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:11,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:54:11,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4014340] [2025-01-09 04:54:11,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:11,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:54:11,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:11,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:54:11,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:11,609 INFO L87 Difference]: Start difference. First operand 207 states and 298 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:11,641 INFO L93 Difference]: Finished difference Result 499 states and 762 transitions. [2025-01-09 04:54:11,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:54:11,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-01-09 04:54:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:11,643 INFO L225 Difference]: With dead ends: 499 [2025-01-09 04:54:11,644 INFO L226 Difference]: Without dead ends: 345 [2025-01-09 04:54:11,645 INFO L434 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 [2025-01-09 04:54:11,645 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 110 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:11,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 402 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:54:11,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-01-09 04:54:11,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2025-01-09 04:54:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.5029239766081872) internal successors, (514), 342 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 514 transitions. [2025-01-09 04:54:11,656 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 514 transitions. Word has length 88 [2025-01-09 04:54:11,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:11,657 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 514 transitions. [2025-01-09 04:54:11,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:11,657 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 514 transitions. [2025-01-09 04:54:11,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:54:11,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:11,658 INFO L218 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] [2025-01-09 04:54:11,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:54:11,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:11,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:11,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1480148747, now seen corresponding path program 1 times [2025-01-09 04:54:11,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:11,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222063320] [2025-01-09 04:54:11,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:11,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:11,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:54:11,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:54:11,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:11,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:11,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:11,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222063320] [2025-01-09 04:54:11,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222063320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:11,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:11,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:54:11,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373305365] [2025-01-09 04:54:11,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:11,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:54:11,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:11,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:54:11,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:11,808 INFO L87 Difference]: Start difference. First operand 343 states and 514 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:11,834 INFO L93 Difference]: Finished difference Result 891 states and 1384 transitions. [2025-01-09 04:54:11,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:54:11,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-01-09 04:54:11,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:11,836 INFO L225 Difference]: With dead ends: 891 [2025-01-09 04:54:11,837 INFO L226 Difference]: Without dead ends: 601 [2025-01-09 04:54:11,837 INFO L434 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 [2025-01-09 04:54:11,838 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 105 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:11,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 398 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:54:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-01-09 04:54:11,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 599. [2025-01-09 04:54:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.5351170568561874) internal successors, (918), 598 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 918 transitions. [2025-01-09 04:54:11,855 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 918 transitions. Word has length 89 [2025-01-09 04:54:11,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:11,855 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 918 transitions. [2025-01-09 04:54:11,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:11,855 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 918 transitions. [2025-01-09 04:54:11,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 04:54:11,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:11,857 INFO L218 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] [2025-01-09 04:54:11,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:54:11,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:11,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:11,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1142089047, now seen corresponding path program 1 times [2025-01-09 04:54:11,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:11,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022919652] [2025-01-09 04:54:11,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:11,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:11,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 04:54:11,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 04:54:11,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:11,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:12,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:12,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022919652] [2025-01-09 04:54:12,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022919652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:12,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:12,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:54:12,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523495292] [2025-01-09 04:54:12,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:12,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:54:12,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:12,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:54:12,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:12,003 INFO L87 Difference]: Start difference. First operand 599 states and 918 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:12,032 INFO L93 Difference]: Finished difference Result 1627 states and 2544 transitions. [2025-01-09 04:54:12,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:54:12,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-01-09 04:54:12,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:12,036 INFO L225 Difference]: With dead ends: 1627 [2025-01-09 04:54:12,036 INFO L226 Difference]: Without dead ends: 1081 [2025-01-09 04:54:12,037 INFO L434 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 [2025-01-09 04:54:12,038 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 100 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:12,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 394 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:54:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2025-01-09 04:54:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1079. [2025-01-09 04:54:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1078 states have (on average 1.549165120593692) internal successors, (1670), 1078 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1670 transitions. [2025-01-09 04:54:12,061 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1670 transitions. Word has length 90 [2025-01-09 04:54:12,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:12,062 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1670 transitions. [2025-01-09 04:54:12,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:12,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1670 transitions. [2025-01-09 04:54:12,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 04:54:12,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:12,063 INFO L218 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] [2025-01-09 04:54:12,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:54:12,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:12,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:12,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1309607801, now seen corresponding path program 1 times [2025-01-09 04:54:12,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:12,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603102867] [2025-01-09 04:54:12,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:12,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:12,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 04:54:12,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 04:54:12,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:12,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:12,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:12,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:12,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603102867] [2025-01-09 04:54:12,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603102867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:12,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:12,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:54:12,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935629565] [2025-01-09 04:54:12,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:12,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:54:12,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:12,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:54:12,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:12,176 INFO L87 Difference]: Start difference. First operand 1079 states and 1670 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:12,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:12,219 INFO L93 Difference]: Finished difference Result 3003 states and 4696 transitions. [2025-01-09 04:54:12,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:54:12,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-01-09 04:54:12,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:12,228 INFO L225 Difference]: With dead ends: 3003 [2025-01-09 04:54:12,228 INFO L226 Difference]: Without dead ends: 1977 [2025-01-09 04:54:12,229 INFO L434 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 [2025-01-09 04:54:12,231 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 95 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:12,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 390 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:54:12,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2025-01-09 04:54:12,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1975. [2025-01-09 04:54:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1975 states, 1974 states have (on average 1.5511651469098278) internal successors, (3062), 1974 states have internal predecessors, (3062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 3062 transitions. [2025-01-09 04:54:12,277 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 3062 transitions. Word has length 91 [2025-01-09 04:54:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:12,278 INFO L471 AbstractCegarLoop]: Abstraction has 1975 states and 3062 transitions. [2025-01-09 04:54:12,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:12,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 3062 transitions. [2025-01-09 04:54:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 04:54:12,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:12,282 INFO L218 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] [2025-01-09 04:54:12,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:54:12,282 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:12,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:12,283 INFO L85 PathProgramCache]: Analyzing trace with hash 582949359, now seen corresponding path program 1 times [2025-01-09 04:54:12,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:12,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146322985] [2025-01-09 04:54:12,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:12,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:12,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 04:54:12,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 04:54:12,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:12,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:12,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:12,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146322985] [2025-01-09 04:54:12,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146322985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:12,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:12,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:54:12,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155383154] [2025-01-09 04:54:12,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:12,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:54:12,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:12,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:54:12,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:12,388 INFO L87 Difference]: Start difference. First operand 1975 states and 3062 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:12,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:12,426 INFO L93 Difference]: Finished difference Result 5563 states and 8664 transitions. [2025-01-09 04:54:12,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:54:12,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-01-09 04:54:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:12,437 INFO L225 Difference]: With dead ends: 5563 [2025-01-09 04:54:12,437 INFO L226 Difference]: Without dead ends: 3641 [2025-01-09 04:54:12,440 INFO L434 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 [2025-01-09 04:54:12,443 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 90 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:12,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 386 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:54:12,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3641 states. [2025-01-09 04:54:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3641 to 3639. [2025-01-09 04:54:12,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3639 states, 3638 states have (on average 1.5453545904343045) internal successors, (5622), 3638 states have internal predecessors, (5622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 5622 transitions. [2025-01-09 04:54:12,518 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 5622 transitions. Word has length 92 [2025-01-09 04:54:12,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:12,519 INFO L471 AbstractCegarLoop]: Abstraction has 3639 states and 5622 transitions. [2025-01-09 04:54:12,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:12,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 5622 transitions. [2025-01-09 04:54:12,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:54:12,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:12,523 INFO L218 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] [2025-01-09 04:54:12,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:54:12,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:12,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:12,524 INFO L85 PathProgramCache]: Analyzing trace with hash -496500112, now seen corresponding path program 1 times [2025-01-09 04:54:12,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:12,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672915472] [2025-01-09 04:54:12,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:12,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:12,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:54:12,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:54:12,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:12,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:12,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:12,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672915472] [2025-01-09 04:54:12,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672915472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:12,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:12,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:54:12,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178852323] [2025-01-09 04:54:12,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:12,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:12,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:12,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:12,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:12,754 INFO L87 Difference]: Start difference. First operand 3639 states and 5622 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:13,328 INFO L93 Difference]: Finished difference Result 53843 states and 83588 transitions. [2025-01-09 04:54:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:54:13,328 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-01-09 04:54:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:13,463 INFO L225 Difference]: With dead ends: 53843 [2025-01-09 04:54:13,463 INFO L226 Difference]: Without dead ends: 50257 [2025-01-09 04:54:13,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:54:13,480 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 2518 mSDsluCounter, 4862 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2518 SdHoareTripleChecker+Valid, 5041 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:13,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2518 Valid, 5041 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:54:13,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50257 states. [2025-01-09 04:54:13,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50257 to 7223. [2025-01-09 04:54:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7223 states, 7222 states have (on average 1.5317086679590142) internal successors, (11062), 7222 states have internal predecessors, (11062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7223 states to 7223 states and 11062 transitions. [2025-01-09 04:54:14,013 INFO L78 Accepts]: Start accepts. Automaton has 7223 states and 11062 transitions. Word has length 93 [2025-01-09 04:54:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:14,013 INFO L471 AbstractCegarLoop]: Abstraction has 7223 states and 11062 transitions. [2025-01-09 04:54:14,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 7223 states and 11062 transitions. [2025-01-09 04:54:14,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:54:14,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:14,015 INFO L218 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] [2025-01-09 04:54:14,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:54:14,015 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:14,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:14,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1317055956, now seen corresponding path program 1 times [2025-01-09 04:54:14,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:14,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232510017] [2025-01-09 04:54:14,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:14,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:14,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:54:14,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:54:14,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:14,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:14,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:14,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232510017] [2025-01-09 04:54:14,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232510017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:14,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:14,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:54:14,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688320533] [2025-01-09 04:54:14,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:14,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:54:14,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:14,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:54:14,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:14,144 INFO L87 Difference]: Start difference. First operand 7223 states and 11062 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:14,210 INFO L93 Difference]: Finished difference Result 20859 states and 31864 transitions. [2025-01-09 04:54:14,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:54:14,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-01-09 04:54:14,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:14,234 INFO L225 Difference]: With dead ends: 20859 [2025-01-09 04:54:14,234 INFO L226 Difference]: Without dead ends: 13689 [2025-01-09 04:54:14,244 INFO L434 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 [2025-01-09 04:54:14,245 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 80 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:14,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 304 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:54:14,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13689 states. [2025-01-09 04:54:14,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13689 to 13559. [2025-01-09 04:54:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13559 states, 13558 states have (on average 1.5050892462015046) internal successors, (20406), 13558 states have internal predecessors, (20406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13559 states to 13559 states and 20406 transitions. [2025-01-09 04:54:14,474 INFO L78 Accepts]: Start accepts. Automaton has 13559 states and 20406 transitions. Word has length 95 [2025-01-09 04:54:14,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:14,474 INFO L471 AbstractCegarLoop]: Abstraction has 13559 states and 20406 transitions. [2025-01-09 04:54:14,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 13559 states and 20406 transitions. [2025-01-09 04:54:14,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:54:14,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:14,477 INFO L218 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] [2025-01-09 04:54:14,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:54:14,477 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:14,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:14,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1296053301, now seen corresponding path program 1 times [2025-01-09 04:54:14,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:14,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135797894] [2025-01-09 04:54:14,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:14,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:14,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:54:14,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:54:14,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:14,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:14,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:14,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135797894] [2025-01-09 04:54:14,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135797894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:14,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:14,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:54:14,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859908751] [2025-01-09 04:54:14,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:14,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:14,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:14,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:14,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:14,950 INFO L87 Difference]: Start difference. First operand 13559 states and 20406 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:15,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:15,305 INFO L93 Difference]: Finished difference Result 27067 states and 40760 transitions. [2025-01-09 04:54:15,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:54:15,305 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-01-09 04:54:15,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:15,326 INFO L225 Difference]: With dead ends: 27067 [2025-01-09 04:54:15,326 INFO L226 Difference]: Without dead ends: 13561 [2025-01-09 04:54:15,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:54:15,340 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 224 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:15,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 998 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:54:15,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13561 states. [2025-01-09 04:54:15,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13561 to 13559. [2025-01-09 04:54:15,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13559 states, 13558 states have (on average 1.495648325711757) internal successors, (20278), 13558 states have internal predecessors, (20278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:15,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13559 states to 13559 states and 20278 transitions. [2025-01-09 04:54:15,534 INFO L78 Accepts]: Start accepts. Automaton has 13559 states and 20278 transitions. Word has length 95 [2025-01-09 04:54:15,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:15,534 INFO L471 AbstractCegarLoop]: Abstraction has 13559 states and 20278 transitions. [2025-01-09 04:54:15,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:15,535 INFO L276 IsEmpty]: Start isEmpty. Operand 13559 states and 20278 transitions. [2025-01-09 04:54:15,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:54:15,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:15,535 INFO L218 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] [2025-01-09 04:54:15,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:54:15,535 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:15,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:15,536 INFO L85 PathProgramCache]: Analyzing trace with hash 232587604, now seen corresponding path program 1 times [2025-01-09 04:54:15,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:15,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578094192] [2025-01-09 04:54:15,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:15,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:15,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:54:15,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:54:15,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:15,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:15,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:15,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578094192] [2025-01-09 04:54:15,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578094192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:15,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:15,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:54:15,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649806155] [2025-01-09 04:54:15,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:15,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:54:15,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:15,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:54:15,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:15,596 INFO L87 Difference]: Start difference. First operand 13559 states and 20278 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:15,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:15,703 INFO L93 Difference]: Finished difference Result 26622 states and 40124 transitions. [2025-01-09 04:54:15,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:54:15,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-01-09 04:54:15,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:15,734 INFO L225 Difference]: With dead ends: 26622 [2025-01-09 04:54:15,735 INFO L226 Difference]: Without dead ends: 19451 [2025-01-09 04:54:15,745 INFO L434 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 [2025-01-09 04:54:15,746 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 117 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:15,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 414 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:54:15,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19451 states. [2025-01-09 04:54:15,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19451 to 19449. [2025-01-09 04:54:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19449 states, 19448 states have (on average 1.4936240230357878) internal successors, (29048), 19448 states have internal predecessors, (29048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19449 states to 19449 states and 29048 transitions. [2025-01-09 04:54:16,017 INFO L78 Accepts]: Start accepts. Automaton has 19449 states and 29048 transitions. Word has length 96 [2025-01-09 04:54:16,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:16,017 INFO L471 AbstractCegarLoop]: Abstraction has 19449 states and 29048 transitions. [2025-01-09 04:54:16,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:16,017 INFO L276 IsEmpty]: Start isEmpty. Operand 19449 states and 29048 transitions. [2025-01-09 04:54:16,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:54:16,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:16,018 INFO L218 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] [2025-01-09 04:54:16,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:54:16,018 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:16,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:16,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1524855936, now seen corresponding path program 1 times [2025-01-09 04:54:16,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:16,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859490951] [2025-01-09 04:54:16,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:16,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:16,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:54:16,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:54:16,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:16,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:16,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:16,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859490951] [2025-01-09 04:54:16,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859490951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:16,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:16,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:54:16,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987594065] [2025-01-09 04:54:16,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:16,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:54:16,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:16,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:54:16,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:16,133 INFO L87 Difference]: Start difference. First operand 19449 states and 29048 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:16,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:16,362 INFO L93 Difference]: Finished difference Result 51901 states and 77754 transitions. [2025-01-09 04:54:16,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:54:16,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-01-09 04:54:16,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:16,416 INFO L225 Difference]: With dead ends: 51901 [2025-01-09 04:54:16,416 INFO L226 Difference]: Without dead ends: 32507 [2025-01-09 04:54:16,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:54:16,440 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 741 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:16,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 187 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:54:16,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32507 states. [2025-01-09 04:54:16,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32507 to 32505. [2025-01-09 04:54:16,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32505 states, 32504 states have (on average 1.4922471080482402) internal successors, (48504), 32504 states have internal predecessors, (48504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32505 states to 32505 states and 48504 transitions. [2025-01-09 04:54:16,960 INFO L78 Accepts]: Start accepts. Automaton has 32505 states and 48504 transitions. Word has length 96 [2025-01-09 04:54:16,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:16,960 INFO L471 AbstractCegarLoop]: Abstraction has 32505 states and 48504 transitions. [2025-01-09 04:54:16,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:16,961 INFO L276 IsEmpty]: Start isEmpty. Operand 32505 states and 48504 transitions. [2025-01-09 04:54:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:54:16,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:16,961 INFO L218 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] [2025-01-09 04:54:16,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:54:16,962 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:16,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:16,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1886974661, now seen corresponding path program 1 times [2025-01-09 04:54:16,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:16,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681155870] [2025-01-09 04:54:16,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:16,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:16,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:54:16,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:54:16,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:16,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:17,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:17,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681155870] [2025-01-09 04:54:17,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681155870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:17,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:17,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:54:17,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760888753] [2025-01-09 04:54:17,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:17,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:54:17,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:17,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:54:17,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:17,052 INFO L87 Difference]: Start difference. First operand 32505 states and 48504 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:17,221 INFO L93 Difference]: Finished difference Result 64955 states and 96953 transitions. [2025-01-09 04:54:17,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:54:17,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-01-09 04:54:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:17,514 INFO L225 Difference]: With dead ends: 64955 [2025-01-09 04:54:17,514 INFO L226 Difference]: Without dead ends: 32505 [2025-01-09 04:54:17,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:54:17,527 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 443 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:17,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 142 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:54:17,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32505 states. [2025-01-09 04:54:17,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32505 to 32505. [2025-01-09 04:54:17,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32505 states, 32504 states have (on average 1.4824021658872755) internal successors, (48184), 32504 states have internal predecessors, (48184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:17,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32505 states to 32505 states and 48184 transitions. [2025-01-09 04:54:17,859 INFO L78 Accepts]: Start accepts. Automaton has 32505 states and 48184 transitions. Word has length 96 [2025-01-09 04:54:17,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:17,859 INFO L471 AbstractCegarLoop]: Abstraction has 32505 states and 48184 transitions. [2025-01-09 04:54:17,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:17,859 INFO L276 IsEmpty]: Start isEmpty. Operand 32505 states and 48184 transitions. [2025-01-09 04:54:17,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:54:17,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:17,860 INFO L218 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] [2025-01-09 04:54:17,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:54:17,860 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:17,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:17,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1645128928, now seen corresponding path program 1 times [2025-01-09 04:54:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:17,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140616209] [2025-01-09 04:54:17,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:17,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:17,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:54:17,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:54:17,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:17,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:17,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:17,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140616209] [2025-01-09 04:54:17,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140616209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:17,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:17,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:54:17,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440794716] [2025-01-09 04:54:17,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:17,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:54:17,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:17,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:54:17,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:17,963 INFO L87 Difference]: Start difference. First operand 32505 states and 48184 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:18,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:18,255 INFO L93 Difference]: Finished difference Result 64955 states and 96313 transitions. [2025-01-09 04:54:18,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:54:18,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-01-09 04:54:18,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:18,294 INFO L225 Difference]: With dead ends: 64955 [2025-01-09 04:54:18,294 INFO L226 Difference]: Without dead ends: 32505 [2025-01-09 04:54:18,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:54:18,319 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 401 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:18,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 166 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:54:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32505 states. [2025-01-09 04:54:18,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32505 to 32505. [2025-01-09 04:54:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32505 states, 32504 states have (on average 1.4725572237263107) internal successors, (47864), 32504 states have internal predecessors, (47864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:18,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32505 states to 32505 states and 47864 transitions. [2025-01-09 04:54:18,811 INFO L78 Accepts]: Start accepts. Automaton has 32505 states and 47864 transitions. Word has length 96 [2025-01-09 04:54:18,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:18,812 INFO L471 AbstractCegarLoop]: Abstraction has 32505 states and 47864 transitions. [2025-01-09 04:54:18,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:18,813 INFO L276 IsEmpty]: Start isEmpty. Operand 32505 states and 47864 transitions. [2025-01-09 04:54:18,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:54:18,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:18,813 INFO L218 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] [2025-01-09 04:54:18,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:54:18,813 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:18,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:18,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1115838427, now seen corresponding path program 1 times [2025-01-09 04:54:18,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:18,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221073966] [2025-01-09 04:54:18,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:18,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:18,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:54:18,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:54:18,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:18,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:18,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:18,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221073966] [2025-01-09 04:54:18,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221073966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:18,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:18,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:54:18,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121377089] [2025-01-09 04:54:18,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:18,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:54:18,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:18,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:54:18,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:18,997 INFO L87 Difference]: Start difference. First operand 32505 states and 47864 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:19,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:19,150 INFO L93 Difference]: Finished difference Result 64955 states and 95673 transitions. [2025-01-09 04:54:19,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:54:19,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-01-09 04:54:19,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:19,186 INFO L225 Difference]: With dead ends: 64955 [2025-01-09 04:54:19,186 INFO L226 Difference]: Without dead ends: 32505 [2025-01-09 04:54:19,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:54:19,207 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 463 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:19,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 126 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:54:19,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32505 states. [2025-01-09 04:54:19,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32505 to 32505. [2025-01-09 04:54:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32505 states, 32504 states have (on average 1.4627122815653457) internal successors, (47544), 32504 states have internal predecessors, (47544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32505 states to 32505 states and 47544 transitions. [2025-01-09 04:54:19,639 INFO L78 Accepts]: Start accepts. Automaton has 32505 states and 47544 transitions. Word has length 96 [2025-01-09 04:54:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:19,640 INFO L471 AbstractCegarLoop]: Abstraction has 32505 states and 47544 transitions. [2025-01-09 04:54:19,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 32505 states and 47544 transitions. [2025-01-09 04:54:19,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:54:19,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:19,640 INFO L218 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] [2025-01-09 04:54:19,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:54:19,640 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:19,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:19,642 INFO L85 PathProgramCache]: Analyzing trace with hash -625578688, now seen corresponding path program 1 times [2025-01-09 04:54:19,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:19,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289781889] [2025-01-09 04:54:19,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:19,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:19,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:54:19,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:54:19,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:19,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:19,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:19,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:19,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289781889] [2025-01-09 04:54:19,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289781889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:19,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:19,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:54:19,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153349803] [2025-01-09 04:54:19,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:19,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:54:19,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:19,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:54:19,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:19,891 INFO L87 Difference]: Start difference. First operand 32505 states and 47544 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:20,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:20,093 INFO L93 Difference]: Finished difference Result 64955 states and 95033 transitions. [2025-01-09 04:54:20,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:54:20,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-01-09 04:54:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:20,136 INFO L225 Difference]: With dead ends: 64955 [2025-01-09 04:54:20,136 INFO L226 Difference]: Without dead ends: 32505 [2025-01-09 04:54:20,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:54:20,163 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 408 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:20,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 158 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:54:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32505 states. [2025-01-09 04:54:20,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32505 to 32505. [2025-01-09 04:54:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32505 states, 32504 states have (on average 1.452867339404381) internal successors, (47224), 32504 states have internal predecessors, (47224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32505 states to 32505 states and 47224 transitions. [2025-01-09 04:54:20,851 INFO L78 Accepts]: Start accepts. Automaton has 32505 states and 47224 transitions. Word has length 96 [2025-01-09 04:54:20,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:20,851 INFO L471 AbstractCegarLoop]: Abstraction has 32505 states and 47224 transitions. [2025-01-09 04:54:20,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:20,851 INFO L276 IsEmpty]: Start isEmpty. Operand 32505 states and 47224 transitions. [2025-01-09 04:54:20,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:54:20,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:20,853 INFO L218 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] [2025-01-09 04:54:20,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:54:20,853 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:20,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:20,853 INFO L85 PathProgramCache]: Analyzing trace with hash 239953701, now seen corresponding path program 1 times [2025-01-09 04:54:20,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:20,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120818580] [2025-01-09 04:54:20,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:20,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:20,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:54:20,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:54:20,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:20,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:21,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:21,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120818580] [2025-01-09 04:54:21,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120818580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:21,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:21,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:54:21,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391587768] [2025-01-09 04:54:21,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:21,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:54:21,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:21,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:54:21,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:21,053 INFO L87 Difference]: Start difference. First operand 32505 states and 47224 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:21,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:21,123 INFO L93 Difference]: Finished difference Result 33531 states and 48761 transitions. [2025-01-09 04:54:21,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:54:21,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-01-09 04:54:21,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:21,166 INFO L225 Difference]: With dead ends: 33531 [2025-01-09 04:54:21,166 INFO L226 Difference]: Without dead ends: 33529 [2025-01-09 04:54:21,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:21,178 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:21,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 693 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:54:21,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33529 states. [2025-01-09 04:54:21,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33529 to 33529. [2025-01-09 04:54:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33529 states, 33528 states have (on average 1.4371271772846577) internal successors, (48184), 33528 states have internal predecessors, (48184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:21,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33529 states to 33529 states and 48184 transitions. [2025-01-09 04:54:21,630 INFO L78 Accepts]: Start accepts. Automaton has 33529 states and 48184 transitions. Word has length 96 [2025-01-09 04:54:21,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:21,630 INFO L471 AbstractCegarLoop]: Abstraction has 33529 states and 48184 transitions. [2025-01-09 04:54:21,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:21,630 INFO L276 IsEmpty]: Start isEmpty. Operand 33529 states and 48184 transitions. [2025-01-09 04:54:21,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:54:21,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:21,639 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:21,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:54:21,639 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:21,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:21,640 INFO L85 PathProgramCache]: Analyzing trace with hash -714656545, now seen corresponding path program 1 times [2025-01-09 04:54:21,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:21,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205111099] [2025-01-09 04:54:21,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:21,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:21,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:54:21,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:54:21,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:21,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:21,919 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:54:21,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:21,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205111099] [2025-01-09 04:54:21,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205111099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:21,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:21,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:54:21,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817518742] [2025-01-09 04:54:21,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:21,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:21,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:21,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:21,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:21,920 INFO L87 Difference]: Start difference. First operand 33529 states and 48184 transitions. Second operand has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:22,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:22,747 INFO L93 Difference]: Finished difference Result 278281 states and 399872 transitions. [2025-01-09 04:54:22,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:54:22,750 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 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 [2025-01-09 04:54:22,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:23,054 INFO L225 Difference]: With dead ends: 278281 [2025-01-09 04:54:23,054 INFO L226 Difference]: Without dead ends: 244807 [2025-01-09 04:54:23,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:54:23,319 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 2154 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2154 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:23,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2154 Valid, 1911 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:54:23,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244807 states. [2025-01-09 04:54:24,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244807 to 67001. [2025-01-09 04:54:24,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67001 states, 67000 states have (on average 1.4327164179104477) internal successors, (95992), 67000 states have internal predecessors, (95992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:25,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67001 states to 67001 states and 95992 transitions. [2025-01-09 04:54:25,069 INFO L78 Accepts]: Start accepts. Automaton has 67001 states and 95992 transitions. Word has length 131 [2025-01-09 04:54:25,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:25,069 INFO L471 AbstractCegarLoop]: Abstraction has 67001 states and 95992 transitions. [2025-01-09 04:54:25,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:25,069 INFO L276 IsEmpty]: Start isEmpty. Operand 67001 states and 95992 transitions. [2025-01-09 04:54:25,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:54:25,077 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:25,078 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:25,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:54:25,078 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:25,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:25,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1365457691, now seen corresponding path program 1 times [2025-01-09 04:54:25,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:25,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887859587] [2025-01-09 04:54:25,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:25,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:25,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:54:25,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:54:25,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:25,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:25,277 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:54:25,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:25,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887859587] [2025-01-09 04:54:25,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887859587] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:25,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:25,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:54:25,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739052109] [2025-01-09 04:54:25,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:25,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:25,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:25,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:25,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:25,279 INFO L87 Difference]: Start difference. First operand 67001 states and 95992 transitions. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 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) [2025-01-09 04:54:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:26,317 INFO L93 Difference]: Finished difference Result 311753 states and 447680 transitions. [2025-01-09 04:54:26,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:54:26,319 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 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 131 [2025-01-09 04:54:26,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:26,657 INFO L225 Difference]: With dead ends: 311753 [2025-01-09 04:54:26,657 INFO L226 Difference]: Without dead ends: 278279 [2025-01-09 04:54:26,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:54:26,698 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 2275 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2275 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:26,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2275 Valid, 1743 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:54:26,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278279 states. [2025-01-09 04:54:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278279 to 117241. [2025-01-09 04:54:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117241 states, 117240 states have (on average 1.4279767997270556) internal successors, (167416), 117240 states have internal predecessors, (167416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117241 states to 117241 states and 167416 transitions. [2025-01-09 04:54:29,072 INFO L78 Accepts]: Start accepts. Automaton has 117241 states and 167416 transitions. Word has length 131 [2025-01-09 04:54:29,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:29,073 INFO L471 AbstractCegarLoop]: Abstraction has 117241 states and 167416 transitions. [2025-01-09 04:54:29,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 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) [2025-01-09 04:54:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 117241 states and 167416 transitions. [2025-01-09 04:54:29,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:54:29,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:29,082 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:29,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:54:29,082 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:29,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:29,083 INFO L85 PathProgramCache]: Analyzing trace with hash -770469891, now seen corresponding path program 1 times [2025-01-09 04:54:29,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:29,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578569172] [2025-01-09 04:54:29,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:29,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:29,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:54:29,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:54:29,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:29,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 04:54:29,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:29,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578569172] [2025-01-09 04:54:29,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578569172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:29,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:29,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:54:29,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230931729] [2025-01-09 04:54:29,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:29,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:29,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:29,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:29,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:29,535 INFO L87 Difference]: Start difference. First operand 117241 states and 167416 transitions. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:30,320 INFO L93 Difference]: Finished difference Result 345225 states and 495488 transitions. [2025-01-09 04:54:30,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:54:30,320 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 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 [2025-01-09 04:54:30,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:31,122 INFO L225 Difference]: With dead ends: 345225 [2025-01-09 04:54:31,123 INFO L226 Difference]: Without dead ends: 311751 [2025-01-09 04:54:31,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:54:31,200 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 2143 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2143 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:31,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2143 Valid, 1917 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:54:31,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311751 states. [2025-01-09 04:54:33,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311751 to 150713. [2025-01-09 04:54:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150713 states, 150712 states have (on average 1.4280481978873614) internal successors, (215224), 150712 states have internal predecessors, (215224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150713 states to 150713 states and 215224 transitions. [2025-01-09 04:54:34,025 INFO L78 Accepts]: Start accepts. Automaton has 150713 states and 215224 transitions. Word has length 131 [2025-01-09 04:54:34,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:34,025 INFO L471 AbstractCegarLoop]: Abstraction has 150713 states and 215224 transitions. [2025-01-09 04:54:34,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 150713 states and 215224 transitions. [2025-01-09 04:54:34,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:54:34,034 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:34,034 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:34,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:54:34,035 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:34,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:34,035 INFO L85 PathProgramCache]: Analyzing trace with hash 383476215, now seen corresponding path program 1 times [2025-01-09 04:54:34,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:34,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630408873] [2025-01-09 04:54:34,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:34,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:34,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:54:34,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:54:34,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:34,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:34,179 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 04:54:34,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:34,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630408873] [2025-01-09 04:54:34,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630408873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:34,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:34,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:54:34,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756520783] [2025-01-09 04:54:34,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:34,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:34,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:34,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:34,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:34,181 INFO L87 Difference]: Start difference. First operand 150713 states and 215224 transitions. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 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) [2025-01-09 04:54:35,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:35,545 INFO L93 Difference]: Finished difference Result 378697 states and 543296 transitions. [2025-01-09 04:54:35,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:54:35,545 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 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 131 [2025-01-09 04:54:35,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:36,089 INFO L225 Difference]: With dead ends: 378697 [2025-01-09 04:54:36,089 INFO L226 Difference]: Without dead ends: 345223 [2025-01-09 04:54:36,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:54:36,200 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 1876 mSDsluCounter, 1711 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1876 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:36,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1876 Valid, 2009 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:54:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345223 states. [2025-01-09 04:54:39,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345223 to 184185. [2025-01-09 04:54:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184185 states, 184184 states have (on average 1.4280936454849498) internal successors, (263032), 184184 states have internal predecessors, (263032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:39,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184185 states to 184185 states and 263032 transitions. [2025-01-09 04:54:39,808 INFO L78 Accepts]: Start accepts. Automaton has 184185 states and 263032 transitions. Word has length 131 [2025-01-09 04:54:39,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:39,808 INFO L471 AbstractCegarLoop]: Abstraction has 184185 states and 263032 transitions. [2025-01-09 04:54:39,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 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) [2025-01-09 04:54:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 184185 states and 263032 transitions. [2025-01-09 04:54:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:54:39,819 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:39,819 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:39,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:54:39,827 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:39,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:39,828 INFO L85 PathProgramCache]: Analyzing trace with hash -474424463, now seen corresponding path program 1 times [2025-01-09 04:54:39,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:39,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291845578] [2025-01-09 04:54:39,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:39,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:39,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:54:39,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:54:39,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:39,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:54:40,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:40,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291845578] [2025-01-09 04:54:40,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291845578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:40,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:40,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:54:40,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968291776] [2025-01-09 04:54:40,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:40,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:40,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:40,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:40,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:40,560 INFO L87 Difference]: Start difference. First operand 184185 states and 263032 transitions. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:42,064 INFO L93 Difference]: Finished difference Result 412169 states and 591104 transitions. [2025-01-09 04:54:42,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:54:42,065 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-01-09 04:54:42,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:43,092 INFO L225 Difference]: With dead ends: 412169 [2025-01-09 04:54:43,092 INFO L226 Difference]: Without dead ends: 378695 [2025-01-09 04:54:43,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:54:43,169 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 1807 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:43,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1807 Valid, 2048 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:54:43,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378695 states. [2025-01-09 04:54:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378695 to 217657. [2025-01-09 04:54:46,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217657 states, 217656 states have (on average 1.4281251148601464) internal successors, (310840), 217656 states have internal predecessors, (310840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217657 states to 217657 states and 310840 transitions. [2025-01-09 04:54:47,021 INFO L78 Accepts]: Start accepts. Automaton has 217657 states and 310840 transitions. Word has length 131 [2025-01-09 04:54:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:47,021 INFO L471 AbstractCegarLoop]: Abstraction has 217657 states and 310840 transitions. [2025-01-09 04:54:47,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 217657 states and 310840 transitions. [2025-01-09 04:54:47,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:54:47,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:47,042 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:47,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:54:47,042 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:47,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:47,043 INFO L85 PathProgramCache]: Analyzing trace with hash 954072171, now seen corresponding path program 1 times [2025-01-09 04:54:47,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:47,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704393609] [2025-01-09 04:54:47,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:47,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:47,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:54:47,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:54:47,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:47,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 04:54:47,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:47,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704393609] [2025-01-09 04:54:47,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704393609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:47,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:47,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:54:47,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736956553] [2025-01-09 04:54:47,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:47,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:47,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:47,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:47,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:47,374 INFO L87 Difference]: Start difference. First operand 217657 states and 310840 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:48,722 INFO L93 Difference]: Finished difference Result 445641 states and 638912 transitions. [2025-01-09 04:54:48,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:54:48,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 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 [2025-01-09 04:54:48,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:49,335 INFO L225 Difference]: With dead ends: 445641 [2025-01-09 04:54:49,336 INFO L226 Difference]: Without dead ends: 412167 [2025-01-09 04:54:49,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:54:49,429 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 1889 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1889 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:49,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1889 Valid, 2158 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:54:49,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412167 states.