./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.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_opt-floodmax.4.2.ufo.BOUNDED-8.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 bfae9982cbfcfc5b22127da3f7d6677e3eac54b1fbca7af42ac502541c03eb9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:57:34,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:57:34,420 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:57:34,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:57:34,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:57:34,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:57:34,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:57:34,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:57:34,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:57:34,455 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:57:34,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:57:34,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:57:34,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:57:34,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:57:34,456 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:57:34,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:57:34,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:57:34,456 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:57:34,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:57:34,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:57:34,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:57:34,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:57:34,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:57:34,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:57:34,460 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:57:34,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:57:34,460 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:57:34,460 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:57:34,461 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:57:34,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:57:34,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:57:34,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:57:34,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:57:34,462 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:57:34,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:57:34,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:57:34,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:57:34,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:57:34,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:57:34,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:57:34,463 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:57:34,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:57:34,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:57:34,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:57:34,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:57:34,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:57:34,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:57:34,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:57:34,463 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 -> bfae9982cbfcfc5b22127da3f7d6677e3eac54b1fbca7af42ac502541c03eb9a [2025-01-09 04:57:34,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:57:34,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:57:34,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:57:34,744 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:57:34,745 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:57:34,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-01-09 04:57:36,101 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a834a7116/d14c1b5fab78453d8877a7958b450428/FLAGf4780895e [2025-01-09 04:57:36,494 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:57:36,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-01-09 04:57:36,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a834a7116/d14c1b5fab78453d8877a7958b450428/FLAGf4780895e [2025-01-09 04:57:36,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a834a7116/d14c1b5fab78453d8877a7958b450428 [2025-01-09 04:57:36,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:57:36,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:57:36,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:57:36,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:57:36,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:57:36,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:57:36" (1/1) ... [2025-01-09 04:57:36,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7949e76b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:36, skipping insertion in model container [2025-01-09 04:57:36,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:57:36" (1/1) ... [2025-01-09 04:57:36,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:57:36,845 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_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[13674,13687] [2025-01-09 04:57:36,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:57:36,926 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:57:37,001 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_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[13674,13687] [2025-01-09 04:57:37,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:57:37,076 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:57:37,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:37 WrapperNode [2025-01-09 04:57:37,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:57:37,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:57:37,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:57:37,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:57:37,082 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:57:37" (1/1) ... [2025-01-09 04:57:37,099 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:57:37" (1/1) ... [2025-01-09 04:57:37,164 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1447 [2025-01-09 04:57:37,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:57:37,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:57:37,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:57:37,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:57:37,175 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:37" (1/1) ... [2025-01-09 04:57:37,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:37" (1/1) ... [2025-01-09 04:57:37,188 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:37" (1/1) ... [2025-01-09 04:57:37,221 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:57:37,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:37" (1/1) ... [2025-01-09 04:57:37,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:37" (1/1) ... [2025-01-09 04:57:37,257 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:37" (1/1) ... [2025-01-09 04:57:37,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:37" (1/1) ... [2025-01-09 04:57:37,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:37" (1/1) ... [2025-01-09 04:57:37,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:37" (1/1) ... [2025-01-09 04:57:37,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:37" (1/1) ... [2025-01-09 04:57:37,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:57:37,309 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:57:37,309 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:57:37,309 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:57:37,310 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:37" (1/1) ... [2025-01-09 04:57:37,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:57:37,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:57:37,345 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:57:37,352 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:57:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:57:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:57:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:57:37,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:57:37,537 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:57:37,538 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:57:38,778 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-01-09 04:57:38,778 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:57:38,802 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:57:38,802 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:57:38,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:57:38 BoogieIcfgContainer [2025-01-09 04:57:38,803 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:57:38,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:57:38,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:57:38,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:57:38,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:57:36" (1/3) ... [2025-01-09 04:57:38,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe9ebd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:57:38, skipping insertion in model container [2025-01-09 04:57:38,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:37" (2/3) ... [2025-01-09 04:57:38,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe9ebd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:57:38, skipping insertion in model container [2025-01-09 04:57:38,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:57:38" (3/3) ... [2025-01-09 04:57:38,810 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-01-09 04:57:38,822 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:57:38,826 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c that has 1 procedures, 342 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:57:38,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:57:38,902 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;@3daa00d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:57:38,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:57:38,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 342 states, 340 states have (on average 1.7970588235294118) internal successors, (611), 341 states have internal predecessors, (611), 0 states have call successors, (0), 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:57:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 04:57:38,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:38,922 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, 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:57:38,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:38,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:38,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1594884720, now seen corresponding path program 1 times [2025-01-09 04:57:38,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:38,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259649523] [2025-01-09 04:57:38,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:38,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:39,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 04:57:39,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 04:57:39,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:39,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:39,654 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:57:39,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:39,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259649523] [2025-01-09 04:57:39,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259649523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:39,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:39,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:57:39,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631405194] [2025-01-09 04:57:39,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:39,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:57:39,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:39,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:57:39,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:57:39,692 INFO L87 Difference]: Start difference. First operand has 342 states, 340 states have (on average 1.7970588235294118) internal successors, (611), 341 states have internal predecessors, (611), 0 states have call successors, (0), 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 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:39,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:39,839 INFO L93 Difference]: Finished difference Result 628 states and 1091 transitions. [2025-01-09 04:57:39,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:57:39,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-01-09 04:57:39,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:39,859 INFO L225 Difference]: With dead ends: 628 [2025-01-09 04:57:39,861 INFO L226 Difference]: Without dead ends: 473 [2025-01-09 04:57:39,867 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:57:39,870 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 256 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:39,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1132 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:57:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-01-09 04:57:39,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 471. [2025-01-09 04:57:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.6574468085106382) internal successors, (779), 470 states have internal predecessors, (779), 0 states have call successors, (0), 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:57:39,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 779 transitions. [2025-01-09 04:57:39,947 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 779 transitions. Word has length 118 [2025-01-09 04:57:39,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:39,948 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 779 transitions. [2025-01-09 04:57:39,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:39,948 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 779 transitions. [2025-01-09 04:57:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 04:57:39,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:39,952 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, 1, 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:57:39,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:57:39,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:39,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:39,954 INFO L85 PathProgramCache]: Analyzing trace with hash -910979864, now seen corresponding path program 1 times [2025-01-09 04:57:39,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:39,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690294328] [2025-01-09 04:57:39,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:39,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:40,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 04:57:40,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 04:57:40,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:40,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:40,337 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:57:40,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:40,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690294328] [2025-01-09 04:57:40,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690294328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:40,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:40,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:57:40,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471603632] [2025-01-09 04:57:40,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:40,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:57:40,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:40,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:57:40,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:57:40,341 INFO L87 Difference]: Start difference. First operand 471 states and 779 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:40,435 INFO L93 Difference]: Finished difference Result 1007 states and 1675 transitions. [2025-01-09 04:57:40,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:57:40,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-01-09 04:57:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:40,445 INFO L225 Difference]: With dead ends: 1007 [2025-01-09 04:57:40,446 INFO L226 Difference]: Without dead ends: 729 [2025-01-09 04:57:40,447 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:57:40,448 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 218 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:40,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1075 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:57:40,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-01-09 04:57:40,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 727. [2025-01-09 04:57:40,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 1.6611570247933884) internal successors, (1206), 726 states have internal predecessors, (1206), 0 states have call successors, (0), 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:57:40,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1206 transitions. [2025-01-09 04:57:40,499 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1206 transitions. Word has length 121 [2025-01-09 04:57:40,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:40,500 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1206 transitions. [2025-01-09 04:57:40,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:40,500 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1206 transitions. [2025-01-09 04:57:40,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 04:57:40,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:40,504 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, 1, 1, 1, 1, 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:57:40,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:57:40,504 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:40,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:40,505 INFO L85 PathProgramCache]: Analyzing trace with hash -195863697, now seen corresponding path program 1 times [2025-01-09 04:57:40,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:40,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319936631] [2025-01-09 04:57:40,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:40,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:40,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 04:57:40,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 04:57:40,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:40,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:40,774 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:57:40,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:40,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319936631] [2025-01-09 04:57:40,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319936631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:40,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:40,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:57:40,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893256247] [2025-01-09 04:57:40,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:40,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:57:40,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:40,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:57:40,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:57:40,776 INFO L87 Difference]: Start difference. First operand 727 states and 1206 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:40,832 INFO L93 Difference]: Finished difference Result 1755 states and 2920 transitions. [2025-01-09 04:57:40,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:57:40,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-01-09 04:57:40,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:40,842 INFO L225 Difference]: With dead ends: 1755 [2025-01-09 04:57:40,843 INFO L226 Difference]: Without dead ends: 1221 [2025-01-09 04:57:40,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:57:40,848 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 211 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:40,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1076 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:57:40,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2025-01-09 04:57:40,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1219. [2025-01-09 04:57:40,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1218 states have (on average 1.6600985221674878) internal successors, (2022), 1218 states have internal predecessors, (2022), 0 states have call successors, (0), 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:57:40,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2022 transitions. [2025-01-09 04:57:40,906 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 2022 transitions. Word has length 124 [2025-01-09 04:57:40,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:40,907 INFO L471 AbstractCegarLoop]: Abstraction has 1219 states and 2022 transitions. [2025-01-09 04:57:40,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2022 transitions. [2025-01-09 04:57:40,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 04:57:40,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:40,912 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, 1, 1, 1, 1, 1, 1, 1, 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:57:40,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:57:40,912 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:40,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:40,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1851247163, now seen corresponding path program 1 times [2025-01-09 04:57:40,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:40,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219282703] [2025-01-09 04:57:40,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:40,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:40,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 04:57:40,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 04:57:40,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:40,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:41,157 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:57:41,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:41,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219282703] [2025-01-09 04:57:41,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219282703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:41,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:41,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:57:41,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202549065] [2025-01-09 04:57:41,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:41,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:57:41,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:41,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:57:41,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:57:41,161 INFO L87 Difference]: Start difference. First operand 1219 states and 2022 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:41,213 INFO L93 Difference]: Finished difference Result 3191 states and 5296 transitions. [2025-01-09 04:57:41,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:57:41,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-01-09 04:57:41,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:41,224 INFO L225 Difference]: With dead ends: 3191 [2025-01-09 04:57:41,225 INFO L226 Difference]: Without dead ends: 2165 [2025-01-09 04:57:41,227 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:57:41,231 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 204 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:41,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1077 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:57:41,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2025-01-09 04:57:41,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 2163. [2025-01-09 04:57:41,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 2162 states have (on average 1.6549491211840888) internal successors, (3578), 2162 states have internal predecessors, (3578), 0 states have call successors, (0), 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:57:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3578 transitions. [2025-01-09 04:57:41,292 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3578 transitions. Word has length 127 [2025-01-09 04:57:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:41,293 INFO L471 AbstractCegarLoop]: Abstraction has 2163 states and 3578 transitions. [2025-01-09 04:57:41,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3578 transitions. [2025-01-09 04:57:41,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 04:57:41,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:41,297 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:41,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:57:41,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:41,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:41,298 INFO L85 PathProgramCache]: Analyzing trace with hash -559497898, now seen corresponding path program 1 times [2025-01-09 04:57:41,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:41,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999149474] [2025-01-09 04:57:41,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:41,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:41,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 04:57:41,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 04:57:41,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:41,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:41,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:57:41,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:41,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999149474] [2025-01-09 04:57:41,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999149474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:41,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:41,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:57:41,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208602965] [2025-01-09 04:57:41,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:41,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:57:41,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:41,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:57:41,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:57:41,596 INFO L87 Difference]: Start difference. First operand 2163 states and 3578 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:42,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:42,010 INFO L93 Difference]: Finished difference Result 11283 states and 18810 transitions. [2025-01-09 04:57:42,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:57:42,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2025-01-09 04:57:42,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:42,050 INFO L225 Difference]: With dead ends: 11283 [2025-01-09 04:57:42,050 INFO L226 Difference]: Without dead ends: 9313 [2025-01-09 04:57:42,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:57:42,056 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 2036 mSDsluCounter, 4635 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2036 SdHoareTripleChecker+Valid, 5187 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:42,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2036 Valid, 5187 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:57:42,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9313 states. [2025-01-09 04:57:42,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9313 to 4001. [2025-01-09 04:57:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4001 states, 4000 states have (on average 1.65525) internal successors, (6621), 4000 states have internal predecessors, (6621), 0 states have call successors, (0), 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:57:42,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4001 states to 4001 states and 6621 transitions. [2025-01-09 04:57:42,252 INFO L78 Accepts]: Start accepts. Automaton has 4001 states and 6621 transitions. Word has length 130 [2025-01-09 04:57:42,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:42,252 INFO L471 AbstractCegarLoop]: Abstraction has 4001 states and 6621 transitions. [2025-01-09 04:57:42,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 4001 states and 6621 transitions. [2025-01-09 04:57:42,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:57:42,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:42,257 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:42,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:57:42,257 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:42,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:42,258 INFO L85 PathProgramCache]: Analyzing trace with hash -231627666, now seen corresponding path program 1 times [2025-01-09 04:57:42,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:42,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012610359] [2025-01-09 04:57:42,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:42,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:42,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:57:42,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:57:42,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:42,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:42,453 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:57:42,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:42,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012610359] [2025-01-09 04:57:42,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012610359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:42,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:42,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:57:42,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914894141] [2025-01-09 04:57:42,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:42,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:57:42,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:42,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:57:42,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:57:42,455 INFO L87 Difference]: Start difference. First operand 4001 states and 6621 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:42,588 INFO L93 Difference]: Finished difference Result 11713 states and 19481 transitions. [2025-01-09 04:57:42,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:57:42,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-01-09 04:57:42,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:42,622 INFO L225 Difference]: With dead ends: 11713 [2025-01-09 04:57:42,622 INFO L226 Difference]: Without dead ends: 7905 [2025-01-09 04:57:42,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:57:42,632 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 718 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:42,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1851 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:57:42,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7905 states. [2025-01-09 04:57:42,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7905 to 5936. [2025-01-09 04:57:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5936 states, 5935 states have (on average 1.6572872788542545) internal successors, (9836), 5935 states have internal predecessors, (9836), 0 states have call successors, (0), 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:57:42,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5936 states to 5936 states and 9836 transitions. [2025-01-09 04:57:42,836 INFO L78 Accepts]: Start accepts. Automaton has 5936 states and 9836 transitions. Word has length 131 [2025-01-09 04:57:42,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:42,837 INFO L471 AbstractCegarLoop]: Abstraction has 5936 states and 9836 transitions. [2025-01-09 04:57:42,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:42,837 INFO L276 IsEmpty]: Start isEmpty. Operand 5936 states and 9836 transitions. [2025-01-09 04:57:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 04:57:42,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:42,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:42,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:57:42,842 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:42,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:42,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1540206583, now seen corresponding path program 1 times [2025-01-09 04:57:42,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:42,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887024766] [2025-01-09 04:57:42,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:42,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:42,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 04:57:42,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 04:57:42,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:42,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:43,020 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:57:43,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:43,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887024766] [2025-01-09 04:57:43,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887024766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:43,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:43,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:57:43,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874558533] [2025-01-09 04:57:43,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:43,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:57:43,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:43,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:57:43,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:57:43,022 INFO L87 Difference]: Start difference. First operand 5936 states and 9836 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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:57:43,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:43,113 INFO L93 Difference]: Finished difference Result 13025 states and 21678 transitions. [2025-01-09 04:57:43,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:57:43,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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:57:43,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:43,159 INFO L225 Difference]: With dead ends: 13025 [2025-01-09 04:57:43,159 INFO L226 Difference]: Without dead ends: 9024 [2025-01-09 04:57:43,169 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:57:43,170 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 226 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1256 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:57:43,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1256 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:57:43,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9024 states. [2025-01-09 04:57:43,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9024 to 9022. [2025-01-09 04:57:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9022 states, 9021 states have (on average 1.6572442079592062) internal successors, (14950), 9021 states have internal predecessors, (14950), 0 states have call successors, (0), 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:57:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9022 states to 9022 states and 14950 transitions. [2025-01-09 04:57:43,419 INFO L78 Accepts]: Start accepts. Automaton has 9022 states and 14950 transitions. Word has length 132 [2025-01-09 04:57:43,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:43,421 INFO L471 AbstractCegarLoop]: Abstraction has 9022 states and 14950 transitions. [2025-01-09 04:57:43,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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:57:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 9022 states and 14950 transitions. [2025-01-09 04:57:43,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 04:57:43,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:43,424 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:43,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:57:43,424 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:43,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:43,425 INFO L85 PathProgramCache]: Analyzing trace with hash 579129211, now seen corresponding path program 1 times [2025-01-09 04:57:43,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:43,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861163398] [2025-01-09 04:57:43,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:43,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:43,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 04:57:43,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 04:57:43,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:43,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:43,581 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:57:43,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:43,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861163398] [2025-01-09 04:57:43,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861163398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:43,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:43,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:57:43,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446628673] [2025-01-09 04:57:43,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:43,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:57:43,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:43,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:57:43,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:57:43,583 INFO L87 Difference]: Start difference. First operand 9022 states and 14950 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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:57:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:43,695 INFO L93 Difference]: Finished difference Result 17368 states and 28819 transitions. [2025-01-09 04:57:43,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:57:43,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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:57:43,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:43,740 INFO L225 Difference]: With dead ends: 17368 [2025-01-09 04:57:43,740 INFO L226 Difference]: Without dead ends: 12606 [2025-01-09 04:57:43,753 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:57:43,754 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 219 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1232 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:43,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1232 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:57:43,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12606 states. [2025-01-09 04:57:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12606 to 12604. [2025-01-09 04:57:43,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12604 states, 12603 states have (on average 1.653574545743077) internal successors, (20840), 12603 states have internal predecessors, (20840), 0 states have call successors, (0), 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:57:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12604 states to 12604 states and 20840 transitions. [2025-01-09 04:57:44,024 INFO L78 Accepts]: Start accepts. Automaton has 12604 states and 20840 transitions. Word has length 132 [2025-01-09 04:57:44,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:44,025 INFO L471 AbstractCegarLoop]: Abstraction has 12604 states and 20840 transitions. [2025-01-09 04:57:44,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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:57:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 12604 states and 20840 transitions. [2025-01-09 04:57:44,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 04:57:44,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:44,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:44,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:57:44,027 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:44,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:44,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1676490411, now seen corresponding path program 1 times [2025-01-09 04:57:44,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:44,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632683896] [2025-01-09 04:57:44,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:44,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:44,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 04:57:44,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 04:57:44,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:44,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:44,218 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:57:44,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:44,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632683896] [2025-01-09 04:57:44,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632683896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:44,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:44,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:57:44,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868707717] [2025-01-09 04:57:44,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:44,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:57:44,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:44,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:57:44,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:57:44,220 INFO L87 Difference]: Start difference. First operand 12604 states and 20840 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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:57:44,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:44,358 INFO L93 Difference]: Finished difference Result 24110 states and 39925 transitions. [2025-01-09 04:57:44,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:57:44,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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:57:44,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:44,403 INFO L225 Difference]: With dead ends: 24110 [2025-01-09 04:57:44,403 INFO L226 Difference]: Without dead ends: 17468 [2025-01-09 04:57:44,418 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:57:44,419 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 212 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1199 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:44,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1199 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:57:44,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17468 states. [2025-01-09 04:57:44,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17468 to 17466. [2025-01-09 04:57:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17466 states, 17465 states have (on average 1.6494703693100488) internal successors, (28808), 17465 states have internal predecessors, (28808), 0 states have call successors, (0), 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:57:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17466 states to 17466 states and 28808 transitions. [2025-01-09 04:57:44,871 INFO L78 Accepts]: Start accepts. Automaton has 17466 states and 28808 transitions. Word has length 132 [2025-01-09 04:57:44,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:44,872 INFO L471 AbstractCegarLoop]: Abstraction has 17466 states and 28808 transitions. [2025-01-09 04:57:44,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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:57:44,872 INFO L276 IsEmpty]: Start isEmpty. Operand 17466 states and 28808 transitions. [2025-01-09 04:57:44,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 04:57:44,873 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:44,874 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:44,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:57:44,875 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:44,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:44,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1346972957, now seen corresponding path program 1 times [2025-01-09 04:57:44,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:44,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442693215] [2025-01-09 04:57:44,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:44,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:44,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 04:57:44,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 04:57:44,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:44,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:45,066 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:57:45,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:45,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442693215] [2025-01-09 04:57:45,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442693215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:45,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:45,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:57:45,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31312269] [2025-01-09 04:57:45,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:45,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:57:45,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:45,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:57:45,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:57:45,069 INFO L87 Difference]: Start difference. First operand 17466 states and 28808 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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:57:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:45,268 INFO L93 Difference]: Finished difference Result 56537 states and 93383 transitions. [2025-01-09 04:57:45,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:57:45,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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:57:45,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:45,364 INFO L225 Difference]: With dead ends: 56537 [2025-01-09 04:57:45,365 INFO L226 Difference]: Without dead ends: 39310 [2025-01-09 04:57:45,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:57:45,481 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 716 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:45,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1612 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:57:45,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39310 states. [2025-01-09 04:57:45,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39310 to 28329. [2025-01-09 04:57:45,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28329 states, 28328 states have (on average 1.644909630048009) internal successors, (46597), 28328 states have internal predecessors, (46597), 0 states have call successors, (0), 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:57:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28329 states to 28329 states and 46597 transitions. [2025-01-09 04:57:46,005 INFO L78 Accepts]: Start accepts. Automaton has 28329 states and 46597 transitions. Word has length 132 [2025-01-09 04:57:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:46,005 INFO L471 AbstractCegarLoop]: Abstraction has 28329 states and 46597 transitions. [2025-01-09 04:57:46,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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:57:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand 28329 states and 46597 transitions. [2025-01-09 04:57:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 04:57:46,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:46,007 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:46,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:57:46,008 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:46,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:46,008 INFO L85 PathProgramCache]: Analyzing trace with hash -434438713, now seen corresponding path program 1 times [2025-01-09 04:57:46,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:46,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811163177] [2025-01-09 04:57:46,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:46,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:46,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 04:57:46,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 04:57:46,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:46,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57: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:57:46,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:46,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811163177] [2025-01-09 04:57:46,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811163177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:46,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:46,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:57:46,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045524878] [2025-01-09 04:57:46,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:46,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:57:46,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:46,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:57:46,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:57:46,177 INFO L87 Difference]: Start difference. First operand 28329 states and 46597 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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:57:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:46,404 INFO L93 Difference]: Finished difference Result 54295 states and 89424 transitions. [2025-01-09 04:57:46,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:57:46,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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:57:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:46,519 INFO L225 Difference]: With dead ends: 54295 [2025-01-09 04:57:46,519 INFO L226 Difference]: Without dead ends: 39073 [2025-01-09 04:57:46,557 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:57:46,558 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 205 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1166 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:57:46,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1166 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:57:46,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39073 states. [2025-01-09 04:57:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39073 to 39071. [2025-01-09 04:57:47,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39071 states, 39070 states have (on average 1.6393908369593038) internal successors, (64051), 39070 states have internal predecessors, (64051), 0 states have call successors, (0), 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:57:47,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39071 states to 39071 states and 64051 transitions. [2025-01-09 04:57:47,341 INFO L78 Accepts]: Start accepts. Automaton has 39071 states and 64051 transitions. Word has length 132 [2025-01-09 04:57:47,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:47,342 INFO L471 AbstractCegarLoop]: Abstraction has 39071 states and 64051 transitions. [2025-01-09 04:57:47,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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:57:47,342 INFO L276 IsEmpty]: Start isEmpty. Operand 39071 states and 64051 transitions. [2025-01-09 04:57:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 04:57:47,343 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:47,343 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:47,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:57:47,343 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:47,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:47,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1251457259, now seen corresponding path program 1 times [2025-01-09 04:57:47,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:47,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259343856] [2025-01-09 04:57:47,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:47,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:47,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 04:57:47,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 04:57:47,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:47,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:47,506 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:57:47,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:47,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259343856] [2025-01-09 04:57:47,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259343856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:47,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:47,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:57:47,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141432057] [2025-01-09 04:57:47,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:47,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:57:47,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:47,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:57:47,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:57:47,509 INFO L87 Difference]: Start difference. First operand 39071 states and 64051 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:48,217 INFO L93 Difference]: Finished difference Result 126537 states and 207711 transitions. [2025-01-09 04:57:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:57:48,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-01-09 04:57:48,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:48,469 INFO L225 Difference]: With dead ends: 126537 [2025-01-09 04:57:48,470 INFO L226 Difference]: Without dead ends: 87727 [2025-01-09 04:57:48,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:57:48,512 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 714 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:48,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 1848 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:57:48,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87727 states. [2025-01-09 04:57:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87727 to 63256. [2025-01-09 04:57:49,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63256 states, 63255 states have (on average 1.6339894079519406) internal successors, (103358), 63255 states have internal predecessors, (103358), 0 states have call successors, (0), 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:57:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63256 states to 63256 states and 103358 transitions. [2025-01-09 04:57:50,032 INFO L78 Accepts]: Start accepts. Automaton has 63256 states and 103358 transitions. Word has length 133 [2025-01-09 04:57:50,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:50,032 INFO L471 AbstractCegarLoop]: Abstraction has 63256 states and 103358 transitions. [2025-01-09 04:57:50,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 63256 states and 103358 transitions. [2025-01-09 04:57:50,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 04:57:50,034 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:50,035 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:50,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:57:50,035 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:50,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:50,036 INFO L85 PathProgramCache]: Analyzing trace with hash -193857308, now seen corresponding path program 1 times [2025-01-09 04:57:50,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:50,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341383705] [2025-01-09 04:57:50,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:50,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:50,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 04:57:50,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 04:57:50,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:50,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:50,257 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:57:50,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:50,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341383705] [2025-01-09 04:57:50,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341383705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:50,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:50,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:57:50,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765527828] [2025-01-09 04:57:50,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:50,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:57:50,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:50,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:57:50,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:57:50,259 INFO L87 Difference]: Start difference. First operand 63256 states and 103358 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:51,340 INFO L93 Difference]: Finished difference Result 202567 states and 331417 transitions. [2025-01-09 04:57:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:57:51,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2025-01-09 04:57:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:51,661 INFO L225 Difference]: With dead ends: 202567 [2025-01-09 04:57:51,661 INFO L226 Difference]: Without dead ends: 139572 [2025-01-09 04:57:51,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:57:51,715 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 712 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:51,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 1850 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:57:51,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139572 states. [2025-01-09 04:57:53,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139572 to 101189. [2025-01-09 04:57:53,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101189 states, 101188 states have (on average 1.6286615013637982) internal successors, (164801), 101188 states have internal predecessors, (164801), 0 states have call successors, (0), 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:57:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101189 states to 101189 states and 164801 transitions. [2025-01-09 04:57:54,081 INFO L78 Accepts]: Start accepts. Automaton has 101189 states and 164801 transitions. Word has length 134 [2025-01-09 04:57:54,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:54,081 INFO L471 AbstractCegarLoop]: Abstraction has 101189 states and 164801 transitions. [2025-01-09 04:57:54,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:54,082 INFO L276 IsEmpty]: Start isEmpty. Operand 101189 states and 164801 transitions. [2025-01-09 04:57:54,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 04:57:54,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:54,084 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:54,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:57:54,084 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:54,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:54,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1164383125, now seen corresponding path program 1 times [2025-01-09 04:57:54,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:54,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693310513] [2025-01-09 04:57:54,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:54,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:54,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 04:57:54,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 04:57:54,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:54,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:54,466 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:57:54,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:54,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693310513] [2025-01-09 04:57:54,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693310513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:54,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:54,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:57:54,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886209275] [2025-01-09 04:57:54,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:54,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:57:54,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:54,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:57:54,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:57:54,467 INFO L87 Difference]: Start difference. First operand 101189 states and 164801 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:55,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:55,388 INFO L93 Difference]: Finished difference Result 202119 states and 329186 transitions. [2025-01-09 04:57:55,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:57:55,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-01-09 04:57:55,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:55,564 INFO L225 Difference]: With dead ends: 202119 [2025-01-09 04:57:55,564 INFO L226 Difference]: Without dead ends: 101191 [2025-01-09 04:57:55,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:57:55,653 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 618 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 2122 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:55,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 2122 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:57:55,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101191 states. [2025-01-09 04:57:56,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101191 to 101189. [2025-01-09 04:57:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101189 states, 101188 states have (on average 1.6224848796299955) internal successors, (164176), 101188 states have internal predecessors, (164176), 0 states have call successors, (0), 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:57:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101189 states to 101189 states and 164176 transitions. [2025-01-09 04:57:57,324 INFO L78 Accepts]: Start accepts. Automaton has 101189 states and 164176 transitions. Word has length 136 [2025-01-09 04:57:57,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:57,325 INFO L471 AbstractCegarLoop]: Abstraction has 101189 states and 164176 transitions. [2025-01-09 04:57:57,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 101189 states and 164176 transitions. [2025-01-09 04:57:57,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 04:57:57,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:57,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:57,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:57:57,327 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:57,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:57,327 INFO L85 PathProgramCache]: Analyzing trace with hash -66556249, now seen corresponding path program 1 times [2025-01-09 04:57:57,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:57,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647919928] [2025-01-09 04:57:57,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:57,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:57,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 04:57:57,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 04:57:57,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:57,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:57,702 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:57:57,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:57,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647919928] [2025-01-09 04:57:57,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647919928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:57,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:57,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:57:57,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989876615] [2025-01-09 04:57:57,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:57,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:57:57,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:57,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:57:57,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:57:57,704 INFO L87 Difference]: Start difference. First operand 101189 states and 164176 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:58,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:58,980 INFO L93 Difference]: Finished difference Result 295765 states and 480310 transitions. [2025-01-09 04:57:58,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:57:58,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2025-01-09 04:57:58,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:59,315 INFO L225 Difference]: With dead ends: 295765 [2025-01-09 04:57:59,315 INFO L226 Difference]: Without dead ends: 194837 [2025-01-09 04:57:59,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:57:59,410 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 409 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:59,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 2135 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:57:59,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194837 states. [2025-01-09 04:58:01,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194837 to 194835. [2025-01-09 04:58:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194835 states, 194834 states have (on average 1.614364022706509) internal successors, (314533), 194834 states have internal predecessors, (314533), 0 states have call successors, (0), 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:58:02,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194835 states to 194835 states and 314533 transitions. [2025-01-09 04:58:02,609 INFO L78 Accepts]: Start accepts. Automaton has 194835 states and 314533 transitions. Word has length 139 [2025-01-09 04:58:02,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:02,609 INFO L471 AbstractCegarLoop]: Abstraction has 194835 states and 314533 transitions. [2025-01-09 04:58:02,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 194835 states and 314533 transitions. [2025-01-09 04:58:02,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 04:58:02,610 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:02,610 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:02,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:58:02,611 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:02,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:02,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2065152814, now seen corresponding path program 1 times [2025-01-09 04:58:02,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:02,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668755409] [2025-01-09 04:58:02,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:02,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:02,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 04:58:02,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 04:58:02,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:02,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:03,351 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:58:03,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:03,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668755409] [2025-01-09 04:58:03,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668755409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:03,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:03,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:58:03,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660556226] [2025-01-09 04:58:03,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:03,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:58:03,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:03,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:58:03,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:58:03,352 INFO L87 Difference]: Start difference. First operand 194835 states and 314533 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 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:58:04,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:04,478 INFO L93 Difference]: Finished difference Result 198709 states and 320342 transitions. [2025-01-09 04:58:04,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:58:04,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-01-09 04:58:04,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:04,781 INFO L225 Difference]: With dead ends: 198709 [2025-01-09 04:58:04,781 INFO L226 Difference]: Without dead ends: 198707 [2025-01-09 04:58:04,808 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:58:04,809 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 0 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2210 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:04,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2210 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:58:04,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198707 states. [2025-01-09 04:58:06,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198707 to 198707. [2025-01-09 04:58:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198707 states, 198706 states have (on average 1.6022566002033154) internal successors, (318378), 198706 states have internal predecessors, (318378), 0 states have call successors, (0), 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:58:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198707 states to 198707 states and 318378 transitions. [2025-01-09 04:58:07,112 INFO L78 Accepts]: Start accepts. Automaton has 198707 states and 318378 transitions. Word has length 140 [2025-01-09 04:58:07,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:07,113 INFO L471 AbstractCegarLoop]: Abstraction has 198707 states and 318378 transitions. [2025-01-09 04:58:07,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 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:58:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 198707 states and 318378 transitions. [2025-01-09 04:58:07,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 04:58:07,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:07,120 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:58:07,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:58:07,120 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:07,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:07,121 INFO L85 PathProgramCache]: Analyzing trace with hash 288703321, now seen corresponding path program 1 times [2025-01-09 04:58:07,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:07,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475482484] [2025-01-09 04:58:07,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:07,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:07,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 04:58:07,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 04:58:07,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:07,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:58:07,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:07,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475482484] [2025-01-09 04:58:07,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475482484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:07,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:07,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:58:07,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027999083] [2025-01-09 04:58:07,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:07,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:58:07,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:07,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:58:07,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:58:07,880 INFO L87 Difference]: Start difference. First operand 198707 states and 318378 transitions. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 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:58:10,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:10,310 INFO L93 Difference]: Finished difference Result 542131 states and 870875 transitions. [2025-01-09 04:58:10,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:58:10,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 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 174 [2025-01-09 04:58:10,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:11,121 INFO L225 Difference]: With dead ends: 542131 [2025-01-09 04:58:11,121 INFO L226 Difference]: Without dead ends: 453729 [2025-01-09 04:58:11,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:58:11,218 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 1428 mSDsluCounter, 2786 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 3580 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:11,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 3580 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:11,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453729 states. [2025-01-09 04:58:15,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453729 to 319485. [2025-01-09 04:58:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319485 states, 319484 states have (on average 1.6003993940228618) internal successors, (511302), 319484 states have internal predecessors, (511302), 0 states have call successors, (0), 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:58:16,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319485 states to 319485 states and 511302 transitions. [2025-01-09 04:58:16,784 INFO L78 Accepts]: Start accepts. Automaton has 319485 states and 511302 transitions. Word has length 174 [2025-01-09 04:58:16,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:16,786 INFO L471 AbstractCegarLoop]: Abstraction has 319485 states and 511302 transitions. [2025-01-09 04:58:16,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 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:58:16,786 INFO L276 IsEmpty]: Start isEmpty. Operand 319485 states and 511302 transitions. [2025-01-09 04:58:16,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 04:58:16,792 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:16,793 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:58:16,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:58:16,793 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:16,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:16,794 INFO L85 PathProgramCache]: Analyzing trace with hash -672374051, now seen corresponding path program 1 times [2025-01-09 04:58:16,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:16,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990424868] [2025-01-09 04:58:16,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:16,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:16,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 04:58:16,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 04:58:16,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:16,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:17,079 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:58:17,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:17,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990424868] [2025-01-09 04:58:17,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990424868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:17,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:17,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:58:17,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847969795] [2025-01-09 04:58:17,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:17,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:58:17,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:17,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:58:17,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:58:17,081 INFO L87 Difference]: Start difference. First operand 319485 states and 511302 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 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:58:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:20,120 INFO L93 Difference]: Finished difference Result 609941 states and 979879 transitions. [2025-01-09 04:58:20,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:58:20,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 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 174 [2025-01-09 04:58:20,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:21,178 INFO L225 Difference]: With dead ends: 609941 [2025-01-09 04:58:21,178 INFO L226 Difference]: Without dead ends: 522689 [2025-01-09 04:58:21,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:58:21,338 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 1435 mSDsluCounter, 2390 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1435 SdHoareTripleChecker+Valid, 3187 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:21,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1435 Valid, 3187 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:21,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522689 states. [2025-01-09 04:58:26,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522689 to 431909.