./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/hardness-nfm22/hardness_operatoramount_amount500_file-12.i -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 e76f98806e1a295fb78f8f1dda231a882e312782f15d8b64a58205cca62d9cda --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:37:09,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:37:09,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:37:09,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:37:09,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:37:09,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:37:09,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:37:09,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:37:09,565 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:37:09,566 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:37:09,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:37:09,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:37:09,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:37:09,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:37:09,567 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:37:09,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:37:09,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:37:09,568 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:37:09,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:37:09,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:37:09,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:37:09,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:37:09,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:37:09,568 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:37:09,569 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:37:09,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:37:09,569 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:37:09,569 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:37:09,569 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:37:09,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:37:09,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:37:09,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:37:09,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:37:09,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:37:09,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:37:09,571 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:37:09,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:37:09,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:37:09,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:37:09,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:37:09,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:37:09,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:37:09,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:37:09,571 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 -> e76f98806e1a295fb78f8f1dda231a882e312782f15d8b64a58205cca62d9cda [2025-02-06 02:37:09,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:37:09,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:37:09,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:37:09,871 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:37:09,871 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:37:09,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-12.i [2025-02-06 02:37:11,179 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f2a71ed4/664b3388d2474b28b012407b94acfc18/FLAG1780e1ba7 [2025-02-06 02:37:11,572 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:37:11,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-12.i [2025-02-06 02:37:11,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f2a71ed4/664b3388d2474b28b012407b94acfc18/FLAG1780e1ba7 [2025-02-06 02:37:11,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f2a71ed4/664b3388d2474b28b012407b94acfc18 [2025-02-06 02:37:11,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:37:11,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:37:11,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:37:11,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:37:11,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:37:11,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:37:11" (1/1) ... [2025-02-06 02:37:11,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@731dad8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:11, skipping insertion in model container [2025-02-06 02:37:11,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:37:11" (1/1) ... [2025-02-06 02:37:11,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:37:11,767 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/hardness-nfm22/hardness_operatoramount_amount500_file-12.i[916,929] [2025-02-06 02:37:12,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:37:12,026 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:37:12,034 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/hardness-nfm22/hardness_operatoramount_amount500_file-12.i[916,929] [2025-02-06 02:37:12,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:37:12,189 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:37:12,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:12 WrapperNode [2025-02-06 02:37:12,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:37:12,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:37:12,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:37:12,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:37:12,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:12" (1/1) ... [2025-02-06 02:37:12,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:12" (1/1) ... [2025-02-06 02:37:12,302 INFO L138 Inliner]: procedures = 26, calls = 78, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 864 [2025-02-06 02:37:12,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:37:12,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:37:12,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:37:12,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:37:12,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:12" (1/1) ... [2025-02-06 02:37:12,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:12" (1/1) ... [2025-02-06 02:37:12,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:12" (1/1) ... [2025-02-06 02:37:12,381 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-02-06 02:37:12,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:12" (1/1) ... [2025-02-06 02:37:12,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:12" (1/1) ... [2025-02-06 02:37:12,424 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:12" (1/1) ... [2025-02-06 02:37:12,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:12" (1/1) ... [2025-02-06 02:37:12,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:12" (1/1) ... [2025-02-06 02:37:12,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:12" (1/1) ... [2025-02-06 02:37:12,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:37:12,473 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:37:12,473 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:37:12,473 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:37:12,474 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:12" (1/1) ... [2025-02-06 02:37:12,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:37:12,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:37:12,505 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-02-06 02:37:12,529 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-02-06 02:37:12,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:37:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:37:12,562 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:37:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:37:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:37:12,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:37:12,734 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:37:12,736 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:37:14,056 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L655: havoc property_#t~ite52#1;havoc property_#t~ite51#1;havoc property_#t~bitwise50#1;havoc property_#t~short53#1;havoc property_#t~bitwise54#1;havoc property_#t~short55#1;havoc property_#t~ite57#1;havoc property_#t~bitwise56#1;havoc property_#t~short58#1;havoc property_#t~ite62#1;havoc property_#t~ite61#1;havoc property_#t~ite60#1;havoc property_#t~bitwise59#1;havoc property_#t~short63#1;havoc property_#t~ite67#1;havoc property_#t~ite66#1;havoc property_#t~ite65#1;havoc property_#t~bitwise64#1;havoc property_#t~short68#1;havoc property_#t~bitwise69#1;havoc property_#t~short70#1;havoc property_#t~bitwise71#1;havoc property_#t~short72#1;havoc property_#t~ite74#1;havoc property_#t~bitwise73#1;havoc property_#t~short75#1;havoc property_#t~ite77#1;havoc property_#t~bitwise76#1;havoc property_#t~short78#1;havoc property_#t~ite81#1;havoc property_#t~ite80#1;havoc property_#t~bitwise79#1;havoc property_#t~short82#1; [2025-02-06 02:37:14,253 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-02-06 02:37:14,253 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:37:14,291 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:37:14,292 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 02:37:14,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:37:14 BoogieIcfgContainer [2025-02-06 02:37:14,292 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:37:14,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:37:14,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:37:14,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:37:14,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:37:11" (1/3) ... [2025-02-06 02:37:14,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16684d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:37:14, skipping insertion in model container [2025-02-06 02:37:14,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:12" (2/3) ... [2025-02-06 02:37:14,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16684d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:37:14, skipping insertion in model container [2025-02-06 02:37:14,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:37:14" (3/3) ... [2025-02-06 02:37:14,301 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-12.i [2025-02-06 02:37:14,314 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:37:14,317 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-12.i that has 2 procedures, 343 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:37:14,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:37:14,397 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;@3b7aacd6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:37:14,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:37:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 343 states, 275 states have (on average 1.549090909090909) internal successors, (426), 276 states have internal predecessors, (426), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-06 02:37:14,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-02-06 02:37:14,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:14,452 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:37:14,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:14,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:14,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1616532297, now seen corresponding path program 1 times [2025-02-06 02:37:14,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:14,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29681565] [2025-02-06 02:37:14,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:14,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:14,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-02-06 02:37:14,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-02-06 02:37:14,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:14,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:37:15,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:15,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29681565] [2025-02-06 02:37:15,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29681565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:15,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:15,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:37:15,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168885650] [2025-02-06 02:37:15,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:15,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:37:15,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:15,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:37:15,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:37:15,527 INFO L87 Difference]: Start difference. First operand has 343 states, 275 states have (on average 1.549090909090909) internal successors, (426), 276 states have internal predecessors, (426), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:15,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:15,801 INFO L93 Difference]: Finished difference Result 966 states and 1674 transitions. [2025-02-06 02:37:15,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:37:15,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 466 [2025-02-06 02:37:15,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:15,818 INFO L225 Difference]: With dead ends: 966 [2025-02-06 02:37:15,819 INFO L226 Difference]: Without dead ends: 626 [2025-02-06 02:37:15,827 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-02-06 02:37:15,829 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 449 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:15,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1009 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:37:15,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-02-06 02:37:15,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 623. [2025-02-06 02:37:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 519 states have (on average 1.5472061657032756) internal successors, (803), 520 states have internal predecessors, (803), 101 states have call successors, (101), 2 states have call predecessors, (101), 2 states have return successors, (101), 100 states have call predecessors, (101), 101 states have call successors, (101) [2025-02-06 02:37:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1005 transitions. [2025-02-06 02:37:15,978 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1005 transitions. Word has length 466 [2025-02-06 02:37:15,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:15,982 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 1005 transitions. [2025-02-06 02:37:15,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1005 transitions. [2025-02-06 02:37:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-02-06 02:37:15,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:15,995 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:37:15,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 02:37:15,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:15,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:15,996 INFO L85 PathProgramCache]: Analyzing trace with hash -998200794, now seen corresponding path program 1 times [2025-02-06 02:37:15,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:15,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657431065] [2025-02-06 02:37:15,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:15,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:16,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-02-06 02:37:16,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-02-06 02:37:16,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:16,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:37:16,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:16,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657431065] [2025-02-06 02:37:16,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657431065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:16,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:16,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:37:16,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628329974] [2025-02-06 02:37:16,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:16,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:37:16,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:16,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:37:16,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:37:16,590 INFO L87 Difference]: Start difference. First operand 623 states and 1005 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:16,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:16,841 INFO L93 Difference]: Finished difference Result 1861 states and 3005 transitions. [2025-02-06 02:37:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:37:16,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 467 [2025-02-06 02:37:16,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:16,857 INFO L225 Difference]: With dead ends: 1861 [2025-02-06 02:37:16,857 INFO L226 Difference]: Without dead ends: 1241 [2025-02-06 02:37:16,860 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-02-06 02:37:16,861 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 480 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:16,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1246 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:37:16,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-02-06 02:37:16,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1239. [2025-02-06 02:37:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1032 states have (on average 1.5436046511627908) internal successors, (1593), 1034 states have internal predecessors, (1593), 202 states have call successors, (202), 4 states have call predecessors, (202), 4 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2025-02-06 02:37:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1997 transitions. [2025-02-06 02:37:17,010 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1997 transitions. Word has length 467 [2025-02-06 02:37:17,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:17,013 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1997 transitions. [2025-02-06 02:37:17,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:17,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1997 transitions. [2025-02-06 02:37:17,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-02-06 02:37:17,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:17,026 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:37:17,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:37:17,026 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:17,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:17,027 INFO L85 PathProgramCache]: Analyzing trace with hash -826632377, now seen corresponding path program 1 times [2025-02-06 02:37:17,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:17,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576845603] [2025-02-06 02:37:17,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:17,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:17,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-02-06 02:37:17,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-02-06 02:37:17,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:17,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:17,647 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:37:17,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:17,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576845603] [2025-02-06 02:37:17,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576845603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:17,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:17,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:37:17,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219374184] [2025-02-06 02:37:17,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:17,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:37:17,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:17,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:37:17,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:37:17,652 INFO L87 Difference]: Start difference. First operand 1239 states and 1997 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:17,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:17,903 INFO L93 Difference]: Finished difference Result 3695 states and 5969 transitions. [2025-02-06 02:37:17,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:37:17,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 467 [2025-02-06 02:37:17,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:17,926 INFO L225 Difference]: With dead ends: 3695 [2025-02-06 02:37:17,927 INFO L226 Difference]: Without dead ends: 2459 [2025-02-06 02:37:17,933 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-02-06 02:37:17,936 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 531 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:17,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1337 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:37:17,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2025-02-06 02:37:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2453. [2025-02-06 02:37:18,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2040 states have (on average 1.5362745098039217) internal successors, (3134), 2044 states have internal predecessors, (3134), 404 states have call successors, (404), 8 states have call predecessors, (404), 8 states have return successors, (404), 400 states have call predecessors, (404), 404 states have call successors, (404) [2025-02-06 02:37:18,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3942 transitions. [2025-02-06 02:37:18,182 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3942 transitions. Word has length 467 [2025-02-06 02:37:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:18,183 INFO L471 AbstractCegarLoop]: Abstraction has 2453 states and 3942 transitions. [2025-02-06 02:37:18,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3942 transitions. [2025-02-06 02:37:18,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-02-06 02:37:18,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:18,194 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:37:18,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:37:18,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:18,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:18,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2139425231, now seen corresponding path program 1 times [2025-02-06 02:37:18,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:18,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182524756] [2025-02-06 02:37:18,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:18,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:18,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-02-06 02:37:18,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-02-06 02:37:18,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:18,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:37:18,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:18,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182524756] [2025-02-06 02:37:18,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182524756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:18,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:18,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:37:18,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025715553] [2025-02-06 02:37:18,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:18,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:37:18,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:18,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:37:18,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:37:18,979 INFO L87 Difference]: Start difference. First operand 2453 states and 3942 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:19,748 INFO L93 Difference]: Finished difference Result 8295 states and 13285 transitions. [2025-02-06 02:37:19,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:37:19,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 468 [2025-02-06 02:37:19,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:19,784 INFO L225 Difference]: With dead ends: 8295 [2025-02-06 02:37:19,784 INFO L226 Difference]: Without dead ends: 5845 [2025-02-06 02:37:19,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:37:19,795 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 992 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:19,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 1545 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:37:19,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5845 states. [2025-02-06 02:37:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5845 to 5753. [2025-02-06 02:37:20,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5753 states, 4928 states have (on average 1.541396103896104) internal successors, (7596), 4936 states have internal predecessors, (7596), 808 states have call successors, (808), 16 states have call predecessors, (808), 16 states have return successors, (808), 800 states have call predecessors, (808), 808 states have call successors, (808) [2025-02-06 02:37:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5753 states to 5753 states and 9212 transitions. [2025-02-06 02:37:20,167 INFO L78 Accepts]: Start accepts. Automaton has 5753 states and 9212 transitions. Word has length 468 [2025-02-06 02:37:20,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:20,168 INFO L471 AbstractCegarLoop]: Abstraction has 5753 states and 9212 transitions. [2025-02-06 02:37:20,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:20,168 INFO L276 IsEmpty]: Start isEmpty. Operand 5753 states and 9212 transitions. [2025-02-06 02:37:20,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-02-06 02:37:20,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:20,183 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:37:20,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:37:20,183 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:20,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:20,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1998439793, now seen corresponding path program 1 times [2025-02-06 02:37:20,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:20,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820193100] [2025-02-06 02:37:20,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:20,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:20,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-02-06 02:37:20,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-02-06 02:37:20,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:20,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:37:21,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:21,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820193100] [2025-02-06 02:37:21,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820193100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:21,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:21,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:37:21,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392603802] [2025-02-06 02:37:21,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:21,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:37:21,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:21,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:37:21,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:37:21,073 INFO L87 Difference]: Start difference. First operand 5753 states and 9212 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:21,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:21,731 INFO L93 Difference]: Finished difference Result 14258 states and 22782 transitions. [2025-02-06 02:37:21,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:37:21,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 468 [2025-02-06 02:37:21,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:21,780 INFO L225 Difference]: With dead ends: 14258 [2025-02-06 02:37:21,780 INFO L226 Difference]: Without dead ends: 8508 [2025-02-06 02:37:21,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:37:21,799 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 525 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:21,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1543 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:37:21,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states. [2025-02-06 02:37:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 5942. [2025-02-06 02:37:22,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5942 states, 5050 states have (on average 1.5368316831683169) internal successors, (7761), 5058 states have internal predecessors, (7761), 873 states have call successors, (873), 18 states have call predecessors, (873), 18 states have return successors, (873), 865 states have call predecessors, (873), 873 states have call successors, (873) [2025-02-06 02:37:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5942 states to 5942 states and 9507 transitions. [2025-02-06 02:37:22,211 INFO L78 Accepts]: Start accepts. Automaton has 5942 states and 9507 transitions. Word has length 468 [2025-02-06 02:37:22,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:22,213 INFO L471 AbstractCegarLoop]: Abstraction has 5942 states and 9507 transitions. [2025-02-06 02:37:22,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:22,213 INFO L276 IsEmpty]: Start isEmpty. Operand 5942 states and 9507 transitions. [2025-02-06 02:37:22,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-02-06 02:37:22,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:22,227 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:37:22,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:37:22,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:22,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:22,228 INFO L85 PathProgramCache]: Analyzing trace with hash 905644686, now seen corresponding path program 1 times [2025-02-06 02:37:22,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:22,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083425548] [2025-02-06 02:37:22,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:22,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:22,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-02-06 02:37:22,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-02-06 02:37:22,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:22,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:22,995 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:37:22,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:22,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083425548] [2025-02-06 02:37:22,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083425548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:22,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:22,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:37:22,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581452315] [2025-02-06 02:37:23,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:23,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:37:23,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:23,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:37:23,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:37:23,002 INFO L87 Difference]: Start difference. First operand 5942 states and 9507 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:23,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:23,842 INFO L93 Difference]: Finished difference Result 19122 states and 30501 transitions. [2025-02-06 02:37:23,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:37:23,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 468 [2025-02-06 02:37:23,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:23,916 INFO L225 Difference]: With dead ends: 19122 [2025-02-06 02:37:23,916 INFO L226 Difference]: Without dead ends: 13320 [2025-02-06 02:37:23,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:37:23,939 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 1416 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:23,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 1580 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:37:23,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13320 states. [2025-02-06 02:37:24,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13320 to 8018. [2025-02-06 02:37:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8018 states, 6590 states have (on average 1.512443095599393) internal successors, (9967), 6598 states have internal predecessors, (9967), 1393 states have call successors, (1393), 34 states have call predecessors, (1393), 34 states have return successors, (1393), 1385 states have call predecessors, (1393), 1393 states have call successors, (1393) [2025-02-06 02:37:24,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8018 states to 8018 states and 12753 transitions. [2025-02-06 02:37:24,500 INFO L78 Accepts]: Start accepts. Automaton has 8018 states and 12753 transitions. Word has length 468 [2025-02-06 02:37:24,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:24,501 INFO L471 AbstractCegarLoop]: Abstraction has 8018 states and 12753 transitions. [2025-02-06 02:37:24,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:24,502 INFO L276 IsEmpty]: Start isEmpty. Operand 8018 states and 12753 transitions. [2025-02-06 02:37:24,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-02-06 02:37:24,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:24,515 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:37:24,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:37:24,516 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:24,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:24,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1553231764, now seen corresponding path program 1 times [2025-02-06 02:37:24,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:24,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720433393] [2025-02-06 02:37:24,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:24,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:24,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-02-06 02:37:24,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-02-06 02:37:24,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:24,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:37:25,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:25,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720433393] [2025-02-06 02:37:25,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720433393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:25,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:25,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:37:25,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393127303] [2025-02-06 02:37:25,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:25,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:37:25,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:25,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:37:25,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:37:25,200 INFO L87 Difference]: Start difference. First operand 8018 states and 12753 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:25,747 INFO L93 Difference]: Finished difference Result 19786 states and 31489 transitions. [2025-02-06 02:37:25,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:37:25,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 469 [2025-02-06 02:37:25,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:25,803 INFO L225 Difference]: With dead ends: 19786 [2025-02-06 02:37:25,803 INFO L226 Difference]: Without dead ends: 11946 [2025-02-06 02:37:25,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-06 02:37:25,830 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 418 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:25,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1025 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:37:25,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11946 states. [2025-02-06 02:37:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11946 to 11944. [2025-02-06 02:37:26,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11944 states, 9836 states have (on average 1.511285075233835) internal successors, (14865), 9848 states have internal predecessors, (14865), 2057 states have call successors, (2057), 50 states have call predecessors, (2057), 50 states have return successors, (2057), 2045 states have call predecessors, (2057), 2057 states have call successors, (2057) [2025-02-06 02:37:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11944 states to 11944 states and 18979 transitions. [2025-02-06 02:37:26,620 INFO L78 Accepts]: Start accepts. Automaton has 11944 states and 18979 transitions. Word has length 469 [2025-02-06 02:37:26,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:26,621 INFO L471 AbstractCegarLoop]: Abstraction has 11944 states and 18979 transitions. [2025-02-06 02:37:26,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 11944 states and 18979 transitions. [2025-02-06 02:37:26,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-02-06 02:37:26,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:26,641 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:37:26,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:37:26,642 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:26,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:26,642 INFO L85 PathProgramCache]: Analyzing trace with hash 172421108, now seen corresponding path program 1 times [2025-02-06 02:37:26,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:26,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708965900] [2025-02-06 02:37:26,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:26,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:26,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-02-06 02:37:26,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-02-06 02:37:26,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:26,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:37:27,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:27,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708965900] [2025-02-06 02:37:27,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708965900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:27,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:27,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:37:27,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503420859] [2025-02-06 02:37:27,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:27,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:37:27,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:27,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:37:27,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:37:27,173 INFO L87 Difference]: Start difference. First operand 11944 states and 18979 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:28,058 INFO L93 Difference]: Finished difference Result 28294 states and 44913 transitions. [2025-02-06 02:37:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:37:28,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 469 [2025-02-06 02:37:28,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:28,131 INFO L225 Difference]: With dead ends: 28294 [2025-02-06 02:37:28,132 INFO L226 Difference]: Without dead ends: 16564 [2025-02-06 02:37:28,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:37:28,175 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 505 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:28,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 2060 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:37:28,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16564 states. [2025-02-06 02:37:28,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16564 to 11944. [2025-02-06 02:37:28,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11944 states, 9836 states have (on average 1.5100650671004474) internal successors, (14853), 9848 states have internal predecessors, (14853), 2057 states have call successors, (2057), 50 states have call predecessors, (2057), 50 states have return successors, (2057), 2045 states have call predecessors, (2057), 2057 states have call successors, (2057) [2025-02-06 02:37:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11944 states to 11944 states and 18967 transitions. [2025-02-06 02:37:28,830 INFO L78 Accepts]: Start accepts. Automaton has 11944 states and 18967 transitions. Word has length 469 [2025-02-06 02:37:28,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:28,831 INFO L471 AbstractCegarLoop]: Abstraction has 11944 states and 18967 transitions. [2025-02-06 02:37:28,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 11944 states and 18967 transitions. [2025-02-06 02:37:28,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-02-06 02:37:28,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:28,847 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:37:28,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:37:28,848 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:28,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:28,849 INFO L85 PathProgramCache]: Analyzing trace with hash 259689722, now seen corresponding path program 1 times [2025-02-06 02:37:28,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:28,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153112036] [2025-02-06 02:37:28,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:28,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:28,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-02-06 02:37:28,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-02-06 02:37:28,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:28,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:29,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:37:29,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:29,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153112036] [2025-02-06 02:37:29,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153112036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:29,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:29,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:37:29,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863237021] [2025-02-06 02:37:29,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:29,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:37:29,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:29,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:37:29,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:37:29,466 INFO L87 Difference]: Start difference. First operand 11944 states and 18967 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:30,255 INFO L93 Difference]: Finished difference Result 35404 states and 56277 transitions. [2025-02-06 02:37:30,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:37:30,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 470 [2025-02-06 02:37:30,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:30,367 INFO L225 Difference]: With dead ends: 35404 [2025-02-06 02:37:30,367 INFO L226 Difference]: Without dead ends: 23674 [2025-02-06 02:37:30,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-02-06 02:37:30,407 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 520 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:30,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1514 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:37:30,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23674 states. [2025-02-06 02:37:31,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23674 to 12532. [2025-02-06 02:37:31,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12532 states, 10424 states have (on average 1.5123752877973906) internal successors, (15765), 10436 states have internal predecessors, (15765), 2057 states have call successors, (2057), 50 states have call predecessors, (2057), 50 states have return successors, (2057), 2045 states have call predecessors, (2057), 2057 states have call successors, (2057) [2025-02-06 02:37:31,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12532 states to 12532 states and 19879 transitions. [2025-02-06 02:37:31,597 INFO L78 Accepts]: Start accepts. Automaton has 12532 states and 19879 transitions. Word has length 470 [2025-02-06 02:37:31,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:31,599 INFO L471 AbstractCegarLoop]: Abstraction has 12532 states and 19879 transitions. [2025-02-06 02:37:31,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:31,600 INFO L276 IsEmpty]: Start isEmpty. Operand 12532 states and 19879 transitions. [2025-02-06 02:37:31,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-02-06 02:37:31,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:31,616 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:37:31,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:37:31,616 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:31,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:31,617 INFO L85 PathProgramCache]: Analyzing trace with hash 273222523, now seen corresponding path program 1 times [2025-02-06 02:37:31,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:31,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177955804] [2025-02-06 02:37:31,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:31,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:31,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-02-06 02:37:31,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-02-06 02:37:31,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:31,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:37:31,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:31,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177955804] [2025-02-06 02:37:31,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177955804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:31,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:31,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:37:31,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138689139] [2025-02-06 02:37:31,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:31,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:37:31,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:31,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:37:31,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:37:31,855 INFO L87 Difference]: Start difference. First operand 12532 states and 19879 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:32,593 INFO L93 Difference]: Finished difference Result 34640 states and 54924 transitions. [2025-02-06 02:37:32,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:37:32,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 470 [2025-02-06 02:37:32,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:32,693 INFO L225 Difference]: With dead ends: 34640 [2025-02-06 02:37:32,693 INFO L226 Difference]: Without dead ends: 22322 [2025-02-06 02:37:32,727 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-02-06 02:37:32,727 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 412 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:32,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1025 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:37:32,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22322 states. [2025-02-06 02:37:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22322 to 22296. [2025-02-06 02:37:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22296 states, 18699 states have (on average 1.5129151291512914) internal successors, (28290), 18747 states have internal predecessors, (28290), 3497 states have call successors, (3497), 99 states have call predecessors, (3497), 99 states have return successors, (3497), 3449 states have call predecessors, (3497), 3497 states have call successors, (3497) [2025-02-06 02:37:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22296 states to 22296 states and 35284 transitions. [2025-02-06 02:37:33,843 INFO L78 Accepts]: Start accepts. Automaton has 22296 states and 35284 transitions. Word has length 470 [2025-02-06 02:37:33,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:33,844 INFO L471 AbstractCegarLoop]: Abstraction has 22296 states and 35284 transitions. [2025-02-06 02:37:33,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:33,845 INFO L276 IsEmpty]: Start isEmpty. Operand 22296 states and 35284 transitions. [2025-02-06 02:37:33,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-02-06 02:37:33,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:33,866 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:37:33,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:37:33,867 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:33,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:33,868 INFO L85 PathProgramCache]: Analyzing trace with hash 692739354, now seen corresponding path program 1 times [2025-02-06 02:37:33,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:33,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841331932] [2025-02-06 02:37:33,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:33,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:33,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-02-06 02:37:33,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-02-06 02:37:33,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:33,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:37:34,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:34,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841331932] [2025-02-06 02:37:34,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841331932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:34,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:34,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:37:34,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102164126] [2025-02-06 02:37:34,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:34,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:37:34,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:34,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:37:34,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:37:34,096 INFO L87 Difference]: Start difference. First operand 22296 states and 35284 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:34,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:34,958 INFO L93 Difference]: Finished difference Result 43980 states and 69510 transitions. [2025-02-06 02:37:34,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:37:34,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 470 [2025-02-06 02:37:34,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:35,059 INFO L225 Difference]: With dead ends: 43980 [2025-02-06 02:37:35,060 INFO L226 Difference]: Without dead ends: 21902 [2025-02-06 02:37:35,108 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-02-06 02:37:35,109 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 407 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:35,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1175 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:37:35,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21902 states. [2025-02-06 02:37:35,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21902 to 12656. [2025-02-06 02:37:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12656 states, 10523 states have (on average 1.5007127245082201) internal successors, (15792), 10535 states have internal predecessors, (15792), 2057 states have call successors, (2057), 75 states have call predecessors, (2057), 75 states have return successors, (2057), 2045 states have call predecessors, (2057), 2057 states have call successors, (2057) [2025-02-06 02:37:35,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12656 states to 12656 states and 19906 transitions. [2025-02-06 02:37:35,948 INFO L78 Accepts]: Start accepts. Automaton has 12656 states and 19906 transitions. Word has length 470 [2025-02-06 02:37:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:35,950 INFO L471 AbstractCegarLoop]: Abstraction has 12656 states and 19906 transitions. [2025-02-06 02:37:35,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:35,950 INFO L276 IsEmpty]: Start isEmpty. Operand 12656 states and 19906 transitions. [2025-02-06 02:37:35,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-02-06 02:37:35,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:35,964 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:37:35,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:37:35,964 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:35,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:35,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1136350777, now seen corresponding path program 1 times [2025-02-06 02:37:35,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:35,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767331097] [2025-02-06 02:37:35,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:35,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:36,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-02-06 02:37:36,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-02-06 02:37:36,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:36,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:37:36,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:36,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767331097] [2025-02-06 02:37:36,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767331097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:36,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:36,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:37:36,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53491776] [2025-02-06 02:37:36,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:36,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:37:36,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:36,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:37:36,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:37:36,851 INFO L87 Difference]: Start difference. First operand 12656 states and 19906 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:38,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:38,834 INFO L93 Difference]: Finished difference Result 45589 states and 71786 transitions. [2025-02-06 02:37:38,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:37:38,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 470 [2025-02-06 02:37:38,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:38,980 INFO L225 Difference]: With dead ends: 45589 [2025-02-06 02:37:38,980 INFO L226 Difference]: Without dead ends: 33151 [2025-02-06 02:37:39,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:37:39,030 INFO L435 NwaCegarLoop]: 985 mSDtfsCounter, 833 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:39,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1823 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:37:39,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33151 states. [2025-02-06 02:37:40,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33151 to 18599. [2025-02-06 02:37:40,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18599 states, 16466 states have (on average 1.5476132636948865) internal successors, (25483), 16478 states have internal predecessors, (25483), 2057 states have call successors, (2057), 75 states have call predecessors, (2057), 75 states have return successors, (2057), 2045 states have call predecessors, (2057), 2057 states have call successors, (2057) [2025-02-06 02:37:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18599 states to 18599 states and 29597 transitions. [2025-02-06 02:37:40,129 INFO L78 Accepts]: Start accepts. Automaton has 18599 states and 29597 transitions. Word has length 470 [2025-02-06 02:37:40,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:40,130 INFO L471 AbstractCegarLoop]: Abstraction has 18599 states and 29597 transitions. [2025-02-06 02:37:40,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:40,130 INFO L276 IsEmpty]: Start isEmpty. Operand 18599 states and 29597 transitions. [2025-02-06 02:37:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-02-06 02:37:40,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:40,150 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:37:40,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:37:40,151 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:40,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:40,151 INFO L85 PathProgramCache]: Analyzing trace with hash -999739440, now seen corresponding path program 1 times [2025-02-06 02:37:40,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:40,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295133484] [2025-02-06 02:37:40,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:40,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:40,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-06 02:37:40,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-06 02:37:40,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:40,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:37:41,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:41,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295133484] [2025-02-06 02:37:41,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295133484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:41,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:41,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:37:41,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104569838] [2025-02-06 02:37:41,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:41,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:37:41,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:41,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:37:41,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:37:41,408 INFO L87 Difference]: Start difference. First operand 18599 states and 29597 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:42,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:42,596 INFO L93 Difference]: Finished difference Result 45092 states and 71781 transitions. [2025-02-06 02:37:42,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:37:42,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 471 [2025-02-06 02:37:42,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:42,695 INFO L225 Difference]: With dead ends: 45092 [2025-02-06 02:37:42,696 INFO L226 Difference]: Without dead ends: 26658 [2025-02-06 02:37:42,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:37:42,748 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 479 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:42,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1926 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:37:42,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26658 states. [2025-02-06 02:37:43,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26658 to 18599. [2025-02-06 02:37:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18599 states, 16466 states have (on average 1.5473703388801165) internal successors, (25479), 16478 states have internal predecessors, (25479), 2057 states have call successors, (2057), 75 states have call predecessors, (2057), 75 states have return successors, (2057), 2045 states have call predecessors, (2057), 2057 states have call successors, (2057) [2025-02-06 02:37:43,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18599 states to 18599 states and 29593 transitions. [2025-02-06 02:37:43,695 INFO L78 Accepts]: Start accepts. Automaton has 18599 states and 29593 transitions. Word has length 471 [2025-02-06 02:37:43,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:43,696 INFO L471 AbstractCegarLoop]: Abstraction has 18599 states and 29593 transitions. [2025-02-06 02:37:43,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:43,697 INFO L276 IsEmpty]: Start isEmpty. Operand 18599 states and 29593 transitions. [2025-02-06 02:37:43,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-02-06 02:37:43,714 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:43,715 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:37:43,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:37:43,716 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:43,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:43,716 INFO L85 PathProgramCache]: Analyzing trace with hash -910272814, now seen corresponding path program 1 times [2025-02-06 02:37:43,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:43,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478137135] [2025-02-06 02:37:43,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:43,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:43,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-02-06 02:37:43,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-02-06 02:37:43,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:43,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:37:44,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:44,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478137135] [2025-02-06 02:37:44,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478137135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:44,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:44,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:37:44,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808592525] [2025-02-06 02:37:44,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:44,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:37:44,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:44,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:37:44,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:37:44,778 INFO L87 Difference]: Start difference. First operand 18599 states and 29593 transitions. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:46,345 INFO L93 Difference]: Finished difference Result 45092 states and 71777 transitions. [2025-02-06 02:37:46,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:37:46,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 472 [2025-02-06 02:37:46,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:46,441 INFO L225 Difference]: With dead ends: 45092 [2025-02-06 02:37:46,441 INFO L226 Difference]: Without dead ends: 26658 [2025-02-06 02:37:46,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:37:46,492 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 447 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:46,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 2393 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:37:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26658 states. [2025-02-06 02:37:47,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26658 to 18599. [2025-02-06 02:37:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18599 states, 16466 states have (on average 1.5466415644358071) internal successors, (25467), 16478 states have internal predecessors, (25467), 2057 states have call successors, (2057), 75 states have call predecessors, (2057), 75 states have return successors, (2057), 2045 states have call predecessors, (2057), 2057 states have call successors, (2057) [2025-02-06 02:37:47,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18599 states to 18599 states and 29581 transitions. [2025-02-06 02:37:47,745 INFO L78 Accepts]: Start accepts. Automaton has 18599 states and 29581 transitions. Word has length 472 [2025-02-06 02:37:47,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:47,746 INFO L471 AbstractCegarLoop]: Abstraction has 18599 states and 29581 transitions. [2025-02-06 02:37:47,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:47,746 INFO L276 IsEmpty]: Start isEmpty. Operand 18599 states and 29581 transitions. [2025-02-06 02:37:47,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-02-06 02:37:47,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:47,762 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:37:47,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:37:47,763 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:47,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:47,763 INFO L85 PathProgramCache]: Analyzing trace with hash -231927723, now seen corresponding path program 1 times [2025-02-06 02:37:47,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:47,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992137497] [2025-02-06 02:37:47,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:47,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:47,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-02-06 02:37:47,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-02-06 02:37:47,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:47,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:37:48,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:48,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992137497] [2025-02-06 02:37:48,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992137497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:48,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:48,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:37:48,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407876316] [2025-02-06 02:37:48,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:48,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:37:48,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:48,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:37:48,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:37:48,543 INFO L87 Difference]: Start difference. First operand 18599 states and 29581 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:49,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:49,815 INFO L93 Difference]: Finished difference Result 45092 states and 71761 transitions. [2025-02-06 02:37:49,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:37:49,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 473 [2025-02-06 02:37:49,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:49,915 INFO L225 Difference]: With dead ends: 45092 [2025-02-06 02:37:49,915 INFO L226 Difference]: Without dead ends: 26658 [2025-02-06 02:37:49,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:37:49,954 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 441 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:49,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1884 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:37:49,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26658 states. [2025-02-06 02:37:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26658 to 18599. [2025-02-06 02:37:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18599 states, 16466 states have (on average 1.5463986396210372) internal successors, (25463), 16478 states have internal predecessors, (25463), 2057 states have call successors, (2057), 75 states have call predecessors, (2057), 75 states have return successors, (2057), 2045 states have call predecessors, (2057), 2057 states have call successors, (2057) [2025-02-06 02:37:51,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18599 states to 18599 states and 29577 transitions. [2025-02-06 02:37:51,105 INFO L78 Accepts]: Start accepts. Automaton has 18599 states and 29577 transitions. Word has length 473 [2025-02-06 02:37:51,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:51,110 INFO L471 AbstractCegarLoop]: Abstraction has 18599 states and 29577 transitions. [2025-02-06 02:37:51,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:51,110 INFO L276 IsEmpty]: Start isEmpty. Operand 18599 states and 29577 transitions. [2025-02-06 02:37:51,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-02-06 02:37:51,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:51,131 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:37:51,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:37:51,131 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:51,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:51,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1208784494, now seen corresponding path program 1 times [2025-02-06 02:37:51,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:51,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610731341] [2025-02-06 02:37:51,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:51,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:51,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-02-06 02:37:51,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-02-06 02:37:51,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:51,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:37:53,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:53,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610731341] [2025-02-06 02:37:53,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610731341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:53,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:53,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:37:53,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367307565] [2025-02-06 02:37:53,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:53,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:37:53,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:53,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:37:53,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:37:53,292 INFO L87 Difference]: Start difference. First operand 18599 states and 29577 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:57,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:57,336 INFO L93 Difference]: Finished difference Result 96347 states and 153207 transitions. [2025-02-06 02:37:57,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:37:57,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 474 [2025-02-06 02:37:57,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:57,547 INFO L225 Difference]: With dead ends: 96347 [2025-02-06 02:37:57,547 INFO L226 Difference]: Without dead ends: 78061 [2025-02-06 02:37:57,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:37:57,607 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 2206 mSDsluCounter, 1963 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2206 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:57,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2206 Valid, 2617 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 02:37:57,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78061 states. [2025-02-06 02:37:59,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78061 to 61183. [2025-02-06 02:37:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61183 states, 57826 states have (on average 1.5920693113824231) internal successors, (92063), 57910 states have internal predecessors, (92063), 3209 states have call successors, (3209), 147 states have call predecessors, (3209), 147 states have return successors, (3209), 3125 states have call predecessors, (3209), 3209 states have call successors, (3209) [2025-02-06 02:37:59,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61183 states to 61183 states and 98481 transitions. [2025-02-06 02:37:59,634 INFO L78 Accepts]: Start accepts. Automaton has 61183 states and 98481 transitions. Word has length 474 [2025-02-06 02:37:59,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:59,635 INFO L471 AbstractCegarLoop]: Abstraction has 61183 states and 98481 transitions. [2025-02-06 02:37:59,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:37:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand 61183 states and 98481 transitions. [2025-02-06 02:37:59,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-02-06 02:37:59,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:59,676 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:37:59,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 02:37:59,676 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:59,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:59,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1135882547, now seen corresponding path program 1 times [2025-02-06 02:37:59,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:59,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747540692] [2025-02-06 02:37:59,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:59,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:59,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-02-06 02:38:00,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-02-06 02:38:00,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:00,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:03,602 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:38:03,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:03,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747540692] [2025-02-06 02:38:03,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747540692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:03,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:03,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:38:03,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248716543] [2025-02-06 02:38:03,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:03,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:38:03,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:03,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:38:03,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:38:03,605 INFO L87 Difference]: Start difference. First operand 61183 states and 98481 transitions. Second operand has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:38:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:07,529 INFO L93 Difference]: Finished difference Result 154795 states and 249335 transitions. [2025-02-06 02:38:07,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:38:07,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 474 [2025-02-06 02:38:07,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:07,725 INFO L225 Difference]: With dead ends: 154795 [2025-02-06 02:38:07,725 INFO L226 Difference]: Without dead ends: 93925 [2025-02-06 02:38:07,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:38:07,833 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 964 mSDsluCounter, 2550 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:07,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 3050 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 02:38:07,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93925 states. [2025-02-06 02:38:09,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93925 to 79103. [2025-02-06 02:38:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79103 states, 75746 states have (on average 1.6244686188049533) internal successors, (123047), 75830 states have internal predecessors, (123047), 3209 states have call successors, (3209), 147 states have call predecessors, (3209), 147 states have return successors, (3209), 3125 states have call predecessors, (3209), 3209 states have call successors, (3209) [2025-02-06 02:38:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79103 states to 79103 states and 129465 transitions. [2025-02-06 02:38:10,054 INFO L78 Accepts]: Start accepts. Automaton has 79103 states and 129465 transitions. Word has length 474 [2025-02-06 02:38:10,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:10,055 INFO L471 AbstractCegarLoop]: Abstraction has 79103 states and 129465 transitions. [2025-02-06 02:38:10,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:38:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 79103 states and 129465 transitions. [2025-02-06 02:38:10,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-02-06 02:38:10,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:10,105 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:38:10,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 02:38:10,105 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:10,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:10,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1602674465, now seen corresponding path program 1 times [2025-02-06 02:38:10,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:10,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760762479] [2025-02-06 02:38:10,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:10,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:10,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-02-06 02:38:10,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-02-06 02:38:10,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:10,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat