./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.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_floodmax.3.ufo.BOUNDED-6.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 4f742293e1d7618171cf3a543c4629a6bee745f5c0d4fe8b828e91b8996c2b07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:36:16,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:36:16,707 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:36:16,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:36:16,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:36:16,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:36:16,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:36:16,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:36:16,728 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:36:16,728 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:36:16,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:36:16,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:36:16,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:36:16,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:36:16,729 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:36:16,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:36:16,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:36:16,729 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:36:16,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:36:16,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:36:16,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:36:16,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:36:16,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:36:16,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:36:16,729 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:36:16,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:36:16,729 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:36:16,729 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:36:16,730 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:36:16,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:36:16,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:36:16,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:36:16,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:36:16,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:36:16,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:36:16,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:36:16,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:36:16,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:36:16,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:36:16,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:36:16,730 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:36:16,730 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:36:16,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:36:16,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:36:16,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:36:16,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:36:16,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:36:16,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:36:16,734 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 -> 4f742293e1d7618171cf3a543c4629a6bee745f5c0d4fe8b828e91b8996c2b07 [2025-01-09 04:36:16,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:36:16,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:36:16,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:36:16,975 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:36:16,975 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:36:16,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-01-09 04:36:18,117 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9966f0bc/940af6e876fa44cfad9520f542fe3d24/FLAGfc0f0374c [2025-01-09 04:36:18,456 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:36:18,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-01-09 04:36:18,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9966f0bc/940af6e876fa44cfad9520f542fe3d24/FLAGfc0f0374c [2025-01-09 04:36:18,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9966f0bc/940af6e876fa44cfad9520f542fe3d24 [2025-01-09 04:36:18,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:36:18,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:36:18,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:36:18,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:36:18,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:36:18,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:36:18" (1/1) ... [2025-01-09 04:36:18,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f081c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:18, skipping insertion in model container [2025-01-09 04:36:18,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:36:18" (1/1) ... [2025-01-09 04:36:18,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:36:18,716 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_floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7233,7246] [2025-01-09 04:36:18,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:36:18,770 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:36:18,797 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_floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7233,7246] [2025-01-09 04:36:18,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:36:18,820 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:36:18,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:18 WrapperNode [2025-01-09 04:36:18,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:36:18,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:36:18,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:36:18,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:36:18,832 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:36:18" (1/1) ... [2025-01-09 04:36:18,847 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:36:18" (1/1) ... [2025-01-09 04:36:18,894 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 633 [2025-01-09 04:36:18,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:36:18,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:36:18,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:36:18,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:36:18,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:18" (1/1) ... [2025-01-09 04:36:18,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:18" (1/1) ... [2025-01-09 04:36:18,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:18" (1/1) ... [2025-01-09 04:36:18,938 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:36:18,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:18" (1/1) ... [2025-01-09 04:36:18,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:18" (1/1) ... [2025-01-09 04:36:18,953 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:18" (1/1) ... [2025-01-09 04:36:18,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:18" (1/1) ... [2025-01-09 04:36:18,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:18" (1/1) ... [2025-01-09 04:36:18,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:18" (1/1) ... [2025-01-09 04:36:18,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:18" (1/1) ... [2025-01-09 04:36:18,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:36:18,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:36:18,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:36:18,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:36:18,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:18" (1/1) ... [2025-01-09 04:36:18,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:36:19,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:36:19,013 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:36:19,015 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:36:19,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:36:19,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:36:19,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:36:19,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:36:19,105 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:36:19,106 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:36:19,553 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-01-09 04:36:19,554 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:36:19,564 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:36:19,564 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:36:19,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:36:19 BoogieIcfgContainer [2025-01-09 04:36:19,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:36:19,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:36:19,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:36:19,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:36:19,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:36:18" (1/3) ... [2025-01-09 04:36:19,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2bba98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:36:19, skipping insertion in model container [2025-01-09 04:36:19,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:18" (2/3) ... [2025-01-09 04:36:19,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2bba98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:36:19, skipping insertion in model container [2025-01-09 04:36:19,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:36:19" (3/3) ... [2025-01-09 04:36:19,571 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-01-09 04:36:19,583 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:36:19,586 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c that has 1 procedures, 135 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:36:19,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:36:19,632 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;@4990c648, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:36:19,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:36:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 133 states have (on average 1.7744360902255638) internal successors, (236), 134 states have internal predecessors, (236), 0 states have call successors, (0), 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:36:19,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:36:19,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:19,647 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] [2025-01-09 04:36:19,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:19,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:19,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1933157835, now seen corresponding path program 1 times [2025-01-09 04:36:19,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:19,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535404517] [2025-01-09 04:36:19,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:19,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:19,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:36:19,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:36:19,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:19,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:20,108 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:36:20,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:20,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535404517] [2025-01-09 04:36:20,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535404517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:20,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:20,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:20,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907551729] [2025-01-09 04:36:20,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:20,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:20,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:20,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:20,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:20,126 INFO L87 Difference]: Start difference. First operand has 135 states, 133 states have (on average 1.7744360902255638) internal successors, (236), 134 states have internal predecessors, (236), 0 states have call successors, (0), 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 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:20,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:20,185 INFO L93 Difference]: Finished difference Result 288 states and 491 transitions. [2025-01-09 04:36:20,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:20,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-01-09 04:36:20,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:20,193 INFO L225 Difference]: With dead ends: 288 [2025-01-09 04:36:20,193 INFO L226 Difference]: Without dead ends: 201 [2025-01-09 04:36:20,195 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:36:20,201 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 131 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:20,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 412 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:20,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-09 04:36:20,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2025-01-09 04:36:20,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 1.5808080808080809) internal successors, (313), 198 states have internal predecessors, (313), 0 states have call successors, (0), 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:36:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 313 transitions. [2025-01-09 04:36:20,234 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 313 transitions. Word has length 57 [2025-01-09 04:36:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:20,235 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 313 transitions. [2025-01-09 04:36:20,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 313 transitions. [2025-01-09 04:36:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 04:36:20,236 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:20,237 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] [2025-01-09 04:36:20,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:36:20,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:20,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:20,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1883490782, now seen corresponding path program 1 times [2025-01-09 04:36:20,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:20,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949247701] [2025-01-09 04:36:20,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:20,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:20,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 04:36:20,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 04:36:20,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:20,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:20,384 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:36:20,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:20,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949247701] [2025-01-09 04:36:20,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949247701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:20,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:20,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:20,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415175242] [2025-01-09 04:36:20,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:20,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:20,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:20,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:20,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:20,386 INFO L87 Difference]: Start difference. First operand 199 states and 313 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:20,433 INFO L93 Difference]: Finished difference Result 475 states and 769 transitions. [2025-01-09 04:36:20,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:20,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-01-09 04:36:20,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:20,435 INFO L225 Difference]: With dead ends: 475 [2025-01-09 04:36:20,435 INFO L226 Difference]: Without dead ends: 330 [2025-01-09 04:36:20,435 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:36:20,436 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 110 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:20,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 442 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:20,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-01-09 04:36:20,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2025-01-09 04:36:20,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.6055045871559632) internal successors, (525), 327 states have internal predecessors, (525), 0 states have call successors, (0), 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:36:20,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 525 transitions. [2025-01-09 04:36:20,462 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 525 transitions. Word has length 59 [2025-01-09 04:36:20,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:20,462 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 525 transitions. [2025-01-09 04:36:20,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:20,463 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 525 transitions. [2025-01-09 04:36:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 04:36:20,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:20,468 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] [2025-01-09 04:36:20,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:36:20,468 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:20,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:20,469 INFO L85 PathProgramCache]: Analyzing trace with hash -111872728, now seen corresponding path program 1 times [2025-01-09 04:36:20,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:20,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955409961] [2025-01-09 04:36:20,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:20,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:20,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 04:36:20,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 04:36:20,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:20,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:20,599 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:36:20,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:20,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955409961] [2025-01-09 04:36:20,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955409961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:20,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:20,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:20,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867047739] [2025-01-09 04:36:20,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:20,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:20,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:20,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:20,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:20,601 INFO L87 Difference]: Start difference. First operand 328 states and 525 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:20,629 INFO L93 Difference]: Finished difference Result 603 states and 981 transitions. [2025-01-09 04:36:20,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:20,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-01-09 04:36:20,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:20,633 INFO L225 Difference]: With dead ends: 603 [2025-01-09 04:36:20,633 INFO L226 Difference]: Without dead ends: 458 [2025-01-09 04:36:20,633 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:36:20,634 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 111 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 444 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:36:20,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 444 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-01-09 04:36:20,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2025-01-09 04:36:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.6153846153846154) internal successors, (735), 455 states have internal predecessors, (735), 0 states have call successors, (0), 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:36:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 735 transitions. [2025-01-09 04:36:20,656 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 735 transitions. Word has length 61 [2025-01-09 04:36:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:20,657 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 735 transitions. [2025-01-09 04:36:20,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 735 transitions. [2025-01-09 04:36:20,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 04:36:20,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:20,660 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] [2025-01-09 04:36:20,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:36:20,661 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:20,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:20,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1275396395, now seen corresponding path program 1 times [2025-01-09 04:36:20,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:20,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71808151] [2025-01-09 04:36:20,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:20,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:20,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 04:36:20,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 04:36:20,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:20,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:20,815 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:36:20,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:20,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71808151] [2025-01-09 04:36:20,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71808151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:20,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:20,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:20,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247267635] [2025-01-09 04:36:20,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:20,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:20,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:20,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:20,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:20,817 INFO L87 Difference]: Start difference. First operand 456 states and 735 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:20,842 INFO L93 Difference]: Finished difference Result 1172 states and 1911 transitions. [2025-01-09 04:36:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:20,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-01-09 04:36:20,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:20,845 INFO L225 Difference]: With dead ends: 1172 [2025-01-09 04:36:20,845 INFO L226 Difference]: Without dead ends: 793 [2025-01-09 04:36:20,846 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:36:20,846 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 105 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:20,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 380 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:20,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-01-09 04:36:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 791. [2025-01-09 04:36:20,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 790 states have (on average 1.6164556962025316) internal successors, (1277), 790 states have internal predecessors, (1277), 0 states have call successors, (0), 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:36:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1277 transitions. [2025-01-09 04:36:20,862 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1277 transitions. Word has length 61 [2025-01-09 04:36:20,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:20,863 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1277 transitions. [2025-01-09 04:36:20,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:20,863 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1277 transitions. [2025-01-09 04:36:20,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:36:20,864 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:20,864 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] [2025-01-09 04:36:20,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:36:20,864 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:20,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:20,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1280827262, now seen corresponding path program 1 times [2025-01-09 04:36:20,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:20,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121847412] [2025-01-09 04:36:20,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:20,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:20,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:36:20,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:36:20,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:20,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:21,003 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:36:21,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:21,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121847412] [2025-01-09 04:36:21,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121847412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:21,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:21,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:36:21,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243333970] [2025-01-09 04:36:21,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:21,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:36:21,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:21,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:36:21,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:36:21,005 INFO L87 Difference]: Start difference. First operand 791 states and 1277 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:21,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:21,157 INFO L93 Difference]: Finished difference Result 3568 states and 5888 transitions. [2025-01-09 04:36:21,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:36:21,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 04:36:21,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:21,167 INFO L225 Difference]: With dead ends: 3568 [2025-01-09 04:36:21,167 INFO L226 Difference]: Without dead ends: 2854 [2025-01-09 04:36:21,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:36:21,171 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 881 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:21,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1260 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:21,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2025-01-09 04:36:21,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 1432. [2025-01-09 04:36:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1431 states have (on average 1.623340321453529) internal successors, (2323), 1431 states have internal predecessors, (2323), 0 states have call successors, (0), 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:36:21,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2323 transitions. [2025-01-09 04:36:21,223 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2323 transitions. Word has length 63 [2025-01-09 04:36:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:21,224 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 2323 transitions. [2025-01-09 04:36:21,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:21,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2323 transitions. [2025-01-09 04:36:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:36:21,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:21,240 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] [2025-01-09 04:36:21,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:36:21,240 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:21,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:21,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1113443658, now seen corresponding path program 1 times [2025-01-09 04:36:21,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:21,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80329880] [2025-01-09 04:36:21,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:21,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:21,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:36:21,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:36:21,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:21,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:21,343 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:36:21,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:21,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80329880] [2025-01-09 04:36:21,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80329880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:21,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:21,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:21,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569634186] [2025-01-09 04:36:21,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:21,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:21,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:21,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:21,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:21,347 INFO L87 Difference]: Start difference. First operand 1432 states and 2323 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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:36:21,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:21,411 INFO L93 Difference]: Finished difference Result 4199 states and 6910 transitions. [2025-01-09 04:36:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:21,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:36:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:21,422 INFO L225 Difference]: With dead ends: 4199 [2025-01-09 04:36:21,422 INFO L226 Difference]: Without dead ends: 2846 [2025-01-09 04:36:21,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:36:21,425 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 379 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:21,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 607 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:21,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2025-01-09 04:36:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 2127. [2025-01-09 04:36:21,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2127 states, 2126 states have (on average 1.6302916274694261) internal successors, (3466), 2126 states have internal predecessors, (3466), 0 states have call successors, (0), 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:36:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 3466 transitions. [2025-01-09 04:36:21,470 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 3466 transitions. Word has length 64 [2025-01-09 04:36:21,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:21,471 INFO L471 AbstractCegarLoop]: Abstraction has 2127 states and 3466 transitions. [2025-01-09 04:36:21,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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:36:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 3466 transitions. [2025-01-09 04:36:21,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:36:21,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:21,472 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] [2025-01-09 04:36:21,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:36:21,473 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:21,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:21,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1248232611, now seen corresponding path program 1 times [2025-01-09 04:36:21,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:21,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246840197] [2025-01-09 04:36:21,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:21,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:21,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:36:21,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:36:21,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:21,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:21,547 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:36:21,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:21,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246840197] [2025-01-09 04:36:21,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246840197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:21,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:21,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:21,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097456684] [2025-01-09 04:36:21,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:21,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:21,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:21,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:21,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:21,548 INFO L87 Difference]: Start difference. First operand 2127 states and 3466 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:36:21,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:21,575 INFO L93 Difference]: Finished difference Result 4121 states and 6752 transitions. [2025-01-09 04:36:21,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:21,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:36:21,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:21,585 INFO L225 Difference]: With dead ends: 4121 [2025-01-09 04:36:21,585 INFO L226 Difference]: Without dead ends: 2979 [2025-01-09 04:36:21,587 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:36:21,589 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 106 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 426 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:36:21,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 426 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:21,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2025-01-09 04:36:21,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2977. [2025-01-09 04:36:21,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2977 states, 2976 states have (on average 1.6256720430107527) internal successors, (4838), 2976 states have internal predecessors, (4838), 0 states have call successors, (0), 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:36:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 4838 transitions. [2025-01-09 04:36:21,659 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 4838 transitions. Word has length 64 [2025-01-09 04:36:21,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:21,660 INFO L471 AbstractCegarLoop]: Abstraction has 2977 states and 4838 transitions. [2025-01-09 04:36:21,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:36:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 4838 transitions. [2025-01-09 04:36:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:36:21,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:21,661 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] [2025-01-09 04:36:21,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:36:21,661 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:21,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:21,661 INFO L85 PathProgramCache]: Analyzing trace with hash 616386787, now seen corresponding path program 1 times [2025-01-09 04:36:21,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:21,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831833618] [2025-01-09 04:36:21,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:21,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:21,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:36:21,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:36:21,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:21,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:21,716 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:36:21,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:21,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831833618] [2025-01-09 04:36:21,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831833618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:21,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:21,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:21,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85128083] [2025-01-09 04:36:21,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:21,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:21,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:21,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:21,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:21,718 INFO L87 Difference]: Start difference. First operand 2977 states and 4838 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:36:21,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:21,748 INFO L93 Difference]: Finished difference Result 6399 states and 10550 transitions. [2025-01-09 04:36:21,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:21,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:36:21,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:21,761 INFO L225 Difference]: With dead ends: 6399 [2025-01-09 04:36:21,761 INFO L226 Difference]: Without dead ends: 4313 [2025-01-09 04:36:21,765 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:36:21,765 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 116 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 467 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:36:21,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 467 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:21,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2025-01-09 04:36:21,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4311. [2025-01-09 04:36:21,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4311 states, 4310 states have (on average 1.6331786542923434) internal successors, (7039), 4310 states have internal predecessors, (7039), 0 states have call successors, (0), 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:36:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 7039 transitions. [2025-01-09 04:36:21,833 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 7039 transitions. Word has length 64 [2025-01-09 04:36:21,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:21,833 INFO L471 AbstractCegarLoop]: Abstraction has 4311 states and 7039 transitions. [2025-01-09 04:36:21,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:36:21,834 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 7039 transitions. [2025-01-09 04:36:21,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:36:21,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:21,834 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] [2025-01-09 04:36:21,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:36:21,834 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:21,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:21,835 INFO L85 PathProgramCache]: Analyzing trace with hash -214961207, now seen corresponding path program 1 times [2025-01-09 04:36:21,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:21,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043490279] [2025-01-09 04:36:21,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:21,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:21,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:36:21,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:36:21,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:21,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:21,901 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:36:21,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:21,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043490279] [2025-01-09 04:36:21,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043490279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:21,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:21,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:21,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304307952] [2025-01-09 04:36:21,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:21,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:21,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:21,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:21,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:21,903 INFO L87 Difference]: Start difference. First operand 4311 states and 7039 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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:36:22,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:22,015 INFO L93 Difference]: Finished difference Result 13702 states and 22482 transitions. [2025-01-09 04:36:22,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:22,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:36:22,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:22,043 INFO L225 Difference]: With dead ends: 13702 [2025-01-09 04:36:22,043 INFO L226 Difference]: Without dead ends: 9473 [2025-01-09 04:36:22,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:36:22,053 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 377 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:22,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 681 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:22,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9473 states. [2025-01-09 04:36:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9473 to 6863. [2025-01-09 04:36:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6863 states, 6862 states have (on average 1.6264937336053629) internal successors, (11161), 6862 states have internal predecessors, (11161), 0 states have call successors, (0), 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:36:22,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6863 states to 6863 states and 11161 transitions. [2025-01-09 04:36:22,196 INFO L78 Accepts]: Start accepts. Automaton has 6863 states and 11161 transitions. Word has length 65 [2025-01-09 04:36:22,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:22,196 INFO L471 AbstractCegarLoop]: Abstraction has 6863 states and 11161 transitions. [2025-01-09 04:36:22,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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:36:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 6863 states and 11161 transitions. [2025-01-09 04:36:22,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:36:22,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:22,199 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] [2025-01-09 04:36:22,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:36:22,199 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:22,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:22,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1872749021, now seen corresponding path program 1 times [2025-01-09 04:36:22,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:22,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8330896] [2025-01-09 04:36:22,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:22,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:22,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:36:22,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:36:22,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:22,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:22,312 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:36:22,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:22,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8330896] [2025-01-09 04:36:22,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8330896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:22,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:22,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:22,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423263679] [2025-01-09 04:36:22,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:22,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:22,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:22,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:22,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:22,314 INFO L87 Difference]: Start difference. First operand 6863 states and 11161 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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:36:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:22,442 INFO L93 Difference]: Finished difference Result 21434 states and 34994 transitions. [2025-01-09 04:36:22,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:22,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-01-09 04:36:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:22,488 INFO L225 Difference]: With dead ends: 21434 [2025-01-09 04:36:22,489 INFO L226 Difference]: Without dead ends: 14653 [2025-01-09 04:36:22,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:36:22,505 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 375 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:22,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 663 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:22,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14653 states. [2025-01-09 04:36:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14653 to 10715. [2025-01-09 04:36:22,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10715 states, 10714 states have (on average 1.6190965092402465) internal successors, (17347), 10714 states have internal predecessors, (17347), 0 states have call successors, (0), 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:36:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10715 states to 10715 states and 17347 transitions. [2025-01-09 04:36:22,756 INFO L78 Accepts]: Start accepts. Automaton has 10715 states and 17347 transitions. Word has length 66 [2025-01-09 04:36:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:22,756 INFO L471 AbstractCegarLoop]: Abstraction has 10715 states and 17347 transitions. [2025-01-09 04:36:22,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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:36:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 10715 states and 17347 transitions. [2025-01-09 04:36:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:36:22,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:22,757 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] [2025-01-09 04:36:22,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:36:22,757 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:22,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:22,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1396799506, now seen corresponding path program 1 times [2025-01-09 04:36:22,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:22,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766171446] [2025-01-09 04:36:22,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:22,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:22,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:36:22,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:36:22,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:22,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:22,984 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:36:22,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:22,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766171446] [2025-01-09 04:36:22,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766171446] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:22,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:22,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:36:22,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473425992] [2025-01-09 04:36:22,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:22,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:36:22,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:22,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:36:22,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:36:22,986 INFO L87 Difference]: Start difference. First operand 10715 states and 17347 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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:36:23,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:23,077 INFO L93 Difference]: Finished difference Result 21350 states and 34583 transitions. [2025-01-09 04:36:23,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:36:23,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-01-09 04:36:23,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:23,094 INFO L225 Difference]: With dead ends: 21350 [2025-01-09 04:36:23,094 INFO L226 Difference]: Without dead ends: 10717 [2025-01-09 04:36:23,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:36:23,106 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 313 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:23,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 551 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:23,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10717 states. [2025-01-09 04:36:23,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10717 to 10715. [2025-01-09 04:36:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10715 states, 10714 states have (on average 1.607429531454172) internal successors, (17222), 10714 states have internal predecessors, (17222), 0 states have call successors, (0), 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:36:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10715 states to 10715 states and 17222 transitions. [2025-01-09 04:36:23,286 INFO L78 Accepts]: Start accepts. Automaton has 10715 states and 17222 transitions. Word has length 68 [2025-01-09 04:36:23,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:23,286 INFO L471 AbstractCegarLoop]: Abstraction has 10715 states and 17222 transitions. [2025-01-09 04:36:23,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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:36:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 10715 states and 17222 transitions. [2025-01-09 04:36:23,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:36:23,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:23,287 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] [2025-01-09 04:36:23,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:36:23,287 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:23,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:23,287 INFO L85 PathProgramCache]: Analyzing trace with hash -164512453, now seen corresponding path program 1 times [2025-01-09 04:36:23,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:23,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30746635] [2025-01-09 04:36:23,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:23,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:23,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:36:23,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:36:23,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:23,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:23,440 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:36:23,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:23,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30746635] [2025-01-09 04:36:23,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30746635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:23,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:23,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:36:23,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690870468] [2025-01-09 04:36:23,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:23,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:36:23,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:23,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:36:23,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:36:23,442 INFO L87 Difference]: Start difference. First operand 10715 states and 17222 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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:36:23,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:23,542 INFO L93 Difference]: Finished difference Result 30660 states and 49437 transitions. [2025-01-09 04:36:23,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:36:23,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-01-09 04:36:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:23,572 INFO L225 Difference]: With dead ends: 30660 [2025-01-09 04:36:23,572 INFO L226 Difference]: Without dead ends: 20027 [2025-01-09 04:36:23,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:36:23,587 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 205 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:23,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 560 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:23,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20027 states. [2025-01-09 04:36:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20027 to 20025. [2025-01-09 04:36:23,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20025 states, 20024 states have (on average 1.5949360767079506) internal successors, (31937), 20024 states have internal predecessors, (31937), 0 states have call successors, (0), 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:36:23,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20025 states to 20025 states and 31937 transitions. [2025-01-09 04:36:23,949 INFO L78 Accepts]: Start accepts. Automaton has 20025 states and 31937 transitions. Word has length 71 [2025-01-09 04:36:23,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:23,949 INFO L471 AbstractCegarLoop]: Abstraction has 20025 states and 31937 transitions. [2025-01-09 04:36:23,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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:36:23,950 INFO L276 IsEmpty]: Start isEmpty. Operand 20025 states and 31937 transitions. [2025-01-09 04:36:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:36:23,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:23,950 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] [2025-01-09 04:36:23,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:36:23,950 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:23,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:23,951 INFO L85 PathProgramCache]: Analyzing trace with hash -806828053, now seen corresponding path program 1 times [2025-01-09 04:36:23,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:23,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183812825] [2025-01-09 04:36:23,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:23,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:23,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:36:23,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:36:23,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:23,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:24,212 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:36:24,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:24,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183812825] [2025-01-09 04:36:24,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183812825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:24,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:24,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:36:24,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753523454] [2025-01-09 04:36:24,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:24,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:36:24,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:24,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:36:24,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:36:24,213 INFO L87 Difference]: Start difference. First operand 20025 states and 31937 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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:36:24,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:24,283 INFO L93 Difference]: Finished difference Result 20751 states and 33024 transitions. [2025-01-09 04:36:24,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:36:24,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2025-01-09 04:36:24,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:24,320 INFO L225 Difference]: With dead ends: 20751 [2025-01-09 04:36:24,320 INFO L226 Difference]: Without dead ends: 20749 [2025-01-09 04:36:24,328 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:36:24,328 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:24,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 787 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:24,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20749 states. [2025-01-09 04:36:24,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20749 to 20749. [2025-01-09 04:36:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20749 states, 20748 states have (on average 1.573742047426258) internal successors, (32652), 20748 states have internal predecessors, (32652), 0 states have call successors, (0), 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:36:24,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20749 states to 20749 states and 32652 transitions. [2025-01-09 04:36:24,684 INFO L78 Accepts]: Start accepts. Automaton has 20749 states and 32652 transitions. Word has length 72 [2025-01-09 04:36:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:24,684 INFO L471 AbstractCegarLoop]: Abstraction has 20749 states and 32652 transitions. [2025-01-09 04:36:24,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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:36:24,685 INFO L276 IsEmpty]: Start isEmpty. Operand 20749 states and 32652 transitions. [2025-01-09 04:36:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:36:24,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:24,687 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] [2025-01-09 04:36:24,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:36:24,687 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:24,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:24,687 INFO L85 PathProgramCache]: Analyzing trace with hash 25494517, now seen corresponding path program 1 times [2025-01-09 04:36:24,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:24,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237402220] [2025-01-09 04:36:24,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:24,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:24,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:36:24,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:36:24,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:24,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:36:24,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:24,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237402220] [2025-01-09 04:36:24,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237402220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:24,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:24,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:36:24,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755065993] [2025-01-09 04:36:24,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:24,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:36:24,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:24,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:36:24,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:36:24,793 INFO L87 Difference]: Start difference. First operand 20749 states and 32652 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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:36:24,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:24,947 INFO L93 Difference]: Finished difference Result 50557 states and 79854 transitions. [2025-01-09 04:36:24,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:36:24,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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 93 [2025-01-09 04:36:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:25,012 INFO L225 Difference]: With dead ends: 50557 [2025-01-09 04:36:25,012 INFO L226 Difference]: Without dead ends: 40765 [2025-01-09 04:36:25,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:36:25,037 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 479 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:25,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 936 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:25,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40765 states. [2025-01-09 04:36:25,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40765 to 31835. [2025-01-09 04:36:25,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31835 states, 31834 states have (on average 1.572532512408117) internal successors, (50060), 31834 states have internal predecessors, (50060), 0 states have call successors, (0), 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:36:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31835 states to 31835 states and 50060 transitions. [2025-01-09 04:36:25,456 INFO L78 Accepts]: Start accepts. Automaton has 31835 states and 50060 transitions. Word has length 93 [2025-01-09 04:36:25,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:25,457 INFO L471 AbstractCegarLoop]: Abstraction has 31835 states and 50060 transitions. [2025-01-09 04:36:25,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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:36:25,457 INFO L276 IsEmpty]: Start isEmpty. Operand 31835 states and 50060 transitions. [2025-01-09 04:36:25,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:36:25,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:25,459 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:36:25,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:36:25,460 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:25,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:25,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1396393528, now seen corresponding path program 1 times [2025-01-09 04:36:25,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:25,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430581025] [2025-01-09 04:36:25,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:25,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:25,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:36:25,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:36:25,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:25,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:25,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:36:25,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:25,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430581025] [2025-01-09 04:36:25,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430581025] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:25,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:25,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:36:25,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2574021] [2025-01-09 04:36:25,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:25,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:36:25,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:25,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:36:25,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:36:25,639 INFO L87 Difference]: Start difference. First operand 31835 states and 50060 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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:36:25,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:25,808 INFO L93 Difference]: Finished difference Result 54449 states and 86018 transitions. [2025-01-09 04:36:25,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:36:25,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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 93 [2025-01-09 04:36:25,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:25,889 INFO L225 Difference]: With dead ends: 54449 [2025-01-09 04:36:25,889 INFO L226 Difference]: Without dead ends: 44657 [2025-01-09 04:36:25,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:36:25,913 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 478 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:25,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 872 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:25,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44657 states. [2025-01-09 04:36:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44657 to 43067. [2025-01-09 04:36:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43067 states, 43066 states have (on average 1.573445409371662) internal successors, (67762), 43066 states have internal predecessors, (67762), 0 states have call successors, (0), 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:36:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43067 states to 43067 states and 67762 transitions. [2025-01-09 04:36:26,589 INFO L78 Accepts]: Start accepts. Automaton has 43067 states and 67762 transitions. Word has length 93 [2025-01-09 04:36:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:26,590 INFO L471 AbstractCegarLoop]: Abstraction has 43067 states and 67762 transitions. [2025-01-09 04:36:26,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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:36:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 43067 states and 67762 transitions. [2025-01-09 04:36:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:36:26,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:26,592 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:36:26,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:36:26,593 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:26,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:26,593 INFO L85 PathProgramCache]: Analyzing trace with hash 71809854, now seen corresponding path program 1 times [2025-01-09 04:36:26,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:26,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210410243] [2025-01-09 04:36:26,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:26,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:26,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:36:26,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:36:26,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:26,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:26,713 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:36:26,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:26,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210410243] [2025-01-09 04:36:26,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210410243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:26,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:26,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:36:26,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958156157] [2025-01-09 04:36:26,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:26,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:36:26,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:26,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:36:26,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:36:26,716 INFO L87 Difference]: Start difference. First operand 43067 states and 67762 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 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:36:26,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:26,966 INFO L93 Difference]: Finished difference Result 61063 states and 96646 transitions. [2025-01-09 04:36:26,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:36:26,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 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 93 [2025-01-09 04:36:26,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:27,206 INFO L225 Difference]: With dead ends: 61063 [2025-01-09 04:36:27,206 INFO L226 Difference]: Without dead ends: 51041 [2025-01-09 04:36:27,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:36:27,222 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 476 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:27,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 985 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:27,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51041 states. [2025-01-09 04:36:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51041 to 49451. [2025-01-09 04:36:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49451 states, 49450 states have (on average 1.5763397371081902) internal successors, (77950), 49450 states have internal predecessors, (77950), 0 states have call successors, (0), 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:36:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49451 states to 49451 states and 77950 transitions. [2025-01-09 04:36:27,788 INFO L78 Accepts]: Start accepts. Automaton has 49451 states and 77950 transitions. Word has length 93 [2025-01-09 04:36:27,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:27,789 INFO L471 AbstractCegarLoop]: Abstraction has 49451 states and 77950 transitions. [2025-01-09 04:36:27,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 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:36:27,789 INFO L276 IsEmpty]: Start isEmpty. Operand 49451 states and 77950 transitions. [2025-01-09 04:36:27,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:36:27,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:27,791 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:36:27,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:36:27,791 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:27,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:27,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1205465200, now seen corresponding path program 1 times [2025-01-09 04:36:27,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:27,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486750331] [2025-01-09 04:36:27,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:27,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:27,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:36:27,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:36:27,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:27,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:27,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:27,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486750331] [2025-01-09 04:36:27,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486750331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:27,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:27,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:27,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167876808] [2025-01-09 04:36:27,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:27,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:27,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:27,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:27,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:27,872 INFO L87 Difference]: Start difference. First operand 49451 states and 77950 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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:36:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:28,080 INFO L93 Difference]: Finished difference Result 92380 states and 146099 transitions. [2025-01-09 04:36:28,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:28,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-01-09 04:36:28,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:28,148 INFO L225 Difference]: With dead ends: 92380 [2025-01-09 04:36:28,148 INFO L226 Difference]: Without dead ends: 43011 [2025-01-09 04:36:28,190 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:36:28,191 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 87 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:28,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 433 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:28,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43011 states. [2025-01-09 04:36:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43011 to 43005. [2025-01-09 04:36:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43005 states, 43004 states have (on average 1.5771556134313087) internal successors, (67824), 43004 states have internal predecessors, (67824), 0 states have call successors, (0), 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:36:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43005 states to 43005 states and 67824 transitions. [2025-01-09 04:36:29,084 INFO L78 Accepts]: Start accepts. Automaton has 43005 states and 67824 transitions. Word has length 94 [2025-01-09 04:36:29,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:29,084 INFO L471 AbstractCegarLoop]: Abstraction has 43005 states and 67824 transitions. [2025-01-09 04:36:29,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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:36:29,085 INFO L276 IsEmpty]: Start isEmpty. Operand 43005 states and 67824 transitions. [2025-01-09 04:36:29,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:36:29,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:29,087 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:36:29,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:36:29,087 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:29,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:29,088 INFO L85 PathProgramCache]: Analyzing trace with hash -209592631, now seen corresponding path program 1 times [2025-01-09 04:36:29,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:29,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954692390] [2025-01-09 04:36:29,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:29,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:29,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:36:29,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:36:29,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:29,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:36:29,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:29,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954692390] [2025-01-09 04:36:29,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954692390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:29,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:29,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:29,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617567571] [2025-01-09 04:36:29,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:29,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:29,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:29,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:29,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:29,312 INFO L87 Difference]: Start difference. First operand 43005 states and 67824 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 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:36:29,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:29,837 INFO L93 Difference]: Finished difference Result 102019 states and 161793 transitions. [2025-01-09 04:36:29,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:36:29,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 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 94 [2025-01-09 04:36:29,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:29,963 INFO L225 Difference]: With dead ends: 102019 [2025-01-09 04:36:29,963 INFO L226 Difference]: Without dead ends: 77437 [2025-01-09 04:36:30,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:36:30,003 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 405 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:30,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 538 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:36:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77437 states. [2025-01-09 04:36:30,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77437 to 67003. [2025-01-09 04:36:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67003 states, 67002 states have (on average 1.5803707352019343) internal successors, (105888), 67002 states have internal predecessors, (105888), 0 states have call successors, (0), 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:36:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67003 states to 67003 states and 105888 transitions. [2025-01-09 04:36:30,872 INFO L78 Accepts]: Start accepts. Automaton has 67003 states and 105888 transitions. Word has length 94 [2025-01-09 04:36:30,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:30,873 INFO L471 AbstractCegarLoop]: Abstraction has 67003 states and 105888 transitions. [2025-01-09 04:36:30,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 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:36:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand 67003 states and 105888 transitions. [2025-01-09 04:36:30,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:36:30,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:30,878 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:30,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:36:30,878 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:30,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:30,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2003616192, now seen corresponding path program 1 times [2025-01-09 04:36:30,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:30,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434442572] [2025-01-09 04:36:30,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:30,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:30,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:36:30,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:36:30,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:30,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:36:30,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:30,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434442572] [2025-01-09 04:36:30,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434442572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:30,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:30,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:30,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335257729] [2025-01-09 04:36:30,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:30,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:30,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:30,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:30,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:30,928 INFO L87 Difference]: Start difference. First operand 67003 states and 105888 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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:36:31,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:31,581 INFO L93 Difference]: Finished difference Result 158352 states and 250596 transitions. [2025-01-09 04:36:31,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:31,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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 94 [2025-01-09 04:36:31,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:31,734 INFO L225 Difference]: With dead ends: 158352 [2025-01-09 04:36:31,734 INFO L226 Difference]: Without dead ends: 113752 [2025-01-09 04:36:31,765 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:36:31,766 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 96 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:31,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 367 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:31,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113752 states. [2025-01-09 04:36:32,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113752 to 113431. [2025-01-09 04:36:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113431 states, 113430 states have (on average 1.5783478797496253) internal successors, (179032), 113430 states have internal predecessors, (179032), 0 states have call successors, (0), 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:36:33,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113431 states to 113431 states and 179032 transitions. [2025-01-09 04:36:33,091 INFO L78 Accepts]: Start accepts. Automaton has 113431 states and 179032 transitions. Word has length 94 [2025-01-09 04:36:33,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:33,091 INFO L471 AbstractCegarLoop]: Abstraction has 113431 states and 179032 transitions. [2025-01-09 04:36:33,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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:36:33,091 INFO L276 IsEmpty]: Start isEmpty. Operand 113431 states and 179032 transitions. [2025-01-09 04:36:33,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:36:33,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:33,093 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:36:33,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:36:33,093 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:33,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:33,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1140588764, now seen corresponding path program 1 times [2025-01-09 04:36:33,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:33,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783354835] [2025-01-09 04:36:33,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:33,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:33,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:36:33,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:36:33,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:33,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:33,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:33,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783354835] [2025-01-09 04:36:33,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783354835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:33,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:33,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:33,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237305790] [2025-01-09 04:36:33,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:33,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:33,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:33,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:33,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:33,393 INFO L87 Difference]: Start difference. First operand 113431 states and 179032 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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:36:33,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:33,683 INFO L93 Difference]: Finished difference Result 164375 states and 259543 transitions. [2025-01-09 04:36:33,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:33,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-01-09 04:36:33,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:33,757 INFO L225 Difference]: With dead ends: 164375 [2025-01-09 04:36:33,758 INFO L226 Difference]: Without dead ends: 51049 [2025-01-09 04:36:33,836 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:36:33,837 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 65 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:33,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 411 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51049 states. [2025-01-09 04:36:34,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51049 to 51047. [2025-01-09 04:36:34,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51047 states, 51046 states have (on average 1.5693883947811778) internal successors, (80111), 51046 states have internal predecessors, (80111), 0 states have call successors, (0), 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:36:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51047 states to 51047 states and 80111 transitions. [2025-01-09 04:36:34,515 INFO L78 Accepts]: Start accepts. Automaton has 51047 states and 80111 transitions. Word has length 94 [2025-01-09 04:36:34,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:34,515 INFO L471 AbstractCegarLoop]: Abstraction has 51047 states and 80111 transitions. [2025-01-09 04:36:34,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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:36:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 51047 states and 80111 transitions. [2025-01-09 04:36:34,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:36:34,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:34,516 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:36:34,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:36:34,516 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:34,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:34,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1305716613, now seen corresponding path program 1 times [2025-01-09 04:36:34,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:34,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869716711] [2025-01-09 04:36:34,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:34,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:34,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:36:34,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:36:34,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:34,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:36:34,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:34,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869716711] [2025-01-09 04:36:34,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869716711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:34,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:34,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:34,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358436116] [2025-01-09 04:36:34,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:34,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:34,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:34,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:34,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:34,678 INFO L87 Difference]: Start difference. First operand 51047 states and 80111 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 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:36:35,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:35,157 INFO L93 Difference]: Finished difference Result 114217 states and 179289 transitions. [2025-01-09 04:36:35,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:36:35,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 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 94 [2025-01-09 04:36:35,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:35,270 INFO L225 Difference]: With dead ends: 114217 [2025-01-09 04:36:35,270 INFO L226 Difference]: Without dead ends: 83981 [2025-01-09 04:36:35,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:36:35,314 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 343 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:35,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 570 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:35,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83981 states. [2025-01-09 04:36:36,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83981 to 76765. [2025-01-09 04:36:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76765 states, 76764 states have (on average 1.5659944765775624) internal successors, (120212), 76764 states have internal predecessors, (120212), 0 states have call successors, (0), 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:36:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76765 states to 76765 states and 120212 transitions. [2025-01-09 04:36:36,313 INFO L78 Accepts]: Start accepts. Automaton has 76765 states and 120212 transitions. Word has length 94 [2025-01-09 04:36:36,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:36,314 INFO L471 AbstractCegarLoop]: Abstraction has 76765 states and 120212 transitions. [2025-01-09 04:36:36,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 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:36:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 76765 states and 120212 transitions. [2025-01-09 04:36:36,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:36:36,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:36,315 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:36,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:36:36,315 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:36,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:36,315 INFO L85 PathProgramCache]: Analyzing trace with hash -905514364, now seen corresponding path program 1 times [2025-01-09 04:36:36,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:36,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359585197] [2025-01-09 04:36:36,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:36,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:36,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:36:36,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:36:36,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:36,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:36:36,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:36,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359585197] [2025-01-09 04:36:36,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359585197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:36,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:36,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:36,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874303019] [2025-01-09 04:36:36,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:36,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:36,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:36,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:36,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:36,393 INFO L87 Difference]: Start difference. First operand 76765 states and 120212 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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:36:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:36,648 INFO L93 Difference]: Finished difference Result 117504 states and 184865 transitions. [2025-01-09 04:36:36,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:36,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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:36:36,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:36,770 INFO L225 Difference]: With dead ends: 117504 [2025-01-09 04:36:36,771 INFO L226 Difference]: Without dead ends: 96868 [2025-01-09 04:36:36,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:36,813 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 229 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:36,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 631 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:37,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96868 states. [2025-01-09 04:36:38,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96868 to 91080. [2025-01-09 04:36:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91080 states, 91079 states have (on average 1.566266647635569) internal successors, (142654), 91079 states have internal predecessors, (142654), 0 states have call successors, (0), 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:36:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91080 states to 91080 states and 142654 transitions. [2025-01-09 04:36:38,346 INFO L78 Accepts]: Start accepts. Automaton has 91080 states and 142654 transitions. Word has length 95 [2025-01-09 04:36:38,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:38,347 INFO L471 AbstractCegarLoop]: Abstraction has 91080 states and 142654 transitions. [2025-01-09 04:36:38,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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:36:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 91080 states and 142654 transitions. [2025-01-09 04:36:38,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:36:38,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:38,348 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:38,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:36:38,349 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:38,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:38,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2082217056, now seen corresponding path program 1 times [2025-01-09 04:36:38,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:38,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823264568] [2025-01-09 04:36:38,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:38,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:38,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:36:38,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:36:38,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:38,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:36:38,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:38,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823264568] [2025-01-09 04:36:38,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823264568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:38,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:38,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:38,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057808705] [2025-01-09 04:36:38,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:38,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:38,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:38,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:38,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:38,394 INFO L87 Difference]: Start difference. First operand 91080 states and 142654 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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:36:38,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:38,760 INFO L93 Difference]: Finished difference Result 189828 states and 298098 transitions. [2025-01-09 04:36:38,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:38,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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:36:38,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:39,649 INFO L225 Difference]: With dead ends: 189828 [2025-01-09 04:36:39,649 INFO L226 Difference]: Without dead ends: 150193 [2025-01-09 04:36:39,696 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:36:39,698 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 91 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:39,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 385 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:39,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150193 states. [2025-01-09 04:36:41,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150193 to 149810. [2025-01-09 04:36:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149810 states, 149809 states have (on average 1.5652130379349705) internal successors, (234483), 149809 states have internal predecessors, (234483), 0 states have call successors, (0), 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:36:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149810 states to 149810 states and 234483 transitions. [2025-01-09 04:36:41,458 INFO L78 Accepts]: Start accepts. Automaton has 149810 states and 234483 transitions. Word has length 95 [2025-01-09 04:36:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:41,458 INFO L471 AbstractCegarLoop]: Abstraction has 149810 states and 234483 transitions. [2025-01-09 04:36:41,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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:36:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 149810 states and 234483 transitions. [2025-01-09 04:36:41,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:36:41,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:41,459 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:41,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:36:41,459 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:41,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:41,460 INFO L85 PathProgramCache]: Analyzing trace with hash -74444096, now seen corresponding path program 1 times [2025-01-09 04:36:41,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:41,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500423425] [2025-01-09 04:36:41,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:41,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:41,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:36:41,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:36:41,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:41,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:41,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:41,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500423425] [2025-01-09 04:36:41,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500423425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:41,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:41,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:41,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600799424] [2025-01-09 04:36:41,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:41,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:41,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:41,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:41,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:41,846 INFO L87 Difference]: Start difference. First operand 149810 states and 234483 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:36:42,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:42,802 INFO L93 Difference]: Finished difference Result 441441 states and 690790 transitions. [2025-01-09 04:36:42,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:42,803 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:36:42,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:43,770 INFO L225 Difference]: With dead ends: 441441 [2025-01-09 04:36:43,770 INFO L226 Difference]: Without dead ends: 291720 [2025-01-09 04:36:43,871 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:36:43,872 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 163 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:43,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 512 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291720 states. [2025-01-09 04:36:47,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291720 to 291718. [2025-01-09 04:36:47,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291718 states, 291717 states have (on average 1.554338622706253) internal successors, (453427), 291717 states have internal predecessors, (453427), 0 states have call successors, (0), 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:36:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291718 states to 291718 states and 453427 transitions. [2025-01-09 04:36:47,951 INFO L78 Accepts]: Start accepts. Automaton has 291718 states and 453427 transitions. Word has length 96 [2025-01-09 04:36:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:47,951 INFO L471 AbstractCegarLoop]: Abstraction has 291718 states and 453427 transitions. [2025-01-09 04:36:47,951 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:36:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 291718 states and 453427 transitions. [2025-01-09 04:36:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:36:47,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:47,953 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:47,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:36:47,953 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:47,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:47,953 INFO L85 PathProgramCache]: Analyzing trace with hash 99306698, now seen corresponding path program 1 times [2025-01-09 04:36:47,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:47,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061283860] [2025-01-09 04:36:47,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:47,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:47,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:36:47,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:36:47,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:47,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:47,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 04:36:47,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:47,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061283860] [2025-01-09 04:36:47,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061283860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:47,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:47,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:47,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92600284] [2025-01-09 04:36:47,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:47,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:47,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:47,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:47,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:47,996 INFO L87 Difference]: Start difference. First operand 291718 states and 453427 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:36:51,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:51,042 INFO L93 Difference]: Finished difference Result 859174 states and 1334947 transitions. [2025-01-09 04:36:51,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:51,043 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:36:51,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:52,197 INFO L225 Difference]: With dead ends: 859174 [2025-01-09 04:36:52,197 INFO L226 Difference]: Without dead ends: 567567 [2025-01-09 04:36:52,412 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:36:52,413 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 118 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:52,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 431 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:52,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567567 states.