./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50e151318da71693ecfd101451d51852511de48fd25109c1f84fed946653f0cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:54:36,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:54:36,534 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:54:36,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:54:36,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:54:36,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:54:36,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:54:36,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:54:36,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:54:36,575 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:54:36,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:54:36,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:54:36,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:54:36,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:54:36,576 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:54:36,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:54:36,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:54:36,576 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:54:36,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:54:36,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:54:36,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:54:36,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:54:36,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:54:36,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:54:36,577 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:54:36,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:54:36,577 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:54:36,577 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:54:36,577 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:54:36,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:54:36,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:54:36,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:54:36,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:54:36,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:54:36,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:54:36,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:54:36,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:54:36,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:54:36,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:54:36,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:54:36,578 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:54:36,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:54:36,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:54:36,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:54:36,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:54:36,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:54:36,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:54:36,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:54:36,579 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 -> 50e151318da71693ecfd101451d51852511de48fd25109c1f84fed946653f0cd [2025-01-09 04:54:36,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:54:36,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:54:36,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:54:36,887 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:54:36,888 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:54:36,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-01-09 04:54:38,202 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12c11ef65/5badc77c00884332904e97718751fa7f/FLAG8437cbfde [2025-01-09 04:54:38,550 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:54:38,551 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-01-09 04:54:38,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12c11ef65/5badc77c00884332904e97718751fa7f/FLAG8437cbfde [2025-01-09 04:54:38,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12c11ef65/5badc77c00884332904e97718751fa7f [2025-01-09 04:54:38,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:54:38,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:54:38,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:54:38,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:54:38,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:54:38,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:54:38" (1/1) ... [2025-01-09 04:54:38,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d60c3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:38, skipping insertion in model container [2025-01-09 04:54:38,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:54:38" (1/1) ... [2025-01-09 04:54:38,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:54:38,851 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7667,7680] [2025-01-09 04:54:38,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:54:38,913 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:54:38,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7667,7680] [2025-01-09 04:54:38,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:54:39,010 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:54:39,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:39 WrapperNode [2025-01-09 04:54:39,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:54:39,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:54:39,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:54:39,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:54:39,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:39" (1/1) ... [2025-01-09 04:54:39,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:39" (1/1) ... [2025-01-09 04:54:39,060 INFO L138 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 624 [2025-01-09 04:54:39,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:54:39,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:54:39,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:54:39,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:54:39,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:39" (1/1) ... [2025-01-09 04:54:39,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:39" (1/1) ... [2025-01-09 04:54:39,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:39" (1/1) ... [2025-01-09 04:54:39,103 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:54:39,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:39" (1/1) ... [2025-01-09 04:54:39,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:39" (1/1) ... [2025-01-09 04:54:39,116 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:39" (1/1) ... [2025-01-09 04:54:39,121 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:39" (1/1) ... [2025-01-09 04:54:39,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:39" (1/1) ... [2025-01-09 04:54:39,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:39" (1/1) ... [2025-01-09 04:54:39,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:39" (1/1) ... [2025-01-09 04:54:39,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:54:39,135 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:54:39,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:54:39,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:54:39,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:39" (1/1) ... [2025-01-09 04:54:39,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:54:39,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:54:39,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:54:39,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:54:39,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:54:39,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:54:39,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:54:39,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:54:39,316 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:54:39,317 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:54:39,876 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-01-09 04:54:39,880 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:54:39,896 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:54:39,897 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:54:39,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:54:39 BoogieIcfgContainer [2025-01-09 04:54:39,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:54:39,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:54:39,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:54:39,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:54:39,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:54:38" (1/3) ... [2025-01-09 04:54:39,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12dfb483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:54:39, skipping insertion in model container [2025-01-09 04:54:39,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:54:39" (2/3) ... [2025-01-09 04:54:39,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12dfb483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:54:39, skipping insertion in model container [2025-01-09 04:54:39,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:54:39" (3/3) ... [2025-01-09 04:54:39,909 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-01-09 04:54:39,921 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:54:39,924 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 138 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:54:39,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:54:39,990 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;@355ec95e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:54:39,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:54:39,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:54:40,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:40,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:40,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:40,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:40,006 INFO L85 PathProgramCache]: Analyzing trace with hash -2006546999, now seen corresponding path program 1 times [2025-01-09 04:54:40,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:40,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398862404] [2025-01-09 04:54:40,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:40,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:40,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:54:40,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:54:40,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:40,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:40,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:40,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:40,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398862404] [2025-01-09 04:54:40,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398862404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:40,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:40,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:54:40,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300998233] [2025-01-09 04:54:40,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:40,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:54:40,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:40,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:54:40,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:40,612 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:40,685 INFO L93 Difference]: Finished difference Result 300 states and 490 transitions. [2025-01-09 04:54:40,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:54:40,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-01-09 04:54:40,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:40,696 INFO L225 Difference]: With dead ends: 300 [2025-01-09 04:54:40,698 INFO L226 Difference]: Without dead ends: 209 [2025-01-09 04:54:40,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:40,704 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 159 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:40,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 471 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:54:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-09 04:54:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2025-01-09 04:54:40,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.4466019417475728) internal successors, (298), 206 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:40,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 298 transitions. [2025-01-09 04:54:40,750 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 298 transitions. Word has length 87 [2025-01-09 04:54:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:40,751 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 298 transitions. [2025-01-09 04:54:40,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 298 transitions. [2025-01-09 04:54:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 04:54:40,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:40,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:40,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:54:40,754 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:40,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:40,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1559740613, now seen corresponding path program 1 times [2025-01-09 04:54:40,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:40,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566449237] [2025-01-09 04:54:40,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:40,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:40,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 04:54:40,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 04:54:40,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:40,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:40,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:40,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566449237] [2025-01-09 04:54:40,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566449237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:40,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:40,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:54:40,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076284239] [2025-01-09 04:54:40,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:40,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:54:40,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:40,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:54:40,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:40,941 INFO L87 Difference]: Start difference. First operand 207 states and 298 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:40,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:40,984 INFO L93 Difference]: Finished difference Result 499 states and 762 transitions. [2025-01-09 04:54:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:54:40,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-01-09 04:54:40,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:40,987 INFO L225 Difference]: With dead ends: 499 [2025-01-09 04:54:40,987 INFO L226 Difference]: Without dead ends: 345 [2025-01-09 04:54:40,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:40,988 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 110 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:40,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 402 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:54:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-01-09 04:54:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2025-01-09 04:54:41,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.5029239766081872) internal successors, (514), 342 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:41,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 514 transitions. [2025-01-09 04:54:41,012 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 514 transitions. Word has length 88 [2025-01-09 04:54:41,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:41,012 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 514 transitions. [2025-01-09 04:54:41,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:41,013 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 514 transitions. [2025-01-09 04:54:41,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:54:41,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:41,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:41,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:54:41,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:41,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:41,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1480148747, now seen corresponding path program 1 times [2025-01-09 04:54:41,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:41,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593949397] [2025-01-09 04:54:41,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:41,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:41,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:54:41,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:54:41,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:41,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:41,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:41,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593949397] [2025-01-09 04:54:41,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593949397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:41,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:41,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:54:41,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943800241] [2025-01-09 04:54:41,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:41,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:54:41,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:41,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:54:41,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:41,228 INFO L87 Difference]: Start difference. First operand 343 states and 514 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:41,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:41,260 INFO L93 Difference]: Finished difference Result 891 states and 1384 transitions. [2025-01-09 04:54:41,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:54:41,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-01-09 04:54:41,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:41,266 INFO L225 Difference]: With dead ends: 891 [2025-01-09 04:54:41,266 INFO L226 Difference]: Without dead ends: 601 [2025-01-09 04:54:41,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:41,271 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 105 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:41,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 398 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:54:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-01-09 04:54:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 599. [2025-01-09 04:54:41,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.5351170568561874) internal successors, (918), 598 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:41,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 918 transitions. [2025-01-09 04:54:41,305 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 918 transitions. Word has length 89 [2025-01-09 04:54:41,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:41,307 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 918 transitions. [2025-01-09 04:54:41,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 918 transitions. [2025-01-09 04:54:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 04:54:41,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:41,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:41,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:54:41,309 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:41,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:41,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1142089047, now seen corresponding path program 1 times [2025-01-09 04:54:41,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:41,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785389112] [2025-01-09 04:54:41,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:41,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:41,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 04:54:41,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 04:54:41,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:41,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:41,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:41,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:41,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785389112] [2025-01-09 04:54:41,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785389112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:41,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:41,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:54:41,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823165606] [2025-01-09 04:54:41,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:41,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:54:41,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:41,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:54:41,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:41,461 INFO L87 Difference]: Start difference. First operand 599 states and 918 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:41,497 INFO L93 Difference]: Finished difference Result 1627 states and 2544 transitions. [2025-01-09 04:54:41,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:54:41,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 04:54:41,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:41,505 INFO L225 Difference]: With dead ends: 1627 [2025-01-09 04:54:41,505 INFO L226 Difference]: Without dead ends: 1081 [2025-01-09 04:54:41,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:41,506 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 100 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:41,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 394 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:54:41,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2025-01-09 04:54:41,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1079. [2025-01-09 04:54:41,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1078 states have (on average 1.549165120593692) internal successors, (1670), 1078 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1670 transitions. [2025-01-09 04:54:41,542 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1670 transitions. Word has length 90 [2025-01-09 04:54:41,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:41,543 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1670 transitions. [2025-01-09 04:54:41,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:41,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1670 transitions. [2025-01-09 04:54:41,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 04:54:41,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:41,544 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:41,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:54:41,545 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:41,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:41,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1309607801, now seen corresponding path program 1 times [2025-01-09 04:54:41,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:41,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399999329] [2025-01-09 04:54:41,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:41,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:41,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 04:54:41,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 04:54:41,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:41,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:41,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:41,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:41,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399999329] [2025-01-09 04:54:41,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399999329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:41,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:41,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:54:41,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18419643] [2025-01-09 04:54:41,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:41,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:54:41,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:41,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:54:41,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:41,711 INFO L87 Difference]: Start difference. First operand 1079 states and 1670 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:41,744 INFO L93 Difference]: Finished difference Result 3003 states and 4696 transitions. [2025-01-09 04:54:41,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:54:41,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-01-09 04:54:41,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:41,753 INFO L225 Difference]: With dead ends: 3003 [2025-01-09 04:54:41,753 INFO L226 Difference]: Without dead ends: 1977 [2025-01-09 04:54:41,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:41,757 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 95 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:41,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 390 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:54:41,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2025-01-09 04:54:41,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1975. [2025-01-09 04:54:41,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1975 states, 1974 states have (on average 1.5511651469098278) internal successors, (3062), 1974 states have internal predecessors, (3062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 3062 transitions. [2025-01-09 04:54:41,814 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 3062 transitions. Word has length 91 [2025-01-09 04:54:41,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:41,814 INFO L471 AbstractCegarLoop]: Abstraction has 1975 states and 3062 transitions. [2025-01-09 04:54:41,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:41,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 3062 transitions. [2025-01-09 04:54:41,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 04:54:41,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:41,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:41,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:54:41,817 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:41,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:41,817 INFO L85 PathProgramCache]: Analyzing trace with hash 582949359, now seen corresponding path program 1 times [2025-01-09 04:54:41,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:41,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288879616] [2025-01-09 04:54:41,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:41,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:41,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 04:54:41,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 04:54:41,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:41,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:41,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:41,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288879616] [2025-01-09 04:54:41,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288879616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:41,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:41,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:54:41,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753978409] [2025-01-09 04:54:41,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:41,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:54:41,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:41,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:54:41,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:41,914 INFO L87 Difference]: Start difference. First operand 1975 states and 3062 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:41,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:41,957 INFO L93 Difference]: Finished difference Result 5563 states and 8664 transitions. [2025-01-09 04:54:41,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:54:41,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-09 04:54:41,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:41,973 INFO L225 Difference]: With dead ends: 5563 [2025-01-09 04:54:41,973 INFO L226 Difference]: Without dead ends: 3641 [2025-01-09 04:54:41,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:41,979 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 90 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:41,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 386 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:54:41,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3641 states. [2025-01-09 04:54:42,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3641 to 3639. [2025-01-09 04:54:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3639 states, 3638 states have (on average 1.5453545904343045) internal successors, (5622), 3638 states have internal predecessors, (5622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:42,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 5622 transitions. [2025-01-09 04:54:42,094 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 5622 transitions. Word has length 92 [2025-01-09 04:54:42,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:42,094 INFO L471 AbstractCegarLoop]: Abstraction has 3639 states and 5622 transitions. [2025-01-09 04:54:42,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 5622 transitions. [2025-01-09 04:54:42,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:54:42,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:42,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:42,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:54:42,095 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:42,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:42,096 INFO L85 PathProgramCache]: Analyzing trace with hash -496500112, now seen corresponding path program 1 times [2025-01-09 04:54:42,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:42,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954108765] [2025-01-09 04:54:42,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:42,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:42,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:54:42,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:54:42,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:42,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:42,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:42,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:42,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954108765] [2025-01-09 04:54:42,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954108765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:42,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:42,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:54:42,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178833589] [2025-01-09 04:54:42,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:42,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:42,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:42,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:42,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:42,368 INFO L87 Difference]: Start difference. First operand 3639 states and 5622 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:43,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:43,181 INFO L93 Difference]: Finished difference Result 53843 states and 83588 transitions. [2025-01-09 04:54:43,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:54:43,181 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-01-09 04:54:43,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:43,364 INFO L225 Difference]: With dead ends: 53843 [2025-01-09 04:54:43,364 INFO L226 Difference]: Without dead ends: 50257 [2025-01-09 04:54:43,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:54:43,394 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 2518 mSDsluCounter, 4862 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2518 SdHoareTripleChecker+Valid, 5041 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:43,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2518 Valid, 5041 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:54:43,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50257 states. [2025-01-09 04:54:44,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50257 to 7223. [2025-01-09 04:54:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7223 states, 7222 states have (on average 1.5317086679590142) internal successors, (11062), 7222 states have internal predecessors, (11062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:44,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7223 states to 7223 states and 11062 transitions. [2025-01-09 04:54:44,087 INFO L78 Accepts]: Start accepts. Automaton has 7223 states and 11062 transitions. Word has length 93 [2025-01-09 04:54:44,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:44,087 INFO L471 AbstractCegarLoop]: Abstraction has 7223 states and 11062 transitions. [2025-01-09 04:54:44,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 7223 states and 11062 transitions. [2025-01-09 04:54:44,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:54:44,088 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:44,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:44,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:54:44,089 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:44,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:44,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1317055956, now seen corresponding path program 1 times [2025-01-09 04:54:44,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:44,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160831681] [2025-01-09 04:54:44,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:44,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:54:44,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:54:44,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:44,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:44,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:44,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:44,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160831681] [2025-01-09 04:54:44,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160831681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:44,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:44,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:54:44,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225304539] [2025-01-09 04:54:44,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:44,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:54:44,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:44,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:54:44,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:44,244 INFO L87 Difference]: Start difference. First operand 7223 states and 11062 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:44,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:44,318 INFO L93 Difference]: Finished difference Result 20859 states and 31864 transitions. [2025-01-09 04:54:44,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:54:44,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-01-09 04:54:44,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:44,345 INFO L225 Difference]: With dead ends: 20859 [2025-01-09 04:54:44,346 INFO L226 Difference]: Without dead ends: 13689 [2025-01-09 04:54:44,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:44,357 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 80 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:44,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 304 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:54:44,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13689 states. [2025-01-09 04:54:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13689 to 13559. [2025-01-09 04:54:44,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13559 states, 13558 states have (on average 1.5050892462015046) internal successors, (20406), 13558 states have internal predecessors, (20406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13559 states to 13559 states and 20406 transitions. [2025-01-09 04:54:44,676 INFO L78 Accepts]: Start accepts. Automaton has 13559 states and 20406 transitions. Word has length 95 [2025-01-09 04:54:44,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:44,678 INFO L471 AbstractCegarLoop]: Abstraction has 13559 states and 20406 transitions. [2025-01-09 04:54:44,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 13559 states and 20406 transitions. [2025-01-09 04:54:44,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:54:44,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:44,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:44,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:54:44,680 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:44,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:44,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1296053301, now seen corresponding path program 1 times [2025-01-09 04:54:44,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:44,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853882602] [2025-01-09 04:54:44,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:44,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:44,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:54:44,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:54:44,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:44,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:45,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:45,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853882602] [2025-01-09 04:54:45,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853882602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:45,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:45,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:54:45,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824640375] [2025-01-09 04:54:45,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:45,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:45,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:45,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:45,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:45,270 INFO L87 Difference]: Start difference. First operand 13559 states and 20406 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:45,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:45,800 INFO L93 Difference]: Finished difference Result 27067 states and 40760 transitions. [2025-01-09 04:54:45,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:54:45,801 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-01-09 04:54:45,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:45,829 INFO L225 Difference]: With dead ends: 27067 [2025-01-09 04:54:45,829 INFO L226 Difference]: Without dead ends: 13561 [2025-01-09 04:54:45,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:54:45,846 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 224 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:45,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 998 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:54:45,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13561 states. [2025-01-09 04:54:46,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13561 to 13559. [2025-01-09 04:54:46,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13559 states, 13558 states have (on average 1.495648325711757) internal successors, (20278), 13558 states have internal predecessors, (20278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13559 states to 13559 states and 20278 transitions. [2025-01-09 04:54:46,053 INFO L78 Accepts]: Start accepts. Automaton has 13559 states and 20278 transitions. Word has length 95 [2025-01-09 04:54:46,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:46,054 INFO L471 AbstractCegarLoop]: Abstraction has 13559 states and 20278 transitions. [2025-01-09 04:54:46,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:46,055 INFO L276 IsEmpty]: Start isEmpty. Operand 13559 states and 20278 transitions. [2025-01-09 04:54:46,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:54:46,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:46,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:46,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:54:46,056 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:46,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:46,056 INFO L85 PathProgramCache]: Analyzing trace with hash 232587604, now seen corresponding path program 1 times [2025-01-09 04:54:46,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:46,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858706789] [2025-01-09 04:54:46,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:46,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:46,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:54:46,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:54:46,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:46,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:46,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:46,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858706789] [2025-01-09 04:54:46,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858706789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:46,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:46,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:54:46,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114450148] [2025-01-09 04:54:46,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:46,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:54:46,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:46,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:54:46,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:46,177 INFO L87 Difference]: Start difference. First operand 13559 states and 20278 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:46,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:46,253 INFO L93 Difference]: Finished difference Result 26622 states and 40124 transitions. [2025-01-09 04:54:46,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:54:46,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-01-09 04:54:46,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:46,296 INFO L225 Difference]: With dead ends: 26622 [2025-01-09 04:54:46,297 INFO L226 Difference]: Without dead ends: 19451 [2025-01-09 04:54:46,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:54:46,313 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 117 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:46,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 414 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:54:46,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19451 states. [2025-01-09 04:54:46,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19451 to 19449. [2025-01-09 04:54:46,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19449 states, 19448 states have (on average 1.4936240230357878) internal successors, (29048), 19448 states have internal predecessors, (29048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19449 states to 19449 states and 29048 transitions. [2025-01-09 04:54:46,743 INFO L78 Accepts]: Start accepts. Automaton has 19449 states and 29048 transitions. Word has length 96 [2025-01-09 04:54:46,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:46,743 INFO L471 AbstractCegarLoop]: Abstraction has 19449 states and 29048 transitions. [2025-01-09 04:54:46,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:46,743 INFO L276 IsEmpty]: Start isEmpty. Operand 19449 states and 29048 transitions. [2025-01-09 04:54:46,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:54:46,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:46,744 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:46,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:54:46,744 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:46,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:46,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1524855936, now seen corresponding path program 1 times [2025-01-09 04:54:46,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:46,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392971448] [2025-01-09 04:54:46,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:46,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:46,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:54:46,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:54:46,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:46,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:46,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:46,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392971448] [2025-01-09 04:54:46,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392971448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:46,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:46,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:54:46,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630184991] [2025-01-09 04:54:46,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:46,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:54:46,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:46,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:54:46,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:46,884 INFO L87 Difference]: Start difference. First operand 19449 states and 29048 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:47,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:47,064 INFO L93 Difference]: Finished difference Result 38843 states and 58041 transitions. [2025-01-09 04:54:47,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:54:47,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-01-09 04:54:47,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:47,104 INFO L225 Difference]: With dead ends: 38843 [2025-01-09 04:54:47,104 INFO L226 Difference]: Without dead ends: 19449 [2025-01-09 04:54:47,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:54:47,125 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 482 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:47,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 118 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:54:47,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19449 states. [2025-01-09 04:54:47,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19449 to 19449. [2025-01-09 04:54:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19449 states, 19448 states have (on average 1.4804607157548335) internal successors, (28792), 19448 states have internal predecessors, (28792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19449 states to 19449 states and 28792 transitions. [2025-01-09 04:54:47,477 INFO L78 Accepts]: Start accepts. Automaton has 19449 states and 28792 transitions. Word has length 96 [2025-01-09 04:54:47,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:47,477 INFO L471 AbstractCegarLoop]: Abstraction has 19449 states and 28792 transitions. [2025-01-09 04:54:47,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:47,477 INFO L276 IsEmpty]: Start isEmpty. Operand 19449 states and 28792 transitions. [2025-01-09 04:54:47,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:54:47,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:47,478 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:47,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:54:47,479 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:47,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:47,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1886974661, now seen corresponding path program 1 times [2025-01-09 04:54:47,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:47,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822184571] [2025-01-09 04:54:47,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:47,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:47,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:54:47,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:54:47,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:47,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:47,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:47,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822184571] [2025-01-09 04:54:47,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822184571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:47,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:47,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:54:47,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178043503] [2025-01-09 04:54:47,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:47,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:54:47,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:47,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:54:47,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:47,640 INFO L87 Difference]: Start difference. First operand 19449 states and 28792 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:47,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:47,831 INFO L93 Difference]: Finished difference Result 38843 states and 57529 transitions. [2025-01-09 04:54:47,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:54:47,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-01-09 04:54:47,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:47,875 INFO L225 Difference]: With dead ends: 38843 [2025-01-09 04:54:47,876 INFO L226 Difference]: Without dead ends: 19449 [2025-01-09 04:54:47,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:54:47,898 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 440 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:47,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 142 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:54:47,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19449 states. [2025-01-09 04:54:48,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19449 to 19449. [2025-01-09 04:54:48,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19449 states, 19448 states have (on average 1.4705882352941178) internal successors, (28600), 19448 states have internal predecessors, (28600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:48,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19449 states to 19449 states and 28600 transitions. [2025-01-09 04:54:48,211 INFO L78 Accepts]: Start accepts. Automaton has 19449 states and 28600 transitions. Word has length 96 [2025-01-09 04:54:48,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:48,211 INFO L471 AbstractCegarLoop]: Abstraction has 19449 states and 28600 transitions. [2025-01-09 04:54:48,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:48,211 INFO L276 IsEmpty]: Start isEmpty. Operand 19449 states and 28600 transitions. [2025-01-09 04:54:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:54:48,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:48,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:48,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:54:48,213 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:48,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:48,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1645128928, now seen corresponding path program 1 times [2025-01-09 04:54:48,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:48,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456765548] [2025-01-09 04:54:48,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:48,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:48,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:54:48,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:54:48,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:48,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:48,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:48,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:48,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456765548] [2025-01-09 04:54:48,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456765548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:48,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:48,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:54:48,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609651499] [2025-01-09 04:54:48,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:48,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:54:48,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:48,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:54:48,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:48,374 INFO L87 Difference]: Start difference. First operand 19449 states and 28600 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:48,567 INFO L93 Difference]: Finished difference Result 38843 states and 57145 transitions. [2025-01-09 04:54:48,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:54:48,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-01-09 04:54:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:48,601 INFO L225 Difference]: With dead ends: 38843 [2025-01-09 04:54:48,601 INFO L226 Difference]: Without dead ends: 19449 [2025-01-09 04:54:48,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:54:48,618 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 398 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:48,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 166 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:54:48,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19449 states. [2025-01-09 04:54:48,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19449 to 19449. [2025-01-09 04:54:48,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19449 states, 19448 states have (on average 1.460715754833402) internal successors, (28408), 19448 states have internal predecessors, (28408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19449 states to 19449 states and 28408 transitions. [2025-01-09 04:54:48,926 INFO L78 Accepts]: Start accepts. Automaton has 19449 states and 28408 transitions. Word has length 96 [2025-01-09 04:54:48,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:48,926 INFO L471 AbstractCegarLoop]: Abstraction has 19449 states and 28408 transitions. [2025-01-09 04:54:48,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:48,926 INFO L276 IsEmpty]: Start isEmpty. Operand 19449 states and 28408 transitions. [2025-01-09 04:54:48,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:54:48,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:48,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:48,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:54:48,927 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:48,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:48,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1115838427, now seen corresponding path program 1 times [2025-01-09 04:54:48,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:48,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099563408] [2025-01-09 04:54:48,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:48,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:48,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:54:48,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:54:48,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:48,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:49,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:49,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:49,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099563408] [2025-01-09 04:54:49,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099563408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:49,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:49,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:54:49,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132185251] [2025-01-09 04:54:49,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:49,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:54:49,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:49,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:54:49,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:49,055 INFO L87 Difference]: Start difference. First operand 19449 states and 28408 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:49,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:49,210 INFO L93 Difference]: Finished difference Result 38843 states and 56761 transitions. [2025-01-09 04:54:49,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:54:49,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-01-09 04:54:49,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:49,237 INFO L225 Difference]: With dead ends: 38843 [2025-01-09 04:54:49,237 INFO L226 Difference]: Without dead ends: 19449 [2025-01-09 04:54:49,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:54:49,253 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 460 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:49,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 126 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:54:49,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19449 states. [2025-01-09 04:54:49,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19449 to 19449. [2025-01-09 04:54:49,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19449 states, 19448 states have (on average 1.4508432743726862) internal successors, (28216), 19448 states have internal predecessors, (28216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19449 states to 19449 states and 28216 transitions. [2025-01-09 04:54:49,474 INFO L78 Accepts]: Start accepts. Automaton has 19449 states and 28216 transitions. Word has length 96 [2025-01-09 04:54:49,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:49,474 INFO L471 AbstractCegarLoop]: Abstraction has 19449 states and 28216 transitions. [2025-01-09 04:54:49,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:49,475 INFO L276 IsEmpty]: Start isEmpty. Operand 19449 states and 28216 transitions. [2025-01-09 04:54:49,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:54:49,475 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:49,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:49,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:54:49,476 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:49,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:49,476 INFO L85 PathProgramCache]: Analyzing trace with hash -625578688, now seen corresponding path program 1 times [2025-01-09 04:54:49,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:49,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701997846] [2025-01-09 04:54:49,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:49,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:49,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:54:49,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:54:49,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:49,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:49,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:49,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701997846] [2025-01-09 04:54:49,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701997846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:49,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:49,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:54:49,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131098367] [2025-01-09 04:54:49,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:49,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:54:49,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:49,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:54:49,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:49,594 INFO L87 Difference]: Start difference. First operand 19449 states and 28216 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:49,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:49,750 INFO L93 Difference]: Finished difference Result 38843 states and 56377 transitions. [2025-01-09 04:54:49,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:54:49,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-01-09 04:54:49,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:49,773 INFO L225 Difference]: With dead ends: 38843 [2025-01-09 04:54:49,774 INFO L226 Difference]: Without dead ends: 19449 [2025-01-09 04:54:49,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:54:49,790 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 405 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:49,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 158 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:54:49,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19449 states. [2025-01-09 04:54:50,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19449 to 19449. [2025-01-09 04:54:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19449 states, 19448 states have (on average 1.4409707939119705) internal successors, (28024), 19448 states have internal predecessors, (28024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19449 states to 19449 states and 28024 transitions. [2025-01-09 04:54:50,102 INFO L78 Accepts]: Start accepts. Automaton has 19449 states and 28024 transitions. Word has length 96 [2025-01-09 04:54:50,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:50,103 INFO L471 AbstractCegarLoop]: Abstraction has 19449 states and 28024 transitions. [2025-01-09 04:54:50,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:50,103 INFO L276 IsEmpty]: Start isEmpty. Operand 19449 states and 28024 transitions. [2025-01-09 04:54:50,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:54:50,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:50,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:50,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:54:50,104 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:50,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:50,104 INFO L85 PathProgramCache]: Analyzing trace with hash 239953701, now seen corresponding path program 1 times [2025-01-09 04:54:50,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:50,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124548263] [2025-01-09 04:54:50,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:50,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:50,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:54:50,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:54:50,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:50,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:50,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:50,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:50,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124548263] [2025-01-09 04:54:50,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124548263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:50,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:50,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:54:50,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322328179] [2025-01-09 04:54:50,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:50,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:54:50,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:50,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:54:50,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:50,389 INFO L87 Difference]: Start difference. First operand 19449 states and 28024 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:50,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:50,450 INFO L93 Difference]: Finished difference Result 19963 states and 28793 transitions. [2025-01-09 04:54:50,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:54:50,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-01-09 04:54:50,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:50,476 INFO L225 Difference]: With dead ends: 19963 [2025-01-09 04:54:50,476 INFO L226 Difference]: Without dead ends: 19961 [2025-01-09 04:54:50,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:50,484 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:50,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 689 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:54:50,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19961 states. [2025-01-09 04:54:50,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19961 to 19961. [2025-01-09 04:54:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19961 states, 19960 states have (on average 1.4264529058116233) internal successors, (28472), 19960 states have internal predecessors, (28472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19961 states to 19961 states and 28472 transitions. [2025-01-09 04:54:50,717 INFO L78 Accepts]: Start accepts. Automaton has 19961 states and 28472 transitions. Word has length 96 [2025-01-09 04:54:50,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:50,717 INFO L471 AbstractCegarLoop]: Abstraction has 19961 states and 28472 transitions. [2025-01-09 04:54:50,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:50,718 INFO L276 IsEmpty]: Start isEmpty. Operand 19961 states and 28472 transitions. [2025-01-09 04:54:50,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:54:50,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:50,728 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:50,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:54:50,729 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:50,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:50,729 INFO L85 PathProgramCache]: Analyzing trace with hash -714656545, now seen corresponding path program 1 times [2025-01-09 04:54:50,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:50,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008578244] [2025-01-09 04:54:50,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:50,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:50,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:54:50,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:54:50,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:50,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:51,027 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:54:51,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:51,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008578244] [2025-01-09 04:54:51,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008578244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:51,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:51,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:54:51,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362067158] [2025-01-09 04:54:51,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:51,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:51,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:51,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:51,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:51,030 INFO L87 Difference]: Start difference. First operand 19961 states and 28472 transitions. Second operand has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:51,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:51,510 INFO L93 Difference]: Finished difference Result 162953 states and 232512 transitions. [2025-01-09 04:54:51,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:54:51,511 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-01-09 04:54:51,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:51,731 INFO L225 Difference]: With dead ends: 162953 [2025-01-09 04:54:51,731 INFO L226 Difference]: Without dead ends: 143047 [2025-01-09 04:54:51,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:54:51,796 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 2141 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2141 SdHoareTripleChecker+Valid, 1896 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:51,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2141 Valid, 1896 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:54:51,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143047 states. [2025-01-09 04:54:52,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143047 to 39865. [2025-01-09 04:54:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39865 states, 39864 states have (on average 1.422235601043548) internal successors, (56696), 39864 states have internal predecessors, (56696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:53,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39865 states to 39865 states and 56696 transitions. [2025-01-09 04:54:53,152 INFO L78 Accepts]: Start accepts. Automaton has 39865 states and 56696 transitions. Word has length 131 [2025-01-09 04:54:53,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:53,152 INFO L471 AbstractCegarLoop]: Abstraction has 39865 states and 56696 transitions. [2025-01-09 04:54:53,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:53,152 INFO L276 IsEmpty]: Start isEmpty. Operand 39865 states and 56696 transitions. [2025-01-09 04:54:53,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:54:53,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:53,161 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:53,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:54:53,162 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:53,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:53,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1365457691, now seen corresponding path program 1 times [2025-01-09 04:54:53,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:53,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859642074] [2025-01-09 04:54:53,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:53,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:53,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:54:53,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:54:53,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:53,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:54:53,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:53,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859642074] [2025-01-09 04:54:53,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859642074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:53,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:53,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:54:53,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174696262] [2025-01-09 04:54:53,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:53,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:53,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:53,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:53,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:53,415 INFO L87 Difference]: Start difference. First operand 39865 states and 56696 transitions. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:54,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:54,102 INFO L93 Difference]: Finished difference Result 182857 states and 260736 transitions. [2025-01-09 04:54:54,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:54:54,103 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-01-09 04:54:54,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:54,270 INFO L225 Difference]: With dead ends: 182857 [2025-01-09 04:54:54,270 INFO L226 Difference]: Without dead ends: 162951 [2025-01-09 04:54:54,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:54:54,308 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 2260 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2260 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:54,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2260 Valid, 1708 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:54:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162951 states. [2025-01-09 04:54:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162951 to 69753. [2025-01-09 04:54:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69753 states, 69752 states have (on average 1.417479068700539) internal successors, (98872), 69752 states have internal predecessors, (98872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69753 states to 69753 states and 98872 transitions. [2025-01-09 04:54:55,743 INFO L78 Accepts]: Start accepts. Automaton has 69753 states and 98872 transitions. Word has length 131 [2025-01-09 04:54:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:55,744 INFO L471 AbstractCegarLoop]: Abstraction has 69753 states and 98872 transitions. [2025-01-09 04:54:55,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 69753 states and 98872 transitions. [2025-01-09 04:54:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:54:55,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:55,755 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:55,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:54:55,755 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:55,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:55,756 INFO L85 PathProgramCache]: Analyzing trace with hash -770469891, now seen corresponding path program 1 times [2025-01-09 04:54:55,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:55,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36836362] [2025-01-09 04:54:55,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:55,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:55,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:54:55,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:54:55,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:55,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 04:54:56,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:56,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36836362] [2025-01-09 04:54:56,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36836362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:56,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:56,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:54:56,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840975822] [2025-01-09 04:54:56,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:56,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:56,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:56,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:56,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:56,238 INFO L87 Difference]: Start difference. First operand 69753 states and 98872 transitions. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:57,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:57,059 INFO L93 Difference]: Finished difference Result 202761 states and 288960 transitions. [2025-01-09 04:54:57,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:54:57,060 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-01-09 04:54:57,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:57,382 INFO L225 Difference]: With dead ends: 202761 [2025-01-09 04:54:57,382 INFO L226 Difference]: Without dead ends: 182855 [2025-01-09 04:54:57,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:54:57,439 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 2124 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2124 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:57,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2124 Valid, 1886 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:54:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182855 states. [2025-01-09 04:54:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182855 to 89657. [2025-01-09 04:54:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89657 states, 89656 states have (on average 1.4175961452663515) internal successors, (127096), 89656 states have internal predecessors, (127096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89657 states to 89657 states and 127096 transitions. [2025-01-09 04:54:59,153 INFO L78 Accepts]: Start accepts. Automaton has 89657 states and 127096 transitions. Word has length 131 [2025-01-09 04:54:59,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:59,154 INFO L471 AbstractCegarLoop]: Abstraction has 89657 states and 127096 transitions. [2025-01-09 04:54:59,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 89657 states and 127096 transitions. [2025-01-09 04:54:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:54:59,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:59,165 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:59,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:54:59,165 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:59,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:59,166 INFO L85 PathProgramCache]: Analyzing trace with hash 383476215, now seen corresponding path program 1 times [2025-01-09 04:54:59,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:59,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899375414] [2025-01-09 04:54:59,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:59,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:59,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:54:59,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:54:59,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:59,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 04:54:59,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:59,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899375414] [2025-01-09 04:54:59,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899375414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:59,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:59,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:54:59,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228016880] [2025-01-09 04:54:59,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:59,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:59,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:59,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:59,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:59,663 INFO L87 Difference]: Start difference. First operand 89657 states and 127096 transitions. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:00,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:00,804 INFO L93 Difference]: Finished difference Result 222665 states and 317184 transitions. [2025-01-09 04:55:00,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:55:00,805 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-01-09 04:55:00,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:01,203 INFO L225 Difference]: With dead ends: 222665 [2025-01-09 04:55:01,204 INFO L226 Difference]: Without dead ends: 202759 [2025-01-09 04:55:01,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:55:01,266 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 1859 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1859 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:01,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1859 Valid, 1998 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:55:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202759 states. [2025-01-09 04:55:02,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202759 to 109561. [2025-01-09 04:55:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109561 states, 109560 states have (on average 1.4176706827309238) internal successors, (155320), 109560 states have internal predecessors, (155320), 0 states have call successors, (0), 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:55:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109561 states to 109561 states and 155320 transitions. [2025-01-09 04:55:03,187 INFO L78 Accepts]: Start accepts. Automaton has 109561 states and 155320 transitions. Word has length 131 [2025-01-09 04:55:03,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:03,187 INFO L471 AbstractCegarLoop]: Abstraction has 109561 states and 155320 transitions. [2025-01-09 04:55:03,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:03,187 INFO L276 IsEmpty]: Start isEmpty. Operand 109561 states and 155320 transitions. [2025-01-09 04:55:03,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:55:03,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:03,197 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:55:03,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:55:03,197 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:03,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:03,197 INFO L85 PathProgramCache]: Analyzing trace with hash -474424463, now seen corresponding path program 1 times [2025-01-09 04:55:03,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:03,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128532203] [2025-01-09 04:55:03,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:03,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:03,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:55:03,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:55:03,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:03,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:03,462 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:55:03,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:03,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128532203] [2025-01-09 04:55:03,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128532203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:03,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:03,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:55:03,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635011719] [2025-01-09 04:55:03,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:03,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:55:03,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:03,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:55:03,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:55:03,464 INFO L87 Difference]: Start difference. First operand 109561 states and 155320 transitions. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:04,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:04,695 INFO L93 Difference]: Finished difference Result 242569 states and 345408 transitions. [2025-01-09 04:55:04,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:55:04,696 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-01-09 04:55:04,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:04,999 INFO L225 Difference]: With dead ends: 242569 [2025-01-09 04:55:04,999 INFO L226 Difference]: Without dead ends: 222663 [2025-01-09 04:55:05,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:55:05,063 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 1792 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1792 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:05,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1792 Valid, 2036 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:55:05,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222663 states. [2025-01-09 04:55:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222663 to 129465. [2025-01-09 04:55:06,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129465 states, 129464 states have (on average 1.4177223011802509) internal successors, (183544), 129464 states have internal predecessors, (183544), 0 states have call successors, (0), 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:55:07,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129465 states to 129465 states and 183544 transitions. [2025-01-09 04:55:07,166 INFO L78 Accepts]: Start accepts. Automaton has 129465 states and 183544 transitions. Word has length 131 [2025-01-09 04:55:07,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:07,167 INFO L471 AbstractCegarLoop]: Abstraction has 129465 states and 183544 transitions. [2025-01-09 04:55:07,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:07,167 INFO L276 IsEmpty]: Start isEmpty. Operand 129465 states and 183544 transitions. [2025-01-09 04:55:07,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:55:07,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:07,176 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:55:07,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:55:07,176 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:07,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:07,177 INFO L85 PathProgramCache]: Analyzing trace with hash 954072171, now seen corresponding path program 1 times [2025-01-09 04:55:07,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:07,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563559611] [2025-01-09 04:55:07,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:07,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:07,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:55:07,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:55:07,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:07,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 04:55:07,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:07,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563559611] [2025-01-09 04:55:07,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563559611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:07,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:07,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:55:07,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812480947] [2025-01-09 04:55:07,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:07,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:55:07,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:07,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:55:07,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:55:07,724 INFO L87 Difference]: Start difference. First operand 129465 states and 183544 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:08,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:08,720 INFO L93 Difference]: Finished difference Result 262473 states and 373632 transitions. [2025-01-09 04:55:08,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:55:08,720 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-01-09 04:55:08,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:09,074 INFO L225 Difference]: With dead ends: 262473 [2025-01-09 04:55:09,074 INFO L226 Difference]: Without dead ends: 242567 [2025-01-09 04:55:09,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:55:09,160 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 1874 mSDsluCounter, 1844 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1874 SdHoareTripleChecker+Valid, 2142 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:09,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1874 Valid, 2142 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:55:09,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242567 states. [2025-01-09 04:55:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242567 to 149369. [2025-01-09 04:55:11,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149369 states, 149368 states have (on average 1.4177601628193455) internal successors, (211768), 149368 states have internal predecessors, (211768), 0 states have call successors, (0), 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:55:11,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149369 states to 149369 states and 211768 transitions. [2025-01-09 04:55:11,909 INFO L78 Accepts]: Start accepts. Automaton has 149369 states and 211768 transitions. Word has length 131 [2025-01-09 04:55:11,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:11,910 INFO L471 AbstractCegarLoop]: Abstraction has 149369 states and 211768 transitions. [2025-01-09 04:55:11,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:11,910 INFO L276 IsEmpty]: Start isEmpty. Operand 149369 states and 211768 transitions. [2025-01-09 04:55:11,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 04:55:11,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:11,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:11,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:55:11,918 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:11,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:11,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2098875790, now seen corresponding path program 1 times [2025-01-09 04:55:11,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:11,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572252972] [2025-01-09 04:55:11,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:11,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:11,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 04:55:11,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 04:55:11,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:11,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:55:12,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:12,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572252972] [2025-01-09 04:55:12,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572252972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:12,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:12,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:55:12,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959775932] [2025-01-09 04:55:12,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:12,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:55:12,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:12,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:55:12,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:55:12,114 INFO L87 Difference]: Start difference. First operand 149369 states and 211768 transitions. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:12,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:12,929 INFO L93 Difference]: Finished difference Result 269705 states and 384192 transitions. [2025-01-09 04:55:12,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:55:12,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2025-01-09 04:55:12,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:13,710 INFO L225 Difference]: With dead ends: 269705 [2025-01-09 04:55:13,710 INFO L226 Difference]: Without dead ends: 256135 [2025-01-09 04:55:13,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:55:13,748 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 2137 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2137 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:13,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2137 Valid, 2272 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:55:13,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256135 states. [2025-01-09 04:55:15,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256135 to 162937. [2025-01-09 04:55:16,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162937 states, 162936 states have (on average 1.419109343545932) internal successors, (231224), 162936 states have internal predecessors, (231224), 0 states have call successors, (0), 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:55:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162937 states to 162937 states and 231224 transitions. [2025-01-09 04:55:16,487 INFO L78 Accepts]: Start accepts. Automaton has 162937 states and 231224 transitions. Word has length 132 [2025-01-09 04:55:16,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:16,487 INFO L471 AbstractCegarLoop]: Abstraction has 162937 states and 231224 transitions. [2025-01-09 04:55:16,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand 162937 states and 231224 transitions. [2025-01-09 04:55:16,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 04:55:16,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:16,499 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:55:16,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:55:16,499 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:16,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:16,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1568045066, now seen corresponding path program 1 times [2025-01-09 04:55:16,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:16,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366598539] [2025-01-09 04:55:16,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:16,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:16,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 04:55:16,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 04:55:16,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:16,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:17,076 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:17,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:17,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366598539] [2025-01-09 04:55:17,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366598539] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:55:17,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643534139] [2025-01-09 04:55:17,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:17,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:55:17,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:55:17,080 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:55:17,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:55:17,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 04:55:17,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 04:55:17,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:17,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:17,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 04:55:17,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:55:17,968 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:17,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:55:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:18,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643534139] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:55:18,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:55:18,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 26 [2025-01-09 04:55:18,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546020853] [2025-01-09 04:55:18,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:55:18,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 04:55:18,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:18,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 04:55:18,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:55:18,666 INFO L87 Difference]: Start difference. First operand 162937 states and 231224 transitions. Second operand has 26 states, 26 states have (on average 14.961538461538462) internal successors, (389), 26 states have internal predecessors, (389), 0 states have call successors, (0), 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:55:32,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:32,039 INFO L93 Difference]: Finished difference Result 1557824 states and 2203088 transitions. [2025-01-09 04:55:32,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2025-01-09 04:55:32,039 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 14.961538461538462) internal successors, (389), 26 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-01-09 04:55:32,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:34,266 INFO L225 Difference]: With dead ends: 1557824 [2025-01-09 04:55:34,266 INFO L226 Difference]: Without dead ends: 1385361 [2025-01-09 04:55:35,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23267 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=6991, Invalid=45679, Unknown=0, NotChecked=0, Total=52670 [2025-01-09 04:55:35,276 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 9225 mSDsluCounter, 2645 mSDsCounter, 0 mSdLazyCounter, 4181 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9225 SdHoareTripleChecker+Valid, 2881 SdHoareTripleChecker+Invalid, 4447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 4181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:35,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9225 Valid, 2881 Invalid, 4447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 4181 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 04:55:35,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385361 states.