./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-56.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-56.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 ddaccc1a0ddb0072edffeef8ad9576acf619c322d8f731037fda7dc2530a10f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:00:19,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:00:19,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:00:19,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:00:19,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:00:19,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:00:19,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:00:19,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:00:19,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:00:19,987 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:00:19,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:00:19,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:00:19,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:00:19,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:00:19,988 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:00:19,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:00:19,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:00:19,988 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:00:19,988 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:00:19,988 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:00:19,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:00:19,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:00:19,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:00:19,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:00:19,989 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:00:19,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:00:19,989 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:00:19,989 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:00:19,989 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:00:19,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:00:19,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:00:19,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:00:19,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:00:19,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:00:19,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:00:19,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:00:19,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:00:19,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:00:19,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:00:19,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:00:19,990 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:00:19,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:00:19,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:00:19,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:00:19,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:00:19,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:00:19,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:00:19,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:00:19,990 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 -> ddaccc1a0ddb0072edffeef8ad9576acf619c322d8f731037fda7dc2530a10f9 [2025-01-09 16:00:20,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:00:20,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:00:20,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:00:20,295 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:00:20,295 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:00:20,297 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-56.i [2025-01-09 16:00:21,714 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9c03a99a/1caaa3460a9749b1adb686c5e18ff425/FLAGe1cdf0c00 [2025-01-09 16:00:21,999 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:00:22,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-56.i [2025-01-09 16:00:22,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9c03a99a/1caaa3460a9749b1adb686c5e18ff425/FLAGe1cdf0c00 [2025-01-09 16:00:22,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9c03a99a/1caaa3460a9749b1adb686c5e18ff425 [2025-01-09 16:00:22,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:00:22,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:00:22,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:00:22,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:00:22,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:00:22,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:00:22" (1/1) ... [2025-01-09 16:00:22,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37e35e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:22, skipping insertion in model container [2025-01-09 16:00:22,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:00:22" (1/1) ... [2025-01-09 16:00:22,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:00:22,469 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-56.i[916,929] [2025-01-09 16:00:22,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:00:22,549 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:00:22,562 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-56.i[916,929] [2025-01-09 16:00:22,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:00:22,640 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:00:22,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:22 WrapperNode [2025-01-09 16:00:22,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:00:22,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:00:22,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:00:22,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:00:22,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:22" (1/1) ... [2025-01-09 16:00:22,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:22" (1/1) ... [2025-01-09 16:00:22,716 INFO L138 Inliner]: procedures = 30, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 568 [2025-01-09 16:00:22,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:00:22,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:00:22,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:00:22,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:00:22,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:22" (1/1) ... [2025-01-09 16:00:22,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:22" (1/1) ... [2025-01-09 16:00:22,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:22" (1/1) ... [2025-01-09 16:00:22,741 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:00:22,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:22" (1/1) ... [2025-01-09 16:00:22,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:22" (1/1) ... [2025-01-09 16:00:22,774 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:22" (1/1) ... [2025-01-09 16:00:22,781 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:22" (1/1) ... [2025-01-09 16:00:22,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:22" (1/1) ... [2025-01-09 16:00:22,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:22" (1/1) ... [2025-01-09 16:00:22,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:22" (1/1) ... [2025-01-09 16:00:22,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:00:22,797 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:00:22,798 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:00:22,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:00:22,799 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:22" (1/1) ... [2025-01-09 16:00:22,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:00:22,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:00:22,841 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 16:00:22,848 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 16:00:22,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:00:22,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:00:22,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:00:22,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:00:22,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:00:22,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:00:22,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:00:22,869 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:00:22,869 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:00:22,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:00:22,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:00:22,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:00:22,981 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:00:22,983 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:00:23,701 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2025-01-09 16:00:23,701 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:00:23,717 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:00:23,718 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:00:23,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:00:23 BoogieIcfgContainer [2025-01-09 16:00:23,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:00:23,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:00:23,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:00:23,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:00:23,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:00:22" (1/3) ... [2025-01-09 16:00:23,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e7e837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:00:23, skipping insertion in model container [2025-01-09 16:00:23,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:22" (2/3) ... [2025-01-09 16:00:23,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e7e837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:00:23, skipping insertion in model container [2025-01-09 16:00:23,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:00:23" (3/3) ... [2025-01-09 16:00:23,729 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-56.i [2025-01-09 16:00:23,743 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:00:23,745 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-56.i that has 2 procedures, 125 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:00:23,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:00:23,825 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;@aaa2145, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:00:23,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:00:23,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 16:00:23,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 16:00:23,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:23,845 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:00:23,846 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:23,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:23,853 INFO L85 PathProgramCache]: Analyzing trace with hash 234039637, now seen corresponding path program 1 times [2025-01-09 16:00:23,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:00:23,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234168011] [2025-01-09 16:00:23,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:23,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:00:24,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 16:00:24,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 16:00:24,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:24,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 16:00:24,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:00:24,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234168011] [2025-01-09 16:00:24,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234168011] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:00:24,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785529564] [2025-01-09 16:00:24,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:24,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:00:24,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:00:24,359 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 16:00:24,361 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 16:00:24,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 16:00:24,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 16:00:24,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:24,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:24,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:00:24,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:00:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 16:00:24,633 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:00:24,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785529564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:24,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:00:24,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:00:24,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727252812] [2025-01-09 16:00:24,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:24,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:00:24,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:00:24,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:00:24,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:00:24,662 INFO L87 Difference]: Start difference. First operand has 125 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 16:00:24,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:00:24,698 INFO L93 Difference]: Finished difference Result 244 states and 384 transitions. [2025-01-09 16:00:24,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:00:24,700 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2025-01-09 16:00:24,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:00:24,706 INFO L225 Difference]: With dead ends: 244 [2025-01-09 16:00:24,706 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 16:00:24,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:00:24,716 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:00:24,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:00:24,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 16:00:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-01-09 16:00:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 16:00:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2025-01-09 16:00:24,759 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 151 [2025-01-09 16:00:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:00:24,760 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2025-01-09 16:00:24,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 16:00:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2025-01-09 16:00:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 16:00:24,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:24,765 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:00:24,773 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 16:00:24,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 16:00:24,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:24,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:24,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1288148547, now seen corresponding path program 1 times [2025-01-09 16:00:24,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:00:24,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811185331] [2025-01-09 16:00:24,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:24,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:00:25,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 16:00:25,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 16:00:25,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:25,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:00:25,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:00:25,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811185331] [2025-01-09 16:00:25,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811185331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:25,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:00:25,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:00:25,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980854569] [2025-01-09 16:00:25,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:25,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:00:25,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:00:25,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:00:25,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:00:25,304 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:00:25,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:00:25,333 INFO L93 Difference]: Finished difference Result 242 states and 359 transitions. [2025-01-09 16:00:25,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:00:25,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-01-09 16:00:25,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:00:25,336 INFO L225 Difference]: With dead ends: 242 [2025-01-09 16:00:25,336 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 16:00:25,337 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 16:00:25,338 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:00:25,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:00:25,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 16:00:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-01-09 16:00:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 16:00:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 181 transitions. [2025-01-09 16:00:25,360 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 181 transitions. Word has length 151 [2025-01-09 16:00:25,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:00:25,362 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 181 transitions. [2025-01-09 16:00:25,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:00:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 181 transitions. [2025-01-09 16:00:25,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 16:00:25,364 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:25,364 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:00:25,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:00:25,365 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:25,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:25,366 INFO L85 PathProgramCache]: Analyzing trace with hash 470500097, now seen corresponding path program 1 times [2025-01-09 16:00:25,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:00:25,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595616597] [2025-01-09 16:00:25,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:25,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:00:25,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 16:00:25,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 16:00:25,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:25,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:27,765 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:00:27,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:00:27,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595616597] [2025-01-09 16:00:27,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595616597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:27,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:00:27,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:00:27,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181015577] [2025-01-09 16:00:27,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:27,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:00:27,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:00:27,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:00:27,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:00:27,770 INFO L87 Difference]: Start difference. First operand 123 states and 181 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:00:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:00:29,920 INFO L93 Difference]: Finished difference Result 673 states and 1002 transitions. [2025-01-09 16:00:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 16:00:29,921 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-01-09 16:00:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:00:29,927 INFO L225 Difference]: With dead ends: 673 [2025-01-09 16:00:29,929 INFO L226 Difference]: Without dead ends: 553 [2025-01-09 16:00:29,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2025-01-09 16:00:29,934 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 859 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 16:00:29,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1245 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 16:00:29,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-01-09 16:00:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 291. [2025-01-09 16:00:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 250 states have (on average 1.448) internal successors, (362), 250 states have internal predecessors, (362), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 16:00:29,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 438 transitions. [2025-01-09 16:00:29,990 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 438 transitions. Word has length 151 [2025-01-09 16:00:29,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:00:29,991 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 438 transitions. [2025-01-09 16:00:29,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:00:29,991 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 438 transitions. [2025-01-09 16:00:29,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 16:00:29,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:29,996 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:00:29,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:00:29,997 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:29,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:29,998 INFO L85 PathProgramCache]: Analyzing trace with hash 525515353, now seen corresponding path program 1 times [2025-01-09 16:00:29,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:00:29,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250047352] [2025-01-09 16:00:29,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:29,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:00:30,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 16:00:30,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 16:00:30,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:30,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:00:30,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:00:30,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250047352] [2025-01-09 16:00:30,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250047352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:30,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:00:30,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:00:30,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427803958] [2025-01-09 16:00:30,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:30,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:00:30,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:00:30,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:00:30,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:00:30,125 INFO L87 Difference]: Start difference. First operand 291 states and 438 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:00:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:00:30,218 INFO L93 Difference]: Finished difference Result 583 states and 881 transitions. [2025-01-09 16:00:30,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:00:30,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-01-09 16:00:30,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:00:30,221 INFO L225 Difference]: With dead ends: 583 [2025-01-09 16:00:30,221 INFO L226 Difference]: Without dead ends: 295 [2025-01-09 16:00:30,222 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 16:00:30,223 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:00:30,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:00:30,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-01-09 16:00:30,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-01-09 16:00:30,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 254 states have (on average 1.4409448818897639) internal successors, (366), 254 states have internal predecessors, (366), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 16:00:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 442 transitions. [2025-01-09 16:00:30,256 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 442 transitions. Word has length 152 [2025-01-09 16:00:30,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:00:30,257 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 442 transitions. [2025-01-09 16:00:30,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:00:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 442 transitions. [2025-01-09 16:00:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 16:00:30,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:30,259 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:00:30,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:00:30,260 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:30,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:30,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1199080519, now seen corresponding path program 1 times [2025-01-09 16:00:30,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:00:30,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976538493] [2025-01-09 16:00:30,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:30,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:00:30,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 16:00:30,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 16:00:30,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:30,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:00:30,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:00:30,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976538493] [2025-01-09 16:00:30,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976538493] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:30,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:00:30,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:00:30,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024882702] [2025-01-09 16:00:30,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:30,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:00:30,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:00:30,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:00:30,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:00:30,384 INFO L87 Difference]: Start difference. First operand 295 states and 442 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:00:30,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:00:30,468 INFO L93 Difference]: Finished difference Result 588 states and 883 transitions. [2025-01-09 16:00:30,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:00:30,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-01-09 16:00:30,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:00:30,471 INFO L225 Difference]: With dead ends: 588 [2025-01-09 16:00:30,471 INFO L226 Difference]: Without dead ends: 296 [2025-01-09 16:00:30,472 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 16:00:30,472 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:00:30,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:00:30,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-01-09 16:00:30,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-01-09 16:00:30,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 255 states have (on average 1.4352941176470588) internal successors, (366), 255 states have internal predecessors, (366), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 16:00:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 442 transitions. [2025-01-09 16:00:30,503 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 442 transitions. Word has length 152 [2025-01-09 16:00:30,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:00:30,503 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 442 transitions. [2025-01-09 16:00:30,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:00:30,503 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 442 transitions. [2025-01-09 16:00:30,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 16:00:30,505 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:30,505 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:00:30,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:00:30,505 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:30,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:30,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1150246755, now seen corresponding path program 1 times [2025-01-09 16:00:30,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:00:30,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991742567] [2025-01-09 16:00:30,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:30,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:00:30,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 16:00:30,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 16:00:30,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:30,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:30,615 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:00:30,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:00:30,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991742567] [2025-01-09 16:00:30,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991742567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:30,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:00:30,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:00:30,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938032140] [2025-01-09 16:00:30,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:30,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:00:30,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:00:30,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:00:30,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:00:30,617 INFO L87 Difference]: Start difference. First operand 296 states and 442 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:00:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:00:30,733 INFO L93 Difference]: Finished difference Result 587 states and 877 transitions. [2025-01-09 16:00:30,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:00:30,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-01-09 16:00:30,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:00:30,735 INFO L225 Difference]: With dead ends: 587 [2025-01-09 16:00:30,736 INFO L226 Difference]: Without dead ends: 294 [2025-01-09 16:00:30,736 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 16:00:30,740 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:00:30,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:00:30,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-01-09 16:00:30,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-01-09 16:00:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 253 states have (on average 1.4229249011857708) internal successors, (360), 253 states have internal predecessors, (360), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 16:00:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 436 transitions. [2025-01-09 16:00:30,773 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 436 transitions. Word has length 152 [2025-01-09 16:00:30,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:00:30,774 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 436 transitions. [2025-01-09 16:00:30,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:00:30,774 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 436 transitions. [2025-01-09 16:00:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:00:30,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:30,776 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:00:30,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:00:30,776 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:30,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:30,777 INFO L85 PathProgramCache]: Analyzing trace with hash -50495770, now seen corresponding path program 1 times [2025-01-09 16:00:30,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:00:30,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796337219] [2025-01-09 16:00:30,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:30,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:00:30,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:00:30,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:00:30,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:30,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 16:00:31,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:00:31,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796337219] [2025-01-09 16:00:31,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796337219] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:00:31,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274810035] [2025-01-09 16:00:31,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:31,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:00:31,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:00:31,025 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:00:31,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:00:31,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:00:31,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:00:31,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:31,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:31,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:00:31,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:00:31,286 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:00:31,286 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:00:31,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274810035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:31,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:00:31,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 16:00:31,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369802473] [2025-01-09 16:00:31,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:31,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:00:31,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:00:31,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:00:31,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:00:31,288 INFO L87 Difference]: Start difference. First operand 294 states and 436 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:00:31,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:00:31,322 INFO L93 Difference]: Finished difference Result 591 states and 877 transitions. [2025-01-09 16:00:31,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:00:31,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 16:00:31,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:00:31,325 INFO L225 Difference]: With dead ends: 591 [2025-01-09 16:00:31,325 INFO L226 Difference]: Without dead ends: 300 [2025-01-09 16:00:31,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 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 16:00:31,326 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 691 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 16:00:31,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 691 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:00:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-01-09 16:00:31,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2025-01-09 16:00:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 259 states have (on average 1.4131274131274132) internal successors, (366), 259 states have internal predecessors, (366), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 16:00:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 442 transitions. [2025-01-09 16:00:31,355 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 442 transitions. Word has length 153 [2025-01-09 16:00:31,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:00:31,356 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 442 transitions. [2025-01-09 16:00:31,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:00:31,356 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 442 transitions. [2025-01-09 16:00:31,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:00:31,358 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:31,358 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:00:31,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:00:31,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:00:31,560 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:31,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:31,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1500913283, now seen corresponding path program 1 times [2025-01-09 16:00:31,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:00:31,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068857100] [2025-01-09 16:00:31,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:31,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:00:31,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:00:31,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:00:31,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:31,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:00:32,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:00:32,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068857100] [2025-01-09 16:00:32,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068857100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:32,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:00:32,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:00:32,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767482110] [2025-01-09 16:00:32,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:32,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:00:32,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:00:32,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:00:32,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:00:32,008 INFO L87 Difference]: Start difference. First operand 300 states and 442 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:00:32,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:00:32,363 INFO L93 Difference]: Finished difference Result 705 states and 1028 transitions. [2025-01-09 16:00:32,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:00:32,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 16:00:32,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:00:32,366 INFO L225 Difference]: With dead ends: 705 [2025-01-09 16:00:32,366 INFO L226 Difference]: Without dead ends: 408 [2025-01-09 16:00:32,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:00:32,370 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 64 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:00:32,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 486 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:00:32,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-01-09 16:00:32,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 404. [2025-01-09 16:00:32,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 353 states have (on average 1.3937677053824362) internal successors, (492), 355 states have internal predecessors, (492), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 16:00:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 584 transitions. [2025-01-09 16:00:32,410 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 584 transitions. Word has length 153 [2025-01-09 16:00:32,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:00:32,411 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 584 transitions. [2025-01-09 16:00:32,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:00:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 584 transitions. [2025-01-09 16:00:32,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:00:32,413 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:32,414 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:00:32,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:00:32,414 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:32,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:32,416 INFO L85 PathProgramCache]: Analyzing trace with hash -914107269, now seen corresponding path program 1 times [2025-01-09 16:00:32,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:00:32,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077671219] [2025-01-09 16:00:32,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:32,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:00:32,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:00:32,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:00:32,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:32,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:00:35,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:00:35,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077671219] [2025-01-09 16:00:35,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077671219] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:35,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:00:35,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:00:35,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317806181] [2025-01-09 16:00:35,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:35,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:00:35,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:00:35,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:00:35,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:00:35,075 INFO L87 Difference]: Start difference. First operand 404 states and 584 transitions. Second operand has 11 states, 7 states have (on average 8.714285714285714) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-01-09 16:00:36,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:00:36,317 INFO L93 Difference]: Finished difference Result 1035 states and 1501 transitions. [2025-01-09 16:00:36,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:00:36,318 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 8.714285714285714) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) Word has length 153 [2025-01-09 16:00:36,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:00:36,323 INFO L225 Difference]: With dead ends: 1035 [2025-01-09 16:00:36,323 INFO L226 Difference]: Without dead ends: 634 [2025-01-09 16:00:36,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:00:36,325 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 78 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:00:36,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 958 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 16:00:36,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-01-09 16:00:36,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 472. [2025-01-09 16:00:36,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 421 states have (on average 1.4251781472684086) internal successors, (600), 423 states have internal predecessors, (600), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 16:00:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 692 transitions. [2025-01-09 16:00:36,358 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 692 transitions. Word has length 153 [2025-01-09 16:00:36,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:00:36,358 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 692 transitions. [2025-01-09 16:00:36,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 8.714285714285714) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-01-09 16:00:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 692 transitions. [2025-01-09 16:00:36,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:00:36,363 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:36,364 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:00:36,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:00:36,364 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:36,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:36,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1514190335, now seen corresponding path program 1 times [2025-01-09 16:00:36,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:00:36,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052753659] [2025-01-09 16:00:36,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:36,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:00:36,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:00:36,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:00:36,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:36,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:00:39,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:00:39,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052753659] [2025-01-09 16:00:39,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052753659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:39,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:00:39,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 16:00:39,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538741733] [2025-01-09 16:00:39,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:39,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:00:39,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:00:39,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:00:39,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:00:39,214 INFO L87 Difference]: Start difference. First operand 472 states and 692 transitions. Second operand has 14 states, 11 states have (on average 5.545454545454546) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:00:41,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:00:41,578 INFO L93 Difference]: Finished difference Result 1449 states and 2111 transitions. [2025-01-09 16:00:41,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 16:00:41,579 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.545454545454546) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-01-09 16:00:41,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:00:41,587 INFO L225 Difference]: With dead ends: 1449 [2025-01-09 16:00:41,588 INFO L226 Difference]: Without dead ends: 980 [2025-01-09 16:00:41,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2025-01-09 16:00:41,592 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 640 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 1895 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:00:41,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 1353 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1895 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 16:00:41,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2025-01-09 16:00:41,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 519. [2025-01-09 16:00:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 468 states have (on average 1.438034188034188) internal successors, (673), 470 states have internal predecessors, (673), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 16:00:41,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 765 transitions. [2025-01-09 16:00:41,657 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 765 transitions. Word has length 153 [2025-01-09 16:00:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:00:41,657 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 765 transitions. [2025-01-09 16:00:41,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.545454545454546) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:00:41,658 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 765 transitions. [2025-01-09 16:00:41,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:00:41,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:41,662 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:00:41,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:00:41,663 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:41,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:41,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1649829033, now seen corresponding path program 1 times [2025-01-09 16:00:41,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:00:41,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42327197] [2025-01-09 16:00:41,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:41,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:00:41,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:00:41,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:00:41,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:41,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:00:41,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:00:41,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42327197] [2025-01-09 16:00:41,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42327197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:41,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:00:41,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:00:41,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894362009] [2025-01-09 16:00:41,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:41,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:00:41,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:00:41,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:00:41,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:00:41,964 INFO L87 Difference]: Start difference. First operand 519 states and 765 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:00:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:00:42,362 INFO L93 Difference]: Finished difference Result 1205 states and 1775 transitions. [2025-01-09 16:00:42,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:00:42,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 16:00:42,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:00:42,368 INFO L225 Difference]: With dead ends: 1205 [2025-01-09 16:00:42,368 INFO L226 Difference]: Without dead ends: 689 [2025-01-09 16:00:42,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:00:42,371 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 74 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:00:42,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 436 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:00:42,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-01-09 16:00:42,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 539. [2025-01-09 16:00:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 488 states have (on average 1.4323770491803278) internal successors, (699), 490 states have internal predecessors, (699), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 16:00:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 791 transitions. [2025-01-09 16:00:42,403 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 791 transitions. Word has length 153 [2025-01-09 16:00:42,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:00:42,404 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 791 transitions. [2025-01-09 16:00:42,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:00:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 791 transitions. [2025-01-09 16:00:42,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:00:42,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:42,406 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:00:42,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:00:42,407 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:42,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:42,408 INFO L85 PathProgramCache]: Analyzing trace with hash 602685893, now seen corresponding path program 1 times [2025-01-09 16:00:42,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:00:42,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655101250] [2025-01-09 16:00:42,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:42,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:00:42,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:00:42,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:00:42,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:42,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:00:43,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:00:43,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655101250] [2025-01-09 16:00:43,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655101250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:43,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:00:43,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:00:43,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5912573] [2025-01-09 16:00:43,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:43,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:00:43,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:00:43,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:00:43,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:00:43,176 INFO L87 Difference]: Start difference. First operand 539 states and 791 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 16:00:43,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:00:43,739 INFO L93 Difference]: Finished difference Result 1302 states and 1889 transitions. [2025-01-09 16:00:43,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:00:43,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2025-01-09 16:00:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:00:43,743 INFO L225 Difference]: With dead ends: 1302 [2025-01-09 16:00:43,744 INFO L226 Difference]: Without dead ends: 766 [2025-01-09 16:00:43,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:00:43,745 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 92 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:00:43,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 535 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:00:43,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-01-09 16:00:43,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 560. [2025-01-09 16:00:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 509 states have (on average 1.4381139489194499) internal successors, (732), 511 states have internal predecessors, (732), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 16:00:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 824 transitions. [2025-01-09 16:00:43,777 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 824 transitions. Word has length 153 [2025-01-09 16:00:43,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:00:43,778 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 824 transitions. [2025-01-09 16:00:43,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 16:00:43,778 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 824 transitions. [2025-01-09 16:00:43,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:00:43,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:43,781 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:00:43,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:00:43,781 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:43,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:43,782 INFO L85 PathProgramCache]: Analyzing trace with hash 540646279, now seen corresponding path program 1 times [2025-01-09 16:00:43,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:00:43,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898346622] [2025-01-09 16:00:43,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:43,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:00:43,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:00:43,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:00:43,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:43,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:00:45,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:00:45,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898346622] [2025-01-09 16:00:45,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898346622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:45,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:00:45,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:00:45,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304421431] [2025-01-09 16:00:45,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:45,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:00:45,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:00:45,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:00:45,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:00:45,749 INFO L87 Difference]: Start difference. First operand 560 states and 824 transitions. Second operand has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:00:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:00:46,942 INFO L93 Difference]: Finished difference Result 1196 states and 1755 transitions. [2025-01-09 16:00:46,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:00:46,942 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-01-09 16:00:46,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:00:46,946 INFO L225 Difference]: With dead ends: 1196 [2025-01-09 16:00:46,946 INFO L226 Difference]: Without dead ends: 639 [2025-01-09 16:00:46,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:00:46,949 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 67 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:00:46,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1147 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 16:00:46,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-01-09 16:00:46,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 562. [2025-01-09 16:00:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 511 states have (on average 1.436399217221135) internal successors, (734), 513 states have internal predecessors, (734), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 16:00:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 826 transitions. [2025-01-09 16:00:46,980 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 826 transitions. Word has length 153 [2025-01-09 16:00:46,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:00:46,981 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 826 transitions. [2025-01-09 16:00:46,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:00:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 826 transitions. [2025-01-09 16:00:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:00:46,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:46,984 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:00:46,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:00:46,984 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:46,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:46,985 INFO L85 PathProgramCache]: Analyzing trace with hash -46159735, now seen corresponding path program 1 times [2025-01-09 16:00:46,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:00:46,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517821178] [2025-01-09 16:00:46,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:46,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:00:47,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:00:47,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:00:47,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:47,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:00:49,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:00:49,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517821178] [2025-01-09 16:00:49,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517821178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:49,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:00:49,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 16:00:49,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303279392] [2025-01-09 16:00:49,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:49,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 16:00:49,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:00:49,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 16:00:49,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:00:49,989 INFO L87 Difference]: Start difference. First operand 562 states and 826 transitions. Second operand has 18 states, 15 states have (on average 4.066666666666666) internal successors, (61), 18 states have internal predecessors, (61), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 16:00:52,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:00:52,672 INFO L93 Difference]: Finished difference Result 1477 states and 2145 transitions. [2025-01-09 16:00:52,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 16:00:52,672 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.066666666666666) internal successors, (61), 18 states have internal predecessors, (61), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) Word has length 153 [2025-01-09 16:00:52,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:00:52,677 INFO L225 Difference]: With dead ends: 1477 [2025-01-09 16:00:52,677 INFO L226 Difference]: Without dead ends: 914 [2025-01-09 16:00:52,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=261, Invalid=929, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 16:00:52,680 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 845 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 2259 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:00:52,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 1906 Invalid, 2406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2259 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 16:00:52,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-01-09 16:00:52,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 561. [2025-01-09 16:00:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 510 states have (on average 1.4294117647058824) internal successors, (729), 512 states have internal predecessors, (729), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 16:00:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 821 transitions. [2025-01-09 16:00:52,710 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 821 transitions. Word has length 153 [2025-01-09 16:00:52,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:00:52,711 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 821 transitions. [2025-01-09 16:00:52,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.066666666666666) internal successors, (61), 18 states have internal predecessors, (61), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 16:00:52,711 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 821 transitions. [2025-01-09 16:00:52,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:00:52,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:52,713 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:00:52,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:00:52,713 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:52,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:52,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1423580359, now seen corresponding path program 1 times [2025-01-09 16:00:52,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:00:52,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553603420] [2025-01-09 16:00:52,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:52,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:00:52,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:00:52,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:00:52,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:52,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:53,949 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:00:53,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:00:53,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553603420] [2025-01-09 16:00:53,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553603420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:53,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:00:53,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:00:53,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490323744] [2025-01-09 16:00:53,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:53,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:00:53,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:00:53,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:00:53,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:00:53,952 INFO L87 Difference]: Start difference. First operand 561 states and 821 transitions. Second operand has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:00:54,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:00:54,530 INFO L93 Difference]: Finished difference Result 1221 states and 1778 transitions. [2025-01-09 16:00:54,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:00:54,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-01-09 16:00:54,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:00:54,535 INFO L225 Difference]: With dead ends: 1221 [2025-01-09 16:00:54,535 INFO L226 Difference]: Without dead ends: 663 [2025-01-09 16:00:54,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 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 16:00:54,538 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 82 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:00:54,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 844 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:00:54,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-01-09 16:00:54,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 559. [2025-01-09 16:00:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 508 states have (on average 1.4271653543307086) internal successors, (725), 510 states have internal predecessors, (725), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 16:00:54,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 817 transitions. [2025-01-09 16:00:54,565 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 817 transitions. Word has length 153 [2025-01-09 16:00:54,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:00:54,565 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 817 transitions. [2025-01-09 16:00:54,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:00:54,565 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 817 transitions. [2025-01-09 16:00:54,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:00:54,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:54,567 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:00:54,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:00:54,567 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:54,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:54,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1004717245, now seen corresponding path program 1 times [2025-01-09 16:00:54,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:00:54,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198766315] [2025-01-09 16:00:54,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:54,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:00:54,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:00:54,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:00:54,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:54,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:55,920 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:00:55,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:00:55,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198766315] [2025-01-09 16:00:55,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198766315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:55,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:00:55,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:00:55,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133302707] [2025-01-09 16:00:55,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:55,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:00:55,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:00:55,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:00:55,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:00:55,922 INFO L87 Difference]: Start difference. First operand 559 states and 817 transitions. Second operand has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:00:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:00:56,796 INFO L93 Difference]: Finished difference Result 1209 states and 1762 transitions. [2025-01-09 16:00:56,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:00:56,797 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-01-09 16:00:56,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:00:56,801 INFO L225 Difference]: With dead ends: 1209 [2025-01-09 16:00:56,801 INFO L226 Difference]: Without dead ends: 653 [2025-01-09 16:00:56,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:00:56,803 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 63 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:00:56,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1286 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 16:00:56,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-01-09 16:00:56,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 577. [2025-01-09 16:00:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 526 states have (on average 1.4277566539923954) internal successors, (751), 528 states have internal predecessors, (751), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 16:00:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 843 transitions. [2025-01-09 16:00:56,831 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 843 transitions. Word has length 153 [2025-01-09 16:00:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:00:56,832 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 843 transitions. [2025-01-09 16:00:56,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:00:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 843 transitions. [2025-01-09 16:00:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:00:56,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:56,834 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:00:56,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:00:56,835 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:56,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:56,835 INFO L85 PathProgramCache]: Analyzing trace with hash -493593211, now seen corresponding path program 1 times [2025-01-09 16:00:56,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:00:56,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167620436] [2025-01-09 16:00:56,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:56,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:00:56,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:00:56,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:00:56,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:56,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat