./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-44.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-s_file-44.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 f5e750e5fa316e30fef8e3158d304f9d418ce308f7b74e89da459ba726747abe --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:58:51,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:58:51,271 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:58:51,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:58:51,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:58:51,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:58:51,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:58:51,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:58:51,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:58:51,299 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:58:51,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:58:51,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:58:51,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:58:51,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:58:51,301 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:58:51,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:58:51,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:58:51,301 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:58:51,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:58:51,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:58:51,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:58:51,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:58:51,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:58:51,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:58:51,302 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:58:51,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:58:51,302 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:58:51,302 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:58:51,302 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:58:51,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:58:51,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:58:51,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:58:51,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:58:51,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:58:51,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:58:51,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:58:51,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:58:51,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:58:51,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:58:51,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:58:51,304 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:58:51,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:58:51,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:58:51,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:58:51,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:58:51,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:58:51,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:58:51,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:58:51,304 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 -> f5e750e5fa316e30fef8e3158d304f9d418ce308f7b74e89da459ba726747abe [2025-01-09 15:58:51,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:58:51,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:58:51,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:58:51,527 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:58:51,527 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:58:51,528 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-s_file-44.i [2025-01-09 15:58:52,818 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9fd19cfdb/2d28cbb14c234d94ac592e289e8de0b7/FLAGea4b45a6a [2025-01-09 15:58:53,022 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:58:53,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-44.i [2025-01-09 15:58:53,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9fd19cfdb/2d28cbb14c234d94ac592e289e8de0b7/FLAGea4b45a6a [2025-01-09 15:58:53,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9fd19cfdb/2d28cbb14c234d94ac592e289e8de0b7 [2025-01-09 15:58:53,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:58:53,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:58:53,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:58:53,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:58:53,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:58:53,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:58:53" (1/1) ... [2025-01-09 15:58:53,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137ce0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:53, skipping insertion in model container [2025-01-09 15:58:53,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:58:53" (1/1) ... [2025-01-09 15:58:53,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:58:53,516 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-s_file-44.i[916,929] [2025-01-09 15:58:53,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:58:53,557 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:58:53,563 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-s_file-44.i[916,929] [2025-01-09 15:58:53,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:58:53,617 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:58:53,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:53 WrapperNode [2025-01-09 15:58:53,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:58:53,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:58:53,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:58:53,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:58:53,628 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:58:53" (1/1) ... [2025-01-09 15:58:53,640 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:58:53" (1/1) ... [2025-01-09 15:58:53,681 INFO L138 Inliner]: procedures = 30, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 482 [2025-01-09 15:58:53,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:58:53,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:58:53,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:58:53,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:58:53,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:53" (1/1) ... [2025-01-09 15:58:53,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:53" (1/1) ... [2025-01-09 15:58:53,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:53" (1/1) ... [2025-01-09 15:58:53,701 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 15:58:53,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:53" (1/1) ... [2025-01-09 15:58:53,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:53" (1/1) ... [2025-01-09 15:58:53,711 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:53" (1/1) ... [2025-01-09 15:58:53,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:53" (1/1) ... [2025-01-09 15:58:53,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:53" (1/1) ... [2025-01-09 15:58:53,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:53" (1/1) ... [2025-01-09 15:58:53,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:53" (1/1) ... [2025-01-09 15:58:53,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:58:53,719 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:58:53,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:58:53,720 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:58:53,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:53" (1/1) ... [2025-01-09 15:58:53,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:58:53,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:58:53,750 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:58:53,752 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:58:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:58:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 15:58:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 15:58:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 15:58:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 15:58:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 15:58:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 15:58:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:58:53,769 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:58:53,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 15:58:53,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:58:53,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:58:53,846 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:58:53,850 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:58:54,275 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-01-09 15:58:54,275 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:58:54,283 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:58:54,283 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:58:54,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:58:54 BoogieIcfgContainer [2025-01-09 15:58:54,283 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:58:54,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:58:54,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:58:54,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:58:54,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:58:53" (1/3) ... [2025-01-09 15:58:54,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ddedf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:58:54, skipping insertion in model container [2025-01-09 15:58:54,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:53" (2/3) ... [2025-01-09 15:58:54,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ddedf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:58:54, skipping insertion in model container [2025-01-09 15:58:54,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:58:54" (3/3) ... [2025-01-09 15:58:54,291 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-44.i [2025-01-09 15:58:54,302 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:58:54,303 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-44.i that has 2 procedures, 117 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:58:54,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:58:54,352 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;@7afae383, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:58:54,352 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:58:54,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 94 states have internal predecessors, (128), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:58:54,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 15:58:54,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:58:54,363 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:54,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:58:54,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:58:54,366 INFO L85 PathProgramCache]: Analyzing trace with hash -852906117, now seen corresponding path program 1 times [2025-01-09 15:58:54,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:58:54,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505994106] [2025-01-09 15:58:54,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:58:54,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:58:54,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 15:58:54,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 15:58:54,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:58:54,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:58:54,860 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:58:54,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:58:54,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505994106] [2025-01-09 15:58:54,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505994106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:58:54,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:58:54,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:58:54,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367552720] [2025-01-09 15:58:54,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:58:54,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:58:54,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:58:54,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:58:54,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:58:54,877 INFO L87 Difference]: Start difference. First operand has 117 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 94 states have internal predecessors, (128), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:58:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:58:54,930 INFO L93 Difference]: Finished difference Result 231 states and 360 transitions. [2025-01-09 15:58:54,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:58:54,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2025-01-09 15:58:54,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:58:54,942 INFO L225 Difference]: With dead ends: 231 [2025-01-09 15:58:54,942 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 15:58:54,945 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:58:54,948 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 1 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 477 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:58:54,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 477 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:58:54,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 15:58:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2025-01-09 15:58:54,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:58:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 167 transitions. [2025-01-09 15:58:54,983 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 167 transitions. Word has length 159 [2025-01-09 15:58:54,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:58:54,984 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 167 transitions. [2025-01-09 15:58:54,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:58:54,985 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 167 transitions. [2025-01-09 15:58:54,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 15:58:54,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:58:54,987 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:54,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 15:58:54,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:58:54,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:58:54,987 INFO L85 PathProgramCache]: Analyzing trace with hash -851059075, now seen corresponding path program 1 times [2025-01-09 15:58:54,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:58:54,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69750571] [2025-01-09 15:58:54,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:58:54,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:58:55,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 15:58:55,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 15:58:55,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:58:55,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:58:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:58:55,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:58:55,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69750571] [2025-01-09 15:58:55,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69750571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:58:55,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:58:55,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:58:55,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148629730] [2025-01-09 15:58:55,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:58:55,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:58:55,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:58:55,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:58:55,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:58:55,597 INFO L87 Difference]: Start difference. First operand 116 states and 167 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:58:55,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:58:55,905 INFO L93 Difference]: Finished difference Result 283 states and 408 transitions. [2025-01-09 15:58:55,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:58:55,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2025-01-09 15:58:55,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:58:55,910 INFO L225 Difference]: With dead ends: 283 [2025-01-09 15:58:55,910 INFO L226 Difference]: Without dead ends: 170 [2025-01-09 15:58:55,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:58:55,911 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 63 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:58:55,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 555 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:58:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-09 15:58:55,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 134. [2025-01-09 15:58:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 111 states have (on average 1.3693693693693694) internal successors, (152), 111 states have internal predecessors, (152), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:58:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 194 transitions. [2025-01-09 15:58:55,931 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 194 transitions. Word has length 159 [2025-01-09 15:58:55,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:58:55,932 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 194 transitions. [2025-01-09 15:58:55,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:58:55,932 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 194 transitions. [2025-01-09 15:58:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:58:55,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:58:55,935 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:55,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:58:55,935 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:58:55,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:58:55,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1969197580, now seen corresponding path program 1 times [2025-01-09 15:58:55,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:58:55,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029014885] [2025-01-09 15:58:55,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:58:55,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:58:55,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:58:56,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:58:56,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:58:56,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:58:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:58:57,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:58:57,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029014885] [2025-01-09 15:58:57,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029014885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:58:57,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:58:57,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:58:57,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680595490] [2025-01-09 15:58:57,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:58:57,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:58:57,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:58:57,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:58:57,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:58:57,940 INFO L87 Difference]: Start difference. First operand 134 states and 194 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:58:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:58:58,584 INFO L93 Difference]: Finished difference Result 310 states and 444 transitions. [2025-01-09 15:58:58,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:58:58,585 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 160 [2025-01-09 15:58:58,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:58:58,587 INFO L225 Difference]: With dead ends: 310 [2025-01-09 15:58:58,587 INFO L226 Difference]: Without dead ends: 179 [2025-01-09 15:58:58,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:58:58,588 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 70 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:58:58,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 921 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:58:58,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-01-09 15:58:58,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2025-01-09 15:58:58,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 149 states have (on average 1.3624161073825503) internal successors, (203), 150 states have internal predecessors, (203), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:58:58,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 249 transitions. [2025-01-09 15:58:58,609 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 249 transitions. Word has length 160 [2025-01-09 15:58:58,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:58:58,610 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 249 transitions. [2025-01-09 15:58:58,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:58:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 249 transitions. [2025-01-09 15:58:58,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 15:58:58,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:58:58,611 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:58,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:58:58,612 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:58:58,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:58:58,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1943465064, now seen corresponding path program 1 times [2025-01-09 15:58:58,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:58:58,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506831704] [2025-01-09 15:58:58,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:58:58,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:58:58,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:58:58,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:58:58,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:58:58,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:58:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 15:58:58,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:58:58,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506831704] [2025-01-09 15:58:58,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506831704] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:58:58,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337876609] [2025-01-09 15:58:58,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:58:58,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:58:58,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:58:58,793 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:58:58,795 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:58:58,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:58:58,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:58:58,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:58:58,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:58:58,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:58:58,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:58:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:58:58,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:58:58,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337876609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:58:58,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:58:58,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 15:58:58,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104592076] [2025-01-09 15:58:58,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:58:58,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:58:58,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:58:58,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:58:58,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:58:58,993 INFO L87 Difference]: Start difference. First operand 175 states and 249 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:58:59,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:58:59,017 INFO L93 Difference]: Finished difference Result 353 states and 503 transitions. [2025-01-09 15:58:59,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:58:59,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 161 [2025-01-09 15:58:59,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:58:59,019 INFO L225 Difference]: With dead ends: 353 [2025-01-09 15:58:59,019 INFO L226 Difference]: Without dead ends: 181 [2025-01-09 15:58:59,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:58:59,020 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:58:59,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 631 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:58:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-09 15:58:59,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-01-09 15:58:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 155 states have (on average 1.3483870967741935) internal successors, (209), 156 states have internal predecessors, (209), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:58:59,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 255 transitions. [2025-01-09 15:58:59,028 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 255 transitions. Word has length 161 [2025-01-09 15:58:59,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:58:59,028 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 255 transitions. [2025-01-09 15:58:59,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:58:59,028 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 255 transitions. [2025-01-09 15:58:59,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 15:58:59,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:58:59,030 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:59,040 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:58:59,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:58:59,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:58:59,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:58:59,235 INFO L85 PathProgramCache]: Analyzing trace with hash 812425877, now seen corresponding path program 1 times [2025-01-09 15:58:59,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:58:59,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386768906] [2025-01-09 15:58:59,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:58:59,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:58:59,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 15:58:59,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 15:58:59,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:58:59,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:59:00,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:59:00,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386768906] [2025-01-09 15:59:00,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386768906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:00,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:00,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:59:00,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612539318] [2025-01-09 15:59:00,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:00,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:59:00,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:59:00,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:59:00,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:59:00,447 INFO L87 Difference]: Start difference. First operand 181 states and 255 transitions. Second operand has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:59:00,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:00,995 INFO L93 Difference]: Finished difference Result 361 states and 504 transitions. [2025-01-09 15:59:00,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:59:00,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2025-01-09 15:59:00,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:01,000 INFO L225 Difference]: With dead ends: 361 [2025-01-09 15:59:01,000 INFO L226 Difference]: Without dead ends: 183 [2025-01-09 15:59:01,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:59:01,001 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 64 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:01,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 611 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:59:01,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-09 15:59:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 141. [2025-01-09 15:59:01,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 117 states have (on average 1.3333333333333333) internal successors, (156), 117 states have internal predecessors, (156), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:59:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 198 transitions. [2025-01-09 15:59:01,016 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 198 transitions. Word has length 163 [2025-01-09 15:59:01,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:01,016 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 198 transitions. [2025-01-09 15:59:01,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:59:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 198 transitions. [2025-01-09 15:59:01,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 15:59:01,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:01,019 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:01,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:59:01,019 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:01,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:01,019 INFO L85 PathProgramCache]: Analyzing trace with hash -36402835, now seen corresponding path program 1 times [2025-01-09 15:59:01,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:01,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628600567] [2025-01-09 15:59:01,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:01,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:01,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 15:59:01,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 15:59:01,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:01,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:01,108 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:59:01,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:59:01,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628600567] [2025-01-09 15:59:01,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628600567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:01,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:01,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:59:01,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632551621] [2025-01-09 15:59:01,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:01,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:59:01,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:59:01,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:59:01,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:59:01,111 INFO L87 Difference]: Start difference. First operand 141 states and 198 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:59:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:01,125 INFO L93 Difference]: Finished difference Result 279 states and 393 transitions. [2025-01-09 15:59:01,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:59:01,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2025-01-09 15:59:01,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:01,127 INFO L225 Difference]: With dead ends: 279 [2025-01-09 15:59:01,127 INFO L226 Difference]: Without dead ends: 141 [2025-01-09 15:59:01,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:59:01,128 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:01,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 322 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:59:01,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-09 15:59:01,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-01-09 15:59:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 117 states have internal predecessors, (155), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:59:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 197 transitions. [2025-01-09 15:59:01,137 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 197 transitions. Word has length 163 [2025-01-09 15:59:01,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:01,138 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 197 transitions. [2025-01-09 15:59:01,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:59:01,139 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 197 transitions. [2025-01-09 15:59:01,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 15:59:01,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:01,140 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:01,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:59:01,140 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:01,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:01,141 INFO L85 PathProgramCache]: Analyzing trace with hash 106165924, now seen corresponding path program 1 times [2025-01-09 15:59:01,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:01,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425170541] [2025-01-09 15:59:01,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:01,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:01,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 15:59:01,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 15:59:01,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:01,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:01,966 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:59:01,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:59:01,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425170541] [2025-01-09 15:59:01,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425170541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:01,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:01,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:59:01,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184078559] [2025-01-09 15:59:01,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:01,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:59:01,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:59:01,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:59:01,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:59:01,969 INFO L87 Difference]: Start difference. First operand 141 states and 197 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:59:02,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:02,154 INFO L93 Difference]: Finished difference Result 417 states and 585 transitions. [2025-01-09 15:59:02,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:59:02,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 164 [2025-01-09 15:59:02,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:02,156 INFO L225 Difference]: With dead ends: 417 [2025-01-09 15:59:02,156 INFO L226 Difference]: Without dead ends: 279 [2025-01-09 15:59:02,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:59:02,157 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 97 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:02,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 284 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:59:02,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-01-09 15:59:02,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 265. [2025-01-09 15:59:02,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 218 states have (on average 1.311926605504587) internal successors, (286), 218 states have internal predecessors, (286), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 15:59:02,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 370 transitions. [2025-01-09 15:59:02,177 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 370 transitions. Word has length 164 [2025-01-09 15:59:02,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:02,178 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 370 transitions. [2025-01-09 15:59:02,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:59:02,178 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 370 transitions. [2025-01-09 15:59:02,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 15:59:02,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:02,180 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:02,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:59:02,181 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:02,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:02,181 INFO L85 PathProgramCache]: Analyzing trace with hash -477407856, now seen corresponding path program 1 times [2025-01-09 15:59:02,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:02,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887455010] [2025-01-09 15:59:02,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:02,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:02,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 15:59:02,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 15:59:02,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:02,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:59:02,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:59:02,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887455010] [2025-01-09 15:59:02,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887455010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:02,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:02,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:59:02,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22058766] [2025-01-09 15:59:02,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:02,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:59:02,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:59:02,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:59:02,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:59:02,282 INFO L87 Difference]: Start difference. First operand 265 states and 370 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:59:02,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:02,443 INFO L93 Difference]: Finished difference Result 529 states and 739 transitions. [2025-01-09 15:59:02,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:59:02,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 165 [2025-01-09 15:59:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:02,446 INFO L225 Difference]: With dead ends: 529 [2025-01-09 15:59:02,447 INFO L226 Difference]: Without dead ends: 267 [2025-01-09 15:59:02,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:59:02,448 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 2 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:02,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 413 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:59:02,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-01-09 15:59:02,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2025-01-09 15:59:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 218 states have (on average 1.2935779816513762) internal successors, (282), 218 states have internal predecessors, (282), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 15:59:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 366 transitions. [2025-01-09 15:59:02,468 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 366 transitions. Word has length 165 [2025-01-09 15:59:02,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:02,469 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 366 transitions. [2025-01-09 15:59:02,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:59:02,470 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 366 transitions. [2025-01-09 15:59:02,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 15:59:02,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:02,472 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:02,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:59:02,472 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:02,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:02,473 INFO L85 PathProgramCache]: Analyzing trace with hash -987928070, now seen corresponding path program 1 times [2025-01-09 15:59:02,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:02,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565971394] [2025-01-09 15:59:02,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:02,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:02,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 15:59:02,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 15:59:02,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:02,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:59:03,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:59:03,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565971394] [2025-01-09 15:59:03,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565971394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:03,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:03,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:59:03,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358392385] [2025-01-09 15:59:03,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:03,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:59:03,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:59:03,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:59:03,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:59:03,521 INFO L87 Difference]: Start difference. First operand 265 states and 366 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:59:04,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:04,311 INFO L93 Difference]: Finished difference Result 684 states and 935 transitions. [2025-01-09 15:59:04,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:59:04,311 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 166 [2025-01-09 15:59:04,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:04,313 INFO L225 Difference]: With dead ends: 684 [2025-01-09 15:59:04,315 INFO L226 Difference]: Without dead ends: 422 [2025-01-09 15:59:04,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:59:04,316 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 77 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:04,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1266 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:59:04,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-01-09 15:59:04,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 413. [2025-01-09 15:59:04,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 346 states have (on average 1.283236994219653) internal successors, (444), 348 states have internal predecessors, (444), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:59:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 560 transitions. [2025-01-09 15:59:04,348 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 560 transitions. Word has length 166 [2025-01-09 15:59:04,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:04,348 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 560 transitions. [2025-01-09 15:59:04,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:59:04,349 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 560 transitions. [2025-01-09 15:59:04,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 15:59:04,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:04,352 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:04,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:59:04,353 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:04,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:04,353 INFO L85 PathProgramCache]: Analyzing trace with hash -847379460, now seen corresponding path program 1 times [2025-01-09 15:59:04,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:04,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366316446] [2025-01-09 15:59:04,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:04,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:04,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 15:59:04,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 15:59:04,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:04,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:59:06,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:59:06,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366316446] [2025-01-09 15:59:06,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366316446] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:06,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:06,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:59:06,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909117547] [2025-01-09 15:59:06,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:06,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:59:06,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:59:06,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:59:06,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:59:06,004 INFO L87 Difference]: Start difference. First operand 413 states and 560 transitions. Second operand has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:59:07,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:07,703 INFO L93 Difference]: Finished difference Result 981 states and 1328 transitions. [2025-01-09 15:59:07,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:59:07,704 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 166 [2025-01-09 15:59:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:07,710 INFO L225 Difference]: With dead ends: 981 [2025-01-09 15:59:07,710 INFO L226 Difference]: Without dead ends: 571 [2025-01-09 15:59:07,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:59:07,712 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 87 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:07,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1151 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 15:59:07,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-01-09 15:59:07,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 451. [2025-01-09 15:59:07,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 384 states have (on average 1.296875) internal successors, (498), 386 states have internal predecessors, (498), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:59:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 614 transitions. [2025-01-09 15:59:07,761 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 614 transitions. Word has length 166 [2025-01-09 15:59:07,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:07,761 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 614 transitions. [2025-01-09 15:59:07,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:59:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 614 transitions. [2025-01-09 15:59:07,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 15:59:07,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:07,764 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:07,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:59:07,764 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:07,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:07,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1858496710, now seen corresponding path program 1 times [2025-01-09 15:59:07,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:07,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587916504] [2025-01-09 15:59:07,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:07,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:07,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 15:59:07,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 15:59:07,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:07,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:08,719 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:59:08,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:59:08,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587916504] [2025-01-09 15:59:08,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587916504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:08,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:08,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:59:08,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172505310] [2025-01-09 15:59:08,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:08,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:59:08,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:59:08,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:59:08,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:59:08,721 INFO L87 Difference]: Start difference. First operand 451 states and 614 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:59:09,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:09,147 INFO L93 Difference]: Finished difference Result 1095 states and 1484 transitions. [2025-01-09 15:59:09,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:59:09,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 166 [2025-01-09 15:59:09,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:09,154 INFO L225 Difference]: With dead ends: 1095 [2025-01-09 15:59:09,154 INFO L226 Difference]: Without dead ends: 647 [2025-01-09 15:59:09,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:59:09,157 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 59 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:09,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 558 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:59:09,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-01-09 15:59:09,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 479. [2025-01-09 15:59:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 412 states have (on average 1.296116504854369) internal successors, (534), 414 states have internal predecessors, (534), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:59:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 650 transitions. [2025-01-09 15:59:09,187 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 650 transitions. Word has length 166 [2025-01-09 15:59:09,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:09,187 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 650 transitions. [2025-01-09 15:59:09,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:59:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 650 transitions. [2025-01-09 15:59:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 15:59:09,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:09,189 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:09,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:59:09,189 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:09,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:09,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1356852550, now seen corresponding path program 1 times [2025-01-09 15:59:09,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:09,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861415345] [2025-01-09 15:59:09,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:09,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:09,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 15:59:09,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 15:59:09,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:09,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:59:09,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:59:09,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861415345] [2025-01-09 15:59:09,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861415345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:09,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:09,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:59:09,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438033466] [2025-01-09 15:59:09,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:09,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:59:09,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:59:09,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:59:09,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:59:10,000 INFO L87 Difference]: Start difference. First operand 479 states and 650 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:59:10,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:10,592 INFO L93 Difference]: Finished difference Result 1123 states and 1516 transitions. [2025-01-09 15:59:10,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:59:10,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 166 [2025-01-09 15:59:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:10,596 INFO L225 Difference]: With dead ends: 1123 [2025-01-09 15:59:10,596 INFO L226 Difference]: Without dead ends: 647 [2025-01-09 15:59:10,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:59:10,597 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 58 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:10,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 705 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:59:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-01-09 15:59:10,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 479. [2025-01-09 15:59:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 412 states have (on average 1.2864077669902914) internal successors, (530), 414 states have internal predecessors, (530), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:59:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 646 transitions. [2025-01-09 15:59:10,619 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 646 transitions. Word has length 166 [2025-01-09 15:59:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:10,619 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 646 transitions. [2025-01-09 15:59:10,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:59:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 646 transitions. [2025-01-09 15:59:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 15:59:10,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:10,621 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:10,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:59:10,621 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:10,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:10,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1926997496, now seen corresponding path program 1 times [2025-01-09 15:59:10,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:10,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709734595] [2025-01-09 15:59:10,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:10,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:10,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 15:59:10,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 15:59:10,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:10,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat