./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-58.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 a41aa9d8768b1b5dd89ea1dccd189b98246dddc52870a67830fa0c3c6660983c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:36:09,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:36:09,373 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:36:09,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:36:09,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:36:09,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:36:09,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:36:09,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:36:09,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:36:09,405 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:36:09,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:36:09,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:36:09,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:36:09,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:36:09,407 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:36:09,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:36:09,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:36:09,407 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:36:09,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:36:09,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:36:09,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:36:09,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:36:09,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:36:09,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:36:09,408 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:36:09,408 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:36:09,408 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:36:09,408 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:36:09,408 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:36:09,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:36:09,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:36:09,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:36:09,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:36:09,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:36:09,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:36:09,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:36:09,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:36:09,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:36:09,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:36:09,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:36:09,409 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:36:09,409 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:36:09,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:36:09,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:36:09,409 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:36:09,409 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:36:09,409 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:36:09,409 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:36:09,409 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 -> a41aa9d8768b1b5dd89ea1dccd189b98246dddc52870a67830fa0c3c6660983c [2025-01-09 15:36:09,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:36:09,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:36:09,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:36:09,651 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:36:09,652 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:36:09,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-58.i [2025-01-09 15:36:10,817 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e327420fb/4a3fe16c3fd64b6f924f68ddaf69a06c/FLAGa8fb04974 [2025-01-09 15:36:11,085 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:36:11,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-58.i [2025-01-09 15:36:11,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e327420fb/4a3fe16c3fd64b6f924f68ddaf69a06c/FLAGa8fb04974 [2025-01-09 15:36:11,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e327420fb/4a3fe16c3fd64b6f924f68ddaf69a06c [2025-01-09 15:36:11,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:36:11,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:36:11,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:36:11,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:36:11,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:36:11,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:36:11" (1/1) ... [2025-01-09 15:36:11,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2b9dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:36:11, skipping insertion in model container [2025-01-09 15:36:11,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:36:11" (1/1) ... [2025-01-09 15:36:11,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:36:11,229 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_variablewrapping_wrapper-ap_file-58.i[917,930] [2025-01-09 15:36:11,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:36:11,311 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:36:11,321 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_variablewrapping_wrapper-ap_file-58.i[917,930] [2025-01-09 15:36:11,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:36:11,378 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:36:11,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:36:11 WrapperNode [2025-01-09 15:36:11,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:36:11,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:36:11,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:36:11,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:36:11,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:36:11" (1/1) ... [2025-01-09 15:36:11,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:36:11" (1/1) ... [2025-01-09 15:36:11,439 INFO L138 Inliner]: procedures = 26, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 452 [2025-01-09 15:36:11,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:36:11,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:36:11,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:36:11,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:36:11,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:36:11" (1/1) ... [2025-01-09 15:36:11,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:36:11" (1/1) ... [2025-01-09 15:36:11,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:36:11" (1/1) ... [2025-01-09 15:36:11,487 INFO L175 MemorySlicer]: Split 125 memory accesses to 6 slices as follows [2, 6, 11, 7, 74, 25]. 59 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 6, 2]. The 15 writes are split as follows [0, 1, 1, 3, 8, 2]. [2025-01-09 15:36:11,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:36:11" (1/1) ... [2025-01-09 15:36:11,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:36:11" (1/1) ... [2025-01-09 15:36:11,502 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:36:11" (1/1) ... [2025-01-09 15:36:11,504 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:36:11" (1/1) ... [2025-01-09 15:36:11,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:36:11" (1/1) ... [2025-01-09 15:36:11,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:36:11" (1/1) ... [2025-01-09 15:36:11,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:36:11" (1/1) ... [2025-01-09 15:36:11,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:36:11,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:36:11,514 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:36:11,514 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:36:11,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:36:11" (1/1) ... [2025-01-09 15:36:11,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:36:11,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:36:11,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:36:11,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:36:11,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:36:11,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:36:11,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:36:11,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:36:11,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:36:11,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:36:11,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:36:11,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:36:11,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:36:11,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:36:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:36:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:36:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:36:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:36:11,561 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:36:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:36:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:36:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:36:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:36:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:36:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:36:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:36:11,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:36:11,657 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:36:11,659 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:36:12,026 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-01-09 15:36:12,026 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:36:12,034 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:36:12,035 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:36:12,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:36:12 BoogieIcfgContainer [2025-01-09 15:36:12,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:36:12,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:36:12,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:36:12,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:36:12,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:36:11" (1/3) ... [2025-01-09 15:36:12,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46205c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:36:12, skipping insertion in model container [2025-01-09 15:36:12,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:36:11" (2/3) ... [2025-01-09 15:36:12,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46205c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:36:12, skipping insertion in model container [2025-01-09 15:36:12,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:36:12" (3/3) ... [2025-01-09 15:36:12,042 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-58.i [2025-01-09 15:36:12,053 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:36:12,054 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-58.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:36:12,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:36:12,107 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;@262163c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:36:12,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:36:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:36:12,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:36:12,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:12,120 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:12,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:12,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:12,125 INFO L85 PathProgramCache]: Analyzing trace with hash -908927882, now seen corresponding path program 1 times [2025-01-09 15:36:12,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:12,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915801508] [2025-01-09 15:36:12,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:12,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:12,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:36:12,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:36:12,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:12,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 15:36:12,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:12,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915801508] [2025-01-09 15:36:12,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915801508] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:36:12,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410627868] [2025-01-09 15:36:12,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:12,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:36:12,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:36:12,377 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:36:12,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:36:12,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:36:12,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:36:12,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:12,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:12,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:36:12,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:36:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 15:36:12,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:36:12,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410627868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:12,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:36:12,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:36:12,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104004672] [2025-01-09 15:36:12,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:12,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:36:12,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:12,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:36:12,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:36:12,625 INFO L87 Difference]: Start difference. First operand has 91 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:36:12,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:12,642 INFO L93 Difference]: Finished difference Result 172 states and 266 transitions. [2025-01-09 15:36:12,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:36:12,643 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2025-01-09 15:36:12,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:12,647 INFO L225 Difference]: With dead ends: 172 [2025-01-09 15:36:12,648 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 15:36:12,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:36:12,652 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:12,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:36:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 15:36:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-09 15:36:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:36:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2025-01-09 15:36:12,679 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 116 [2025-01-09 15:36:12,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:12,679 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2025-01-09 15:36:12,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:36:12,680 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2025-01-09 15:36:12,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:36:12,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:12,683 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:12,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:36:12,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:36:12,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:12,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:12,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1393763052, now seen corresponding path program 1 times [2025-01-09 15:36:12,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:12,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236848196] [2025-01-09 15:36:12,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:12,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:12,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:36:12,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:36:12,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:12,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:36:13,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:13,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236848196] [2025-01-09 15:36:13,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236848196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:13,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:13,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:36:13,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126722823] [2025-01-09 15:36:13,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:13,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:36:13,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:13,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:36:13,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:36:13,217 INFO L87 Difference]: Start difference. First operand 84 states and 118 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:36:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:13,250 INFO L93 Difference]: Finished difference Result 168 states and 237 transitions. [2025-01-09 15:36:13,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:36:13,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2025-01-09 15:36:13,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:13,254 INFO L225 Difference]: With dead ends: 168 [2025-01-09 15:36:13,256 INFO L226 Difference]: Without dead ends: 87 [2025-01-09 15:36:13,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:36:13,257 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:13,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 336 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:36:13,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-09 15:36:13,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2025-01-09 15:36:13,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:36:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2025-01-09 15:36:13,271 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 120 transitions. Word has length 116 [2025-01-09 15:36:13,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:13,272 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 120 transitions. [2025-01-09 15:36:13,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:36:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2025-01-09 15:36:13,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:36:13,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:13,275 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:13,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:36:13,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:13,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:13,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1391916010, now seen corresponding path program 1 times [2025-01-09 15:36:13,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:13,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032862034] [2025-01-09 15:36:13,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:13,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:13,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:36:13,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:36:13,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:13,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:14,650 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:36:14,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:14,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032862034] [2025-01-09 15:36:14,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032862034] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:14,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:14,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:36:14,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626635950] [2025-01-09 15:36:14,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:14,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:36:14,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:14,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:36:14,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:36:14,652 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 15:36:15,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:15,170 INFO L93 Difference]: Finished difference Result 228 states and 317 transitions. [2025-01-09 15:36:15,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:36:15,171 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 116 [2025-01-09 15:36:15,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:15,173 INFO L225 Difference]: With dead ends: 228 [2025-01-09 15:36:15,175 INFO L226 Difference]: Without dead ends: 145 [2025-01-09 15:36:15,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:36:15,176 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 339 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:15,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 457 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:36:15,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-01-09 15:36:15,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2025-01-09 15:36:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 119 states have (on average 1.319327731092437) internal successors, (157), 120 states have internal predecessors, (157), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:36:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 197 transitions. [2025-01-09 15:36:15,198 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 197 transitions. Word has length 116 [2025-01-09 15:36:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:15,198 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 197 transitions. [2025-01-09 15:36:15,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 15:36:15,199 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 197 transitions. [2025-01-09 15:36:15,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:36:15,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:15,200 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:15,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:36:15,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:15,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:15,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1133750572, now seen corresponding path program 1 times [2025-01-09 15:36:15,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:15,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510210299] [2025-01-09 15:36:15,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:15,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:15,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:36:15,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:36:15,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:15,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:36:16,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:16,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510210299] [2025-01-09 15:36:16,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510210299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:16,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:16,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:36:16,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329441833] [2025-01-09 15:36:16,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:16,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:36:16,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:16,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:36:16,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:36:16,575 INFO L87 Difference]: Start difference. First operand 142 states and 197 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 15:36:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:17,254 INFO L93 Difference]: Finished difference Result 307 states and 424 transitions. [2025-01-09 15:36:17,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:36:17,254 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 116 [2025-01-09 15:36:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:17,257 INFO L225 Difference]: With dead ends: 307 [2025-01-09 15:36:17,257 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 15:36:17,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:36:17,258 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 351 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:17,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 354 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:36:17,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 15:36:17,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 141. [2025-01-09 15:36:17,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 119 states have internal predecessors, (155), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:36:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 195 transitions. [2025-01-09 15:36:17,288 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 195 transitions. Word has length 116 [2025-01-09 15:36:17,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:17,288 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 195 transitions. [2025-01-09 15:36:17,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 15:36:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 195 transitions. [2025-01-09 15:36:17,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:36:17,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:17,293 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:17,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:36:17,293 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:17,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:17,293 INFO L85 PathProgramCache]: Analyzing trace with hash -920340371, now seen corresponding path program 1 times [2025-01-09 15:36:17,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:17,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84762420] [2025-01-09 15:36:17,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:17,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:17,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:36:17,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:36:17,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:17,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:17,528 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:36:17,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:17,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84762420] [2025-01-09 15:36:17,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84762420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:17,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:17,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:36:17,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576414717] [2025-01-09 15:36:17,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:17,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:36:17,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:17,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:36:17,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:36:17,531 INFO L87 Difference]: Start difference. First operand 141 states and 195 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:36:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:17,697 INFO L93 Difference]: Finished difference Result 360 states and 497 transitions. [2025-01-09 15:36:17,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:36:17,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2025-01-09 15:36:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:17,702 INFO L225 Difference]: With dead ends: 360 [2025-01-09 15:36:17,702 INFO L226 Difference]: Without dead ends: 222 [2025-01-09 15:36:17,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:36:17,703 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 92 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:17,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 500 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:36:17,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-01-09 15:36:17,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2025-01-09 15:36:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 176 states have (on average 1.2784090909090908) internal successors, (225), 179 states have internal predecessors, (225), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:36:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 301 transitions. [2025-01-09 15:36:17,745 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 301 transitions. Word has length 116 [2025-01-09 15:36:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:17,746 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 301 transitions. [2025-01-09 15:36:17,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:36:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 301 transitions. [2025-01-09 15:36:17,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:36:17,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:17,747 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:17,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:36:17,748 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:17,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:17,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1314703384, now seen corresponding path program 1 times [2025-01-09 15:36:17,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:17,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005869698] [2025-01-09 15:36:17,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:17,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:17,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:36:17,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:36:17,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:17,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:18,903 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:36:18,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:18,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005869698] [2025-01-09 15:36:18,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005869698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:18,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:18,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:36:18,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026502201] [2025-01-09 15:36:18,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:18,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:36:18,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:18,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:36:18,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:36:18,905 INFO L87 Difference]: Start difference. First operand 219 states and 301 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 15:36:19,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:19,584 INFO L93 Difference]: Finished difference Result 427 states and 585 transitions. [2025-01-09 15:36:19,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:36:19,585 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 116 [2025-01-09 15:36:19,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:19,586 INFO L225 Difference]: With dead ends: 427 [2025-01-09 15:36:19,587 INFO L226 Difference]: Without dead ends: 226 [2025-01-09 15:36:19,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:36:19,587 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 267 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:19,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 513 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:36:19,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-01-09 15:36:19,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 186. [2025-01-09 15:36:19,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 148 states have (on average 1.2635135135135136) internal successors, (187), 150 states have internal predecessors, (187), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 15:36:19,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 253 transitions. [2025-01-09 15:36:19,623 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 253 transitions. Word has length 116 [2025-01-09 15:36:19,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:19,624 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 253 transitions. [2025-01-09 15:36:19,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 15:36:19,624 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 253 transitions. [2025-01-09 15:36:19,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:36:19,625 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:19,625 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:19,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:36:19,626 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:19,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1572868822, now seen corresponding path program 1 times [2025-01-09 15:36:19,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:19,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268725900] [2025-01-09 15:36:19,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:19,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:19,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:36:19,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:36:19,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:19,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:36:20,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:20,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268725900] [2025-01-09 15:36:20,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268725900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:20,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:20,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:36:20,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523410012] [2025-01-09 15:36:20,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:20,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:36:20,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:20,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:36:20,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:36:20,489 INFO L87 Difference]: Start difference. First operand 186 states and 253 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:36:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:21,068 INFO L93 Difference]: Finished difference Result 394 states and 536 transitions. [2025-01-09 15:36:21,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:36:21,070 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 116 [2025-01-09 15:36:21,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:21,071 INFO L225 Difference]: With dead ends: 394 [2025-01-09 15:36:21,071 INFO L226 Difference]: Without dead ends: 226 [2025-01-09 15:36:21,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:36:21,072 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 212 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:21,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 698 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:36:21,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-01-09 15:36:21,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 183. [2025-01-09 15:36:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 145 states have (on average 1.2620689655172415) internal successors, (183), 147 states have internal predecessors, (183), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 15:36:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 249 transitions. [2025-01-09 15:36:21,102 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 249 transitions. Word has length 116 [2025-01-09 15:36:21,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:21,102 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 249 transitions. [2025-01-09 15:36:21,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:36:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 249 transitions. [2025-01-09 15:36:21,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:36:21,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:21,103 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:21,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:36:21,104 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:21,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:21,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1865089623, now seen corresponding path program 1 times [2025-01-09 15:36:21,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:21,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168904728] [2025-01-09 15:36:21,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:21,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:21,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:36:21,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:36:21,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:21,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:36:21,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:21,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168904728] [2025-01-09 15:36:21,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168904728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:21,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:21,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:36:21,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275540916] [2025-01-09 15:36:21,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:21,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:36:21,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:21,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:36:21,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:36:21,278 INFO L87 Difference]: Start difference. First operand 183 states and 249 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:36:21,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:21,433 INFO L93 Difference]: Finished difference Result 353 states and 478 transitions. [2025-01-09 15:36:21,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:36:21,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2025-01-09 15:36:21,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:21,435 INFO L225 Difference]: With dead ends: 353 [2025-01-09 15:36:21,435 INFO L226 Difference]: Without dead ends: 188 [2025-01-09 15:36:21,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:36:21,436 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 94 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:21,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 439 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:36:21,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-09 15:36:21,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2025-01-09 15:36:21,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 146 states have (on average 1.2465753424657535) internal successors, (182), 148 states have internal predecessors, (182), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 15:36:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 248 transitions. [2025-01-09 15:36:21,473 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 248 transitions. Word has length 117 [2025-01-09 15:36:21,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:21,473 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 248 transitions. [2025-01-09 15:36:21,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:36:21,474 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 248 transitions. [2025-01-09 15:36:21,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:36:21,475 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:21,475 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:21,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:36:21,475 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:21,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:21,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1393513984, now seen corresponding path program 1 times [2025-01-09 15:36:21,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:21,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005687401] [2025-01-09 15:36:21,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:21,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:21,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:36:21,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:36:21,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:21,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:22,187 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:36:22,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:22,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005687401] [2025-01-09 15:36:22,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005687401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:22,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:22,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:36:22,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283284312] [2025-01-09 15:36:22,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:22,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:36:22,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:22,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:36:22,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:36:22,189 INFO L87 Difference]: Start difference. First operand 185 states and 248 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 15:36:22,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:22,802 INFO L93 Difference]: Finished difference Result 407 states and 547 transitions. [2025-01-09 15:36:22,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:36:22,803 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 117 [2025-01-09 15:36:22,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:22,804 INFO L225 Difference]: With dead ends: 407 [2025-01-09 15:36:22,805 INFO L226 Difference]: Without dead ends: 240 [2025-01-09 15:36:22,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:36:22,805 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 260 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:22,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 399 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:36:22,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-01-09 15:36:22,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 222. [2025-01-09 15:36:22,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 183 states have (on average 1.273224043715847) internal successors, (233), 185 states have internal predecessors, (233), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 15:36:22,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 299 transitions. [2025-01-09 15:36:22,840 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 299 transitions. Word has length 117 [2025-01-09 15:36:22,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:22,840 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 299 transitions. [2025-01-09 15:36:22,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 15:36:22,841 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 299 transitions. [2025-01-09 15:36:22,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:36:22,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:22,842 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:22,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:36:22,842 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:22,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:22,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1135348546, now seen corresponding path program 1 times [2025-01-09 15:36:22,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:22,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511219741] [2025-01-09 15:36:22,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:22,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:22,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:36:22,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:36:22,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:22,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:36:23,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:23,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511219741] [2025-01-09 15:36:23,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511219741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:23,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:23,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:36:23,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496598908] [2025-01-09 15:36:23,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:23,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:36:23,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:23,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:36:23,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:36:23,321 INFO L87 Difference]: Start difference. First operand 222 states and 299 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:36:23,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:23,839 INFO L93 Difference]: Finished difference Result 459 states and 616 transitions. [2025-01-09 15:36:23,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:36:23,839 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2025-01-09 15:36:23,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:23,841 INFO L225 Difference]: With dead ends: 459 [2025-01-09 15:36:23,843 INFO L226 Difference]: Without dead ends: 240 [2025-01-09 15:36:23,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:36:23,844 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 137 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:23,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 821 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:36:23,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-01-09 15:36:23,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 222. [2025-01-09 15:36:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 183 states have (on average 1.2677595628415301) internal successors, (232), 185 states have internal predecessors, (232), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 15:36:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 298 transitions. [2025-01-09 15:36:23,884 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 298 transitions. Word has length 117 [2025-01-09 15:36:23,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:23,884 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 298 transitions. [2025-01-09 15:36:23,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:36:23,885 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 298 transitions. [2025-01-09 15:36:23,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:36:23,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:23,885 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:23,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:36:23,886 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:23,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:23,886 INFO L85 PathProgramCache]: Analyzing trace with hash 600630722, now seen corresponding path program 1 times [2025-01-09 15:36:23,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:23,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416296718] [2025-01-09 15:36:23,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:23,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:23,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:36:23,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:36:23,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:23,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:36:24,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:24,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416296718] [2025-01-09 15:36:24,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416296718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:24,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:24,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:36:24,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443013214] [2025-01-09 15:36:24,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:24,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:36:24,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:24,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:36:24,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:36:24,370 INFO L87 Difference]: Start difference. First operand 222 states and 298 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:36:24,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:24,967 INFO L93 Difference]: Finished difference Result 451 states and 602 transitions. [2025-01-09 15:36:24,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:36:24,967 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2025-01-09 15:36:24,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:24,969 INFO L225 Difference]: With dead ends: 451 [2025-01-09 15:36:24,969 INFO L226 Difference]: Without dead ends: 232 [2025-01-09 15:36:24,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:36:24,970 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 154 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:24,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 720 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:36:24,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-01-09 15:36:24,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 130. [2025-01-09 15:36:24,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 111 states have (on average 1.2792792792792793) internal successors, (142), 111 states have internal predecessors, (142), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:36:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 172 transitions. [2025-01-09 15:36:24,995 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 172 transitions. Word has length 117 [2025-01-09 15:36:24,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:24,995 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 172 transitions. [2025-01-09 15:36:24,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:36:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 172 transitions. [2025-01-09 15:36:24,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:36:24,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:24,998 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:24,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:36:24,998 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:24,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:24,999 INFO L85 PathProgramCache]: Analyzing trace with hash 858796160, now seen corresponding path program 1 times [2025-01-09 15:36:24,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:25,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016363689] [2025-01-09 15:36:25,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:25,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:25,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:36:25,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:36:25,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:25,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:25,577 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:36:25,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:25,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016363689] [2025-01-09 15:36:25,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016363689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:25,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:25,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:36:25,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448845862] [2025-01-09 15:36:25,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:25,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:36:25,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:25,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:36:25,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:36:25,579 INFO L87 Difference]: Start difference. First operand 130 states and 172 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 15:36:26,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:26,137 INFO L93 Difference]: Finished difference Result 297 states and 392 transitions. [2025-01-09 15:36:26,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:36:26,138 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 117 [2025-01-09 15:36:26,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:26,140 INFO L225 Difference]: With dead ends: 297 [2025-01-09 15:36:26,140 INFO L226 Difference]: Without dead ends: 170 [2025-01-09 15:36:26,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:36:26,141 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 152 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:26,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 394 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:36:26,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-09 15:36:26,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 127. [2025-01-09 15:36:26,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.2685185185185186) internal successors, (137), 108 states have internal predecessors, (137), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:36:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 167 transitions. [2025-01-09 15:36:26,157 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 167 transitions. Word has length 117 [2025-01-09 15:36:26,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:26,158 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 167 transitions. [2025-01-09 15:36:26,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 15:36:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 167 transitions. [2025-01-09 15:36:26,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 15:36:26,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:26,161 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:26,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:36:26,162 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:26,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash -462948857, now seen corresponding path program 1 times [2025-01-09 15:36:26,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:26,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086390669] [2025-01-09 15:36:26,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:26,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:26,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 15:36:26,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 15:36:26,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:26,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:36:26,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:26,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086390669] [2025-01-09 15:36:26,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086390669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:26,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:26,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:36:26,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644295596] [2025-01-09 15:36:26,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:26,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:36:26,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:26,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:36:26,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:36:26,402 INFO L87 Difference]: Start difference. First operand 127 states and 167 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:36:26,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:26,570 INFO L93 Difference]: Finished difference Result 310 states and 403 transitions. [2025-01-09 15:36:26,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:36:26,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 118 [2025-01-09 15:36:26,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:26,572 INFO L225 Difference]: With dead ends: 310 [2025-01-09 15:36:26,572 INFO L226 Difference]: Without dead ends: 186 [2025-01-09 15:36:26,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:36:26,573 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 57 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:26,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 555 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:36:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-01-09 15:36:26,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 147. [2025-01-09 15:36:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 128 states have (on average 1.234375) internal successors, (158), 128 states have internal predecessors, (158), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:36:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 188 transitions. [2025-01-09 15:36:26,595 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 188 transitions. Word has length 118 [2025-01-09 15:36:26,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:26,596 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 188 transitions. [2025-01-09 15:36:26,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:36:26,596 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 188 transitions. [2025-01-09 15:36:26,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:36:26,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:26,597 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:26,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:36:26,597 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:26,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1652607263, now seen corresponding path program 1 times [2025-01-09 15:36:26,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:26,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627446296] [2025-01-09 15:36:26,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:26,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:26,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:36:26,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:36:26,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:26,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:36:27,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:27,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627446296] [2025-01-09 15:36:27,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627446296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:27,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:27,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:36:27,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574270496] [2025-01-09 15:36:27,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:27,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:36:27,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:27,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:36:27,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:36:27,253 INFO L87 Difference]: Start difference. First operand 147 states and 188 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:36:28,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:28,122 INFO L93 Difference]: Finished difference Result 361 states and 460 transitions. [2025-01-09 15:36:28,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:36:28,123 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2025-01-09 15:36:28,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:28,124 INFO L225 Difference]: With dead ends: 361 [2025-01-09 15:36:28,124 INFO L226 Difference]: Without dead ends: 217 [2025-01-09 15:36:28,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:36:28,125 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 127 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:28,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 576 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:36:28,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-09 15:36:28,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 177. [2025-01-09 15:36:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 155 states have (on average 1.238709677419355) internal successors, (192), 156 states have internal predecessors, (192), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:36:28,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 226 transitions. [2025-01-09 15:36:28,153 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 226 transitions. Word has length 119 [2025-01-09 15:36:28,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:28,153 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 226 transitions. [2025-01-09 15:36:28,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:36:28,153 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 226 transitions. [2025-01-09 15:36:28,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 15:36:28,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:28,154 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:28,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:36:28,155 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:28,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:28,155 INFO L85 PathProgramCache]: Analyzing trace with hash 208696864, now seen corresponding path program 1 times [2025-01-09 15:36:28,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:28,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799762471] [2025-01-09 15:36:28,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:28,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:28,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 15:36:28,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 15:36:28,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:28,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:28,962 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:36:28,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:28,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799762471] [2025-01-09 15:36:28,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799762471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:28,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:28,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:36:28,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959037915] [2025-01-09 15:36:28,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:28,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:36:28,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:28,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:36:28,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:36:28,965 INFO L87 Difference]: Start difference. First operand 177 states and 226 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:36:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:29,392 INFO L93 Difference]: Finished difference Result 205 states and 258 transitions. [2025-01-09 15:36:29,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:36:29,393 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 120 [2025-01-09 15:36:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:29,395 INFO L225 Difference]: With dead ends: 205 [2025-01-09 15:36:29,395 INFO L226 Difference]: Without dead ends: 203 [2025-01-09 15:36:29,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:36:29,396 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 161 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:29,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 474 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:36:29,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-01-09 15:36:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2025-01-09 15:36:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 173 states have (on average 1.2138728323699421) internal successors, (210), 175 states have internal predecessors, (210), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:36:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 254 transitions. [2025-01-09 15:36:29,431 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 254 transitions. Word has length 120 [2025-01-09 15:36:29,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:29,433 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 254 transitions. [2025-01-09 15:36:29,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:36:29,434 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 254 transitions. [2025-01-09 15:36:29,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 15:36:29,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:29,434 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:29,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:36:29,435 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:29,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:29,435 INFO L85 PathProgramCache]: Analyzing trace with hash 210543906, now seen corresponding path program 1 times [2025-01-09 15:36:29,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:29,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881453555] [2025-01-09 15:36:29,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:29,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:29,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 15:36:29,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 15:36:29,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:29,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:36:31,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:31,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881453555] [2025-01-09 15:36:31,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881453555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:31,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:31,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 15:36:31,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825316877] [2025-01-09 15:36:31,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:31,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 15:36:31,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:31,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 15:36:31,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:36:31,253 INFO L87 Difference]: Start difference. First operand 202 states and 254 transitions. Second operand has 19 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 15:36:40,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:36:41,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:41,702 INFO L93 Difference]: Finished difference Result 737 states and 931 transitions. [2025-01-09 15:36:41,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 15:36:41,702 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 120 [2025-01-09 15:36:41,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:41,705 INFO L225 Difference]: With dead ends: 737 [2025-01-09 15:36:41,705 INFO L226 Difference]: Without dead ends: 557 [2025-01-09 15:36:41,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=305, Invalid=1255, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 15:36:41,708 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 817 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 163 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:41,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 707 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1050 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2025-01-09 15:36:41,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-09 15:36:41,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 452. [2025-01-09 15:36:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 399 states have (on average 1.2155388471177946) internal successors, (485), 405 states have internal predecessors, (485), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 15:36:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 567 transitions. [2025-01-09 15:36:41,783 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 567 transitions. Word has length 120 [2025-01-09 15:36:41,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:41,783 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 567 transitions. [2025-01-09 15:36:41,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 15:36:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 567 transitions. [2025-01-09 15:36:41,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 15:36:41,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:41,785 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:41,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:36:41,785 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:41,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:41,786 INFO L85 PathProgramCache]: Analyzing trace with hash 76530400, now seen corresponding path program 1 times [2025-01-09 15:36:41,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:41,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663627087] [2025-01-09 15:36:41,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:41,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:41,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 15:36:41,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 15:36:41,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:41,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:36:41,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:41,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663627087] [2025-01-09 15:36:41,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663627087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:41,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:41,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:36:41,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428199713] [2025-01-09 15:36:41,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:41,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:36:41,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:41,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:36:41,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:36:41,965 INFO L87 Difference]: Start difference. First operand 452 states and 567 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:36:42,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:42,216 INFO L93 Difference]: Finished difference Result 1062 states and 1338 transitions. [2025-01-09 15:36:42,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:36:42,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2025-01-09 15:36:42,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:42,220 INFO L225 Difference]: With dead ends: 1062 [2025-01-09 15:36:42,220 INFO L226 Difference]: Without dead ends: 607 [2025-01-09 15:36:42,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:36:42,221 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 81 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:42,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 607 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:36:42,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-01-09 15:36:42,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 605. [2025-01-09 15:36:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 531 states have (on average 1.2128060263653484) internal successors, (644), 538 states have internal predecessors, (644), 58 states have call successors, (58), 15 states have call predecessors, (58), 15 states have return successors, (58), 51 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:36:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 760 transitions. [2025-01-09 15:36:42,316 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 760 transitions. Word has length 120 [2025-01-09 15:36:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:42,317 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 760 transitions. [2025-01-09 15:36:42,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:36:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 760 transitions. [2025-01-09 15:36:42,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:36:42,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:42,318 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:42,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:36:42,319 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:42,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:42,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1944801509, now seen corresponding path program 1 times [2025-01-09 15:36:42,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:42,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022665573] [2025-01-09 15:36:42,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:42,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:42,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:36:42,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:36:42,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:42,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:44,134 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-01-09 15:36:44,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:44,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022665573] [2025-01-09 15:36:44,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022665573] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:36:44,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052399021] [2025-01-09 15:36:44,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:44,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:36:44,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:36:44,137 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:36:44,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:36:44,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:36:44,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:36:44,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:44,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:44,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 112 conjuncts are in the unsatisfiable core [2025-01-09 15:36:44,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:36:45,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:36:46,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:36:46,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 15:36:48,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2025-01-09 15:36:49,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:36:49,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:36:49,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:36:49,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:36:49,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2025-01-09 15:36:49,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:36:49,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:36:49,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:36:49,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2025-01-09 15:36:51,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2025-01-09 15:36:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 83 proven. 302 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 15:36:51,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:36:53,381 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:36:53,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052399021] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:36:53,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:36:53,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [20, 31] total 57 [2025-01-09 15:36:53,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615160387] [2025-01-09 15:36:53,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:53,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:36:53,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:53,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:36:53,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2964, Unknown=0, NotChecked=0, Total=3192 [2025-01-09 15:36:53,384 INFO L87 Difference]: Start difference. First operand 605 states and 760 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:36:54,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:54,776 INFO L93 Difference]: Finished difference Result 1207 states and 1497 transitions. [2025-01-09 15:36:54,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:36:54,777 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2025-01-09 15:36:54,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:54,782 INFO L225 Difference]: With dead ends: 1207 [2025-01-09 15:36:54,782 INFO L226 Difference]: Without dead ends: 777 [2025-01-09 15:36:54,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=258, Invalid=3282, Unknown=0, NotChecked=0, Total=3540 [2025-01-09 15:36:54,784 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 208 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:54,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 510 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:36:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-01-09 15:36:54,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 476. [2025-01-09 15:36:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 417 states have (on average 1.211031175059952) internal successors, (505), 419 states have internal predecessors, (505), 45 states have call successors, (45), 13 states have call predecessors, (45), 13 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 15:36:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 595 transitions. [2025-01-09 15:36:54,874 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 595 transitions. Word has length 121 [2025-01-09 15:36:54,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:54,874 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 595 transitions. [2025-01-09 15:36:54,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:36:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 595 transitions. [2025-01-09 15:36:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:36:54,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:54,876 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:54,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:36:55,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 15:36:55,076 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:55,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:55,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1686636071, now seen corresponding path program 1 times [2025-01-09 15:36:55,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:55,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146456863] [2025-01-09 15:36:55,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:55,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:55,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:36:55,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:36:55,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:55,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:36:56,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:56,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146456863] [2025-01-09 15:36:56,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146456863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:56,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:56,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 15:36:56,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497920585] [2025-01-09 15:36:56,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:56,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:36:56,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:56,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:36:56,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:36:56,453 INFO L87 Difference]: Start difference. First operand 476 states and 595 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 15:36:58,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:58,603 INFO L93 Difference]: Finished difference Result 957 states and 1183 transitions. [2025-01-09 15:36:58,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:36:58,604 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 121 [2025-01-09 15:36:58,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:58,607 INFO L225 Difference]: With dead ends: 957 [2025-01-09 15:36:58,607 INFO L226 Difference]: Without dead ends: 605 [2025-01-09 15:36:58,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:36:58,608 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 309 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:58,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 618 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 15:36:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-01-09 15:36:58,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 484. [2025-01-09 15:36:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 423 states have (on average 1.2033096926713949) internal successors, (509), 425 states have internal predecessors, (509), 46 states have call successors, (46), 14 states have call predecessors, (46), 14 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:36:58,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 601 transitions. [2025-01-09 15:36:58,697 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 601 transitions. Word has length 121 [2025-01-09 15:36:58,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:58,697 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 601 transitions. [2025-01-09 15:36:58,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 15:36:58,697 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 601 transitions. [2025-01-09 15:36:58,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:36:58,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:58,698 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:58,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:36:58,698 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:58,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:58,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1238838041, now seen corresponding path program 1 times [2025-01-09 15:36:58,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:58,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237980576] [2025-01-09 15:36:58,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:58,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:58,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:36:58,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:36:58,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:58,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:36:59,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:59,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237980576] [2025-01-09 15:36:59,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237980576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:59,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:59,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:36:59,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700320531] [2025-01-09 15:36:59,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:59,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:36:59,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:59,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:36:59,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:36:59,144 INFO L87 Difference]: Start difference. First operand 484 states and 601 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:36:59,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:59,676 INFO L93 Difference]: Finished difference Result 1047 states and 1290 transitions. [2025-01-09 15:36:59,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:36:59,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2025-01-09 15:36:59,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:59,679 INFO L225 Difference]: With dead ends: 1047 [2025-01-09 15:36:59,680 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 15:36:59,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:36:59,681 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 32 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:59,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 443 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:36:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 15:36:59,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 470. [2025-01-09 15:36:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 409 states have (on average 1.1931540342298288) internal successors, (488), 411 states have internal predecessors, (488), 46 states have call successors, (46), 14 states have call predecessors, (46), 14 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:36:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 580 transitions. [2025-01-09 15:36:59,793 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 580 transitions. Word has length 121 [2025-01-09 15:36:59,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:59,793 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 580 transitions. [2025-01-09 15:36:59,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:36:59,794 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 580 transitions. [2025-01-09 15:36:59,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:36:59,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:59,795 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:59,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 15:36:59,795 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:59,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:59,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1036227532, now seen corresponding path program 1 times [2025-01-09 15:36:59,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:59,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057772493] [2025-01-09 15:36:59,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:59,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:59,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:36:59,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:36:59,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:59,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:00,507 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:37:00,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:00,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057772493] [2025-01-09 15:37:00,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057772493] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:00,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:00,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 15:37:00,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565144589] [2025-01-09 15:37:00,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:00,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:37:00,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:00,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:37:00,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:37:00,508 INFO L87 Difference]: Start difference. First operand 470 states and 580 transitions. Second operand has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 14 states have internal predecessors, (49), 7 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) [2025-01-09 15:37:01,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:01,290 INFO L93 Difference]: Finished difference Result 943 states and 1161 transitions. [2025-01-09 15:37:01,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:37:01,291 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 14 states have internal predecessors, (49), 7 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) Word has length 121 [2025-01-09 15:37:01,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:01,293 INFO L225 Difference]: With dead ends: 943 [2025-01-09 15:37:01,293 INFO L226 Difference]: Without dead ends: 476 [2025-01-09 15:37:01,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:37:01,296 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 362 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:01,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 445 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:37:01,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-01-09 15:37:01,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 464. [2025-01-09 15:37:01,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 403 states have (on average 1.186104218362283) internal successors, (478), 405 states have internal predecessors, (478), 46 states have call successors, (46), 14 states have call predecessors, (46), 14 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:37:01,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 570 transitions. [2025-01-09 15:37:01,386 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 570 transitions. Word has length 121 [2025-01-09 15:37:01,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:01,386 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 570 transitions. [2025-01-09 15:37:01,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 14 states have internal predecessors, (49), 7 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) [2025-01-09 15:37:01,386 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 570 transitions. [2025-01-09 15:37:01,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 15:37:01,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:01,388 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:01,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 15:37:01,389 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:01,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:01,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1762532093, now seen corresponding path program 1 times [2025-01-09 15:37:01,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:01,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73375662] [2025-01-09 15:37:01,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:01,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:01,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:37:01,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:37:01,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:01,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:37:01,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:01,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73375662] [2025-01-09 15:37:01,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73375662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:01,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:01,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:37:01,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679151215] [2025-01-09 15:37:01,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:01,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:37:01,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:01,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:37:01,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:37:01,633 INFO L87 Difference]: Start difference. First operand 464 states and 570 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:37:01,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:01,980 INFO L93 Difference]: Finished difference Result 1170 states and 1422 transitions. [2025-01-09 15:37:01,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:37:01,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-01-09 15:37:01,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:01,984 INFO L225 Difference]: With dead ends: 1170 [2025-01-09 15:37:01,984 INFO L226 Difference]: Without dead ends: 709 [2025-01-09 15:37:01,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:37:01,987 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 55 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:01,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 753 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:37:01,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-01-09 15:37:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 524. [2025-01-09 15:37:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 463 states have (on average 1.1792656587473003) internal successors, (546), 465 states have internal predecessors, (546), 46 states have call successors, (46), 14 states have call predecessors, (46), 14 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:37:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 638 transitions. [2025-01-09 15:37:02,071 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 638 transitions. Word has length 122 [2025-01-09 15:37:02,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:02,071 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 638 transitions. [2025-01-09 15:37:02,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:37:02,071 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 638 transitions. [2025-01-09 15:37:02,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:37:02,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:02,072 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:02,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 15:37:02,073 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:02,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:02,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1171920054, now seen corresponding path program 1 times [2025-01-09 15:37:02,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:02,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189192745] [2025-01-09 15:37:02,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:02,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:02,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:37:02,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:37:02,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:02,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:37:02,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:02,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189192745] [2025-01-09 15:37:02,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189192745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:02,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:02,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:37:02,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606037441] [2025-01-09 15:37:02,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:02,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:37:02,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:02,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:37:02,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:37:02,237 INFO L87 Difference]: Start difference. First operand 524 states and 638 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:37:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:02,513 INFO L93 Difference]: Finished difference Result 1179 states and 1432 transitions. [2025-01-09 15:37:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:37:02,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-01-09 15:37:02,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:02,516 INFO L225 Difference]: With dead ends: 1179 [2025-01-09 15:37:02,516 INFO L226 Difference]: Without dead ends: 658 [2025-01-09 15:37:02,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:37:02,517 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 47 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:02,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 430 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:37:02,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-01-09 15:37:02,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 528. [2025-01-09 15:37:02,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 467 states have (on average 1.177730192719486) internal successors, (550), 469 states have internal predecessors, (550), 46 states have call successors, (46), 14 states have call predecessors, (46), 14 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:37:02,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 642 transitions. [2025-01-09 15:37:02,599 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 642 transitions. Word has length 127 [2025-01-09 15:37:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:02,600 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 642 transitions. [2025-01-09 15:37:02,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:37:02,600 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 642 transitions. [2025-01-09 15:37:02,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:37:02,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:02,601 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:02,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 15:37:02,601 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:02,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:02,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1430085492, now seen corresponding path program 1 times [2025-01-09 15:37:02,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:02,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468552854] [2025-01-09 15:37:02,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:02,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:02,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:37:02,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:37:02,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:02,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:37:02,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:02,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468552854] [2025-01-09 15:37:02,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468552854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:02,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:02,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:37:02,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012043764] [2025-01-09 15:37:02,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:02,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:37:02,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:02,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:37:02,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:37:02,734 INFO L87 Difference]: Start difference. First operand 528 states and 642 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:37:02,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:02,880 INFO L93 Difference]: Finished difference Result 1147 states and 1388 transitions. [2025-01-09 15:37:02,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:37:02,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-01-09 15:37:02,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:02,883 INFO L225 Difference]: With dead ends: 1147 [2025-01-09 15:37:02,883 INFO L226 Difference]: Without dead ends: 622 [2025-01-09 15:37:02,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:37:02,884 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 37 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:02,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 532 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:37:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-01-09 15:37:02,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 524. [2025-01-09 15:37:02,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 463 states have (on average 1.161987041036717) internal successors, (538), 465 states have internal predecessors, (538), 46 states have call successors, (46), 14 states have call predecessors, (46), 14 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:37:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 630 transitions. [2025-01-09 15:37:02,972 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 630 transitions. Word has length 127 [2025-01-09 15:37:02,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:02,972 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 630 transitions. [2025-01-09 15:37:02,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:37:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 630 transitions. [2025-01-09 15:37:02,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:37:02,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:02,974 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:02,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 15:37:02,974 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:02,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:02,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1353136364, now seen corresponding path program 1 times [2025-01-09 15:37:02,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:02,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845496917] [2025-01-09 15:37:02,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:02,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:02,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:37:03,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:37:03,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:03,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:03,441 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:37:03,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:03,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845496917] [2025-01-09 15:37:03,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845496917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:03,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:03,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:37:03,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309559947] [2025-01-09 15:37:03,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:03,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:37:03,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:03,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:37:03,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:37:03,443 INFO L87 Difference]: Start difference. First operand 524 states and 630 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:37:04,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:04,068 INFO L93 Difference]: Finished difference Result 1103 states and 1319 transitions. [2025-01-09 15:37:04,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:37:04,068 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2025-01-09 15:37:04,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:04,070 INFO L225 Difference]: With dead ends: 1103 [2025-01-09 15:37:04,070 INFO L226 Difference]: Without dead ends: 582 [2025-01-09 15:37:04,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:37:04,071 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 147 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:04,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 465 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:37:04,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-01-09 15:37:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 524. [2025-01-09 15:37:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 463 states have (on average 1.1533477321814254) internal successors, (534), 465 states have internal predecessors, (534), 46 states have call successors, (46), 14 states have call predecessors, (46), 14 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:37:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 626 transitions. [2025-01-09 15:37:04,154 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 626 transitions. Word has length 127 [2025-01-09 15:37:04,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:04,154 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 626 transitions. [2025-01-09 15:37:04,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:37:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 626 transitions. [2025-01-09 15:37:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 15:37:04,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:04,155 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:04,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 15:37:04,155 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:04,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:04,156 INFO L85 PathProgramCache]: Analyzing trace with hash 402120985, now seen corresponding path program 1 times [2025-01-09 15:37:04,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:04,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28343967] [2025-01-09 15:37:04,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:04,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:04,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 15:37:04,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 15:37:04,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:04,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat