./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-66.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_fillercode_fillercodestructure_filler-ps-ci_file-66.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 48c0e642396cb981ec97788bf4c6fd139bd12f99e5b4ac8264222e0d2b78e970 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:44:26,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:44:26,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:44:26,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:44:26,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:44:26,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:44:26,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:44:26,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:44:26,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:44:26,595 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:44:26,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:44:26,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:44:26,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:44:26,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:44:26,596 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:44:26,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:44:26,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:44:26,597 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:44:26,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:44:26,597 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:44:26,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:44:26,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:44:26,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:44:26,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:44:26,597 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:44:26,597 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:44:26,597 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:44:26,597 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:44:26,597 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:44:26,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:44:26,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:44:26,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:44:26,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:44:26,598 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:44:26,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:44:26,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:44:26,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:44:26,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:44:26,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:44:26,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:44:26,599 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:44:26,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:44:26,599 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:44:26,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:44:26,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:44:26,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:44:26,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:44:26,599 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:44:26,599 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 -> 48c0e642396cb981ec97788bf4c6fd139bd12f99e5b4ac8264222e0d2b78e970 [2025-01-09 11:44:26,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:44:26,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:44:26,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:44:26,882 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:44:26,882 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:44:26,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-66.i [2025-01-09 11:44:28,070 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4f2c306f/231fd3348e994b74b2af2584fd37998a/FLAGf444dd240 [2025-01-09 11:44:28,367 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:44:28,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-66.i [2025-01-09 11:44:28,374 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4f2c306f/231fd3348e994b74b2af2584fd37998a/FLAGf444dd240 [2025-01-09 11:44:28,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4f2c306f/231fd3348e994b74b2af2584fd37998a [2025-01-09 11:44:28,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:44:28,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:44:28,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:44:28,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:44:28,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:44:28,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:44:28" (1/1) ... [2025-01-09 11:44:28,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6812484a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:44:28, skipping insertion in model container [2025-01-09 11:44:28,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:44:28" (1/1) ... [2025-01-09 11:44:28,691 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:44:28,816 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_fillercode_fillercodestructure_filler-ps-ci_file-66.i[919,932] [2025-01-09 11:44:28,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:44:28,901 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:44:28,909 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_fillercode_fillercodestructure_filler-ps-ci_file-66.i[919,932] [2025-01-09 11:44:28,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:44:28,951 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:44:28,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:44:28 WrapperNode [2025-01-09 11:44:28,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:44:28,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:44:28,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:44:28,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:44:28,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:44:28" (1/1) ... [2025-01-09 11:44:28,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:44:28" (1/1) ... [2025-01-09 11:44:28,999 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2025-01-09 11:44:28,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:44:29,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:44:29,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:44:29,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:44:29,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:44:28" (1/1) ... [2025-01-09 11:44:29,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:44:28" (1/1) ... [2025-01-09 11:44:29,018 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:44:28" (1/1) ... [2025-01-09 11:44:29,038 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 11:44:29,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:44:28" (1/1) ... [2025-01-09 11:44:29,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:44:28" (1/1) ... [2025-01-09 11:44:29,043 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:44:28" (1/1) ... [2025-01-09 11:44:29,044 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:44:28" (1/1) ... [2025-01-09 11:44:29,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:44:28" (1/1) ... [2025-01-09 11:44:29,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:44:28" (1/1) ... [2025-01-09 11:44:29,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:44:28" (1/1) ... [2025-01-09 11:44:29,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:44:29,050 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:44:29,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:44:29,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:44:29,051 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:44:28" (1/1) ... [2025-01-09 11:44:29,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:44:29,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:44:29,084 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 11:44:29,089 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 11:44:29,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:44:29,105 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:44:29,105 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:44:29,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:44:29,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:44:29,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:44:29,169 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:44:29,171 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:44:29,409 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 11:44:29,410 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:44:29,417 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:44:29,418 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:44:29,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:44:29 BoogieIcfgContainer [2025-01-09 11:44:29,418 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:44:29,420 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:44:29,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:44:29,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:44:29,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:44:28" (1/3) ... [2025-01-09 11:44:29,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e3a8c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:44:29, skipping insertion in model container [2025-01-09 11:44:29,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:44:28" (2/3) ... [2025-01-09 11:44:29,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e3a8c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:44:29, skipping insertion in model container [2025-01-09 11:44:29,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:44:29" (3/3) ... [2025-01-09 11:44:29,425 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-66.i [2025-01-09 11:44:29,435 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:44:29,436 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-66.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:44:29,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:44:29,478 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;@397c98b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:44:29,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:44:29,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 11:44:29,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 11:44:29,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:44:29,489 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:44:29,489 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:44:29,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:44:29,493 INFO L85 PathProgramCache]: Analyzing trace with hash 548536889, now seen corresponding path program 1 times [2025-01-09 11:44:29,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:44:29,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000844486] [2025-01-09 11:44:29,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:44:29,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:44:29,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 11:44:29,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 11:44:29,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:44:29,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:44:29,715 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 11:44:29,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:44:29,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000844486] [2025-01-09 11:44:29,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000844486] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:44:29,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644354990] [2025-01-09 11:44:29,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:44:29,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:44:29,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:44:29,719 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 11:44:29,720 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 11:44:29,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 11:44:29,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 11:44:29,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:44:29,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:44:29,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:44:29,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:44:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 11:44:29,858 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:44:29,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644354990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:44:29,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:44:29,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:44:29,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785588994] [2025-01-09 11:44:29,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:44:29,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:44:29,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:44:29,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:44:29,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:44:29,877 INFO L87 Difference]: Start difference. First operand has 81 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:44:29,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:44:29,894 INFO L93 Difference]: Finished difference Result 156 states and 271 transitions. [2025-01-09 11:44:29,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:44:29,895 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 150 [2025-01-09 11:44:29,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:44:29,899 INFO L225 Difference]: With dead ends: 156 [2025-01-09 11:44:29,900 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 11:44:29,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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 11:44:29,904 INFO L435 NwaCegarLoop]: 122 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, 122 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 11:44:29,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:44:29,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 11:44:29,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-09 11:44:29,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 11:44:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 122 transitions. [2025-01-09 11:44:29,931 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 122 transitions. Word has length 150 [2025-01-09 11:44:29,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:44:29,931 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 122 transitions. [2025-01-09 11:44:29,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:44:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 122 transitions. [2025-01-09 11:44:29,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 11:44:29,933 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:44:29,933 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:44:29,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 11:44:30,135 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 11:44:30,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:44:30,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:44:30,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1068577725, now seen corresponding path program 1 times [2025-01-09 11:44:30,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:44:30,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78742260] [2025-01-09 11:44:30,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:44:30,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:44:30,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 11:44:30,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 11:44:30,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:44:30,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:44:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:44:30,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:44:30,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78742260] [2025-01-09 11:44:30,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78742260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:44:30,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:44:30,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:44:30,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106032322] [2025-01-09 11:44:30,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:44:30,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:44:30,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:44:30,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:44:30,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:44:30,477 INFO L87 Difference]: Start difference. First operand 78 states and 122 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:44:30,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:44:30,614 INFO L93 Difference]: Finished difference Result 207 states and 325 transitions. [2025-01-09 11:44:30,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:44:30,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 150 [2025-01-09 11:44:30,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:44:30,617 INFO L225 Difference]: With dead ends: 207 [2025-01-09 11:44:30,619 INFO L226 Difference]: Without dead ends: 132 [2025-01-09 11:44:30,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:44:30,620 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 207 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:44:30,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 214 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:44:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-01-09 11:44:30,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2025-01-09 11:44:30,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 95 states have internal predecessors, (138), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 11:44:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 202 transitions. [2025-01-09 11:44:30,645 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 202 transitions. Word has length 150 [2025-01-09 11:44:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:44:30,645 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 202 transitions. [2025-01-09 11:44:30,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:44:30,646 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 202 transitions. [2025-01-09 11:44:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 11:44:30,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:44:30,649 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:44:30,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:44:30,649 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:44:30,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:44:30,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1491279551, now seen corresponding path program 1 times [2025-01-09 11:44:30,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:44:30,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293911126] [2025-01-09 11:44:30,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:44:30,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:44:30,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 11:44:30,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 11:44:30,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:44:30,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:44:31,038 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:44:31,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:44:31,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293911126] [2025-01-09 11:44:31,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293911126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:44:31,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:44:31,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:44:31,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045877616] [2025-01-09 11:44:31,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:44:31,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:44:31,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:44:31,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:44:31,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:44:31,040 INFO L87 Difference]: Start difference. First operand 129 states and 202 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:44:31,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:44:31,183 INFO L93 Difference]: Finished difference Result 371 states and 593 transitions. [2025-01-09 11:44:31,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:44:31,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-01-09 11:44:31,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:44:31,188 INFO L225 Difference]: With dead ends: 371 [2025-01-09 11:44:31,188 INFO L226 Difference]: Without dead ends: 245 [2025-01-09 11:44:31,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:44:31,189 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 111 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:44:31,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 287 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:44:31,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-01-09 11:44:31,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 179. [2025-01-09 11:44:31,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 121 states have (on average 1.4049586776859504) internal successors, (170), 122 states have internal predecessors, (170), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 11:44:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 278 transitions. [2025-01-09 11:44:31,232 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 278 transitions. Word has length 150 [2025-01-09 11:44:31,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:44:31,232 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 278 transitions. [2025-01-09 11:44:31,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:44:31,232 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 278 transitions. [2025-01-09 11:44:31,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 11:44:31,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:44:31,234 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:44:31,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:44:31,234 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:44:31,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:44:31,234 INFO L85 PathProgramCache]: Analyzing trace with hash 470481243, now seen corresponding path program 1 times [2025-01-09 11:44:31,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:44:31,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050148209] [2025-01-09 11:44:31,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:44:31,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:44:31,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 11:44:31,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 11:44:31,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:44:31,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:44:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:44:34,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:44:34,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050148209] [2025-01-09 11:44:34,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050148209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:44:34,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:44:34,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 11:44:34,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51418185] [2025-01-09 11:44:34,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:44:34,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:44:34,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:44:34,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:44:34,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:44:34,736 INFO L87 Difference]: Start difference. First operand 179 states and 278 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:44:35,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:44:35,629 INFO L93 Difference]: Finished difference Result 497 states and 737 transitions. [2025-01-09 11:44:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 11:44:35,630 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-01-09 11:44:35,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:44:35,632 INFO L225 Difference]: With dead ends: 497 [2025-01-09 11:44:35,632 INFO L226 Difference]: Without dead ends: 371 [2025-01-09 11:44:35,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2025-01-09 11:44:35,633 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 370 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:44:35,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 683 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 11:44:35,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-01-09 11:44:35,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 269. [2025-01-09 11:44:35,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 201 states have (on average 1.427860696517413) internal successors, (287), 204 states have internal predecessors, (287), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 11:44:35,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 407 transitions. [2025-01-09 11:44:35,658 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 407 transitions. Word has length 151 [2025-01-09 11:44:35,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:44:35,658 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 407 transitions. [2025-01-09 11:44:35,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:44:35,659 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 407 transitions. [2025-01-09 11:44:35,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 11:44:35,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:44:35,660 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:44:35,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:44:35,660 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:44:35,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:44:35,661 INFO L85 PathProgramCache]: Analyzing trace with hash 472328285, now seen corresponding path program 1 times [2025-01-09 11:44:35,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:44:35,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804809255] [2025-01-09 11:44:35,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:44:35,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:44:35,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 11:44:35,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 11:44:35,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:44:35,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:44:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:44:38,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:44:38,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804809255] [2025-01-09 11:44:38,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804809255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:44:38,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:44:38,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 11:44:38,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676637889] [2025-01-09 11:44:38,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:44:38,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:44:38,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:44:38,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:44:38,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:44:38,966 INFO L87 Difference]: Start difference. First operand 269 states and 407 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:44:40,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:44:40,541 INFO L93 Difference]: Finished difference Result 896 states and 1318 transitions. [2025-01-09 11:44:40,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 11:44:40,542 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-01-09 11:44:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:44:40,545 INFO L225 Difference]: With dead ends: 896 [2025-01-09 11:44:40,545 INFO L226 Difference]: Without dead ends: 688 [2025-01-09 11:44:40,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-01-09 11:44:40,546 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 168 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:44:40,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 906 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:44:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-01-09 11:44:40,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 333. [2025-01-09 11:44:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 260 states have (on average 1.4307692307692308) internal successors, (372), 264 states have internal predecessors, (372), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 11:44:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 500 transitions. [2025-01-09 11:44:40,579 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 500 transitions. Word has length 151 [2025-01-09 11:44:40,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:44:40,580 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 500 transitions. [2025-01-09 11:44:40,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:44:40,580 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 500 transitions. [2025-01-09 11:44:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 11:44:40,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:44:40,583 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:44:40,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:44:40,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:44:40,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:44:40,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1150539613, now seen corresponding path program 1 times [2025-01-09 11:44:40,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:44:40,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890776767] [2025-01-09 11:44:40,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:44:40,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:44:40,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 11:44:40,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 11:44:40,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:44:40,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:44:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:44:43,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:44:43,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890776767] [2025-01-09 11:44:43,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890776767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:44:43,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:44:43,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 11:44:43,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619630860] [2025-01-09 11:44:43,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:44:43,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:44:43,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:44:43,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:44:43,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:44:43,487 INFO L87 Difference]: Start difference. First operand 333 states and 500 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:44:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:44:44,315 INFO L93 Difference]: Finished difference Result 487 states and 697 transitions. [2025-01-09 11:44:44,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 11:44:44,316 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-01-09 11:44:44,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:44:44,318 INFO L225 Difference]: With dead ends: 487 [2025-01-09 11:44:44,318 INFO L226 Difference]: Without dead ends: 485 [2025-01-09 11:44:44,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2025-01-09 11:44:44,319 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 417 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:44:44,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 647 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 11:44:44,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-01-09 11:44:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 337. [2025-01-09 11:44:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 264 states have (on average 1.4318181818181819) internal successors, (378), 268 states have internal predecessors, (378), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 11:44:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 506 transitions. [2025-01-09 11:44:44,338 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 506 transitions. Word has length 151 [2025-01-09 11:44:44,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:44:44,339 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 506 transitions. [2025-01-09 11:44:44,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:44:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 506 transitions. [2025-01-09 11:44:44,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 11:44:44,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:44:44,341 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:44:44,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 11:44:44,341 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:44:44,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:44:44,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1152386655, now seen corresponding path program 1 times [2025-01-09 11:44:44,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:44:44,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900976595] [2025-01-09 11:44:44,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:44:44,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:44:44,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 11:44:44,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 11:44:44,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:44:44,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:45:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:45:10,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:45:10,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900976595] [2025-01-09 11:45:10,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900976595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:45:10,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:45:10,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 11:45:10,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450235820] [2025-01-09 11:45:10,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:45:10,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 11:45:10,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:45:10,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 11:45:10,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:45:10,818 INFO L87 Difference]: Start difference. First operand 337 states and 506 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:45:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:45:12,282 INFO L93 Difference]: Finished difference Result 474 states and 684 transitions. [2025-01-09 11:45:12,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 11:45:12,283 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-01-09 11:45:12,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:45:12,285 INFO L225 Difference]: With dead ends: 474 [2025-01-09 11:45:12,285 INFO L226 Difference]: Without dead ends: 472 [2025-01-09 11:45:12,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2025-01-09 11:45:12,286 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 349 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:45:12,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 613 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 11:45:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-01-09 11:45:12,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 336. [2025-01-09 11:45:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 263 states have (on average 1.429657794676806) internal successors, (376), 267 states have internal predecessors, (376), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 11:45:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 504 transitions. [2025-01-09 11:45:12,319 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 504 transitions. Word has length 151 [2025-01-09 11:45:12,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:45:12,319 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 504 transitions. [2025-01-09 11:45:12,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:45:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 504 transitions. [2025-01-09 11:45:12,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 11:45:12,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:45:12,321 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:12,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 11:45:12,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:45:12,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:45:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash 728646681, now seen corresponding path program 1 times [2025-01-09 11:45:12,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:45:12,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046556026] [2025-01-09 11:45:12,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:45:12,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:45:12,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 11:45:12,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 11:45:12,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:45:12,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:45:12,372 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:45:12,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:45:12,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046556026] [2025-01-09 11:45:12,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046556026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:45:12,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:45:12,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:45:12,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786479654] [2025-01-09 11:45:12,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:45:12,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:45:12,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:45:12,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:45:12,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:45:12,377 INFO L87 Difference]: Start difference. First operand 336 states and 504 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:45:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:45:12,451 INFO L93 Difference]: Finished difference Result 824 states and 1250 transitions. [2025-01-09 11:45:12,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:45:12,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-01-09 11:45:12,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:45:12,457 INFO L225 Difference]: With dead ends: 824 [2025-01-09 11:45:12,460 INFO L226 Difference]: Without dead ends: 549 [2025-01-09 11:45:12,461 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 11:45:12,462 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 105 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:45:12,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 324 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:45:12,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-01-09 11:45:12,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 547. [2025-01-09 11:45:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 427 states have (on average 1.3817330210772834) internal successors, (590), 435 states have internal predecessors, (590), 106 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (106), 98 states have call predecessors, (106), 106 states have call successors, (106) [2025-01-09 11:45:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 802 transitions. [2025-01-09 11:45:12,507 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 802 transitions. Word has length 151 [2025-01-09 11:45:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:45:12,507 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 802 transitions. [2025-01-09 11:45:12,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:45:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 802 transitions. [2025-01-09 11:45:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 11:45:12,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:45:12,514 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:12,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 11:45:12,514 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:45:12,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:45:12,514 INFO L85 PathProgramCache]: Analyzing trace with hash -80699945, now seen corresponding path program 1 times [2025-01-09 11:45:12,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:45:12,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391134454] [2025-01-09 11:45:12,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:45:12,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:45:12,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 11:45:12,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 11:45:12,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:45:12,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:45:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:45:12,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:45:12,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391134454] [2025-01-09 11:45:12,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391134454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:45:12,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:45:12,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:45:12,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504718018] [2025-01-09 11:45:12,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:45:12,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:45:12,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:45:12,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:45:12,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:45:12,582 INFO L87 Difference]: Start difference. First operand 547 states and 802 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:45:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:45:12,768 INFO L93 Difference]: Finished difference Result 1411 states and 2054 transitions. [2025-01-09 11:45:12,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:45:12,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-01-09 11:45:12,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:45:12,774 INFO L225 Difference]: With dead ends: 1411 [2025-01-09 11:45:12,774 INFO L226 Difference]: Without dead ends: 925 [2025-01-09 11:45:12,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:45:12,775 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 91 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:45:12,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 382 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:45:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-01-09 11:45:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 823. [2025-01-09 11:45:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 656 states have (on average 1.391768292682927) internal successors, (913), 668 states have internal predecessors, (913), 148 states have call successors, (148), 18 states have call predecessors, (148), 18 states have return successors, (148), 136 states have call predecessors, (148), 148 states have call successors, (148) [2025-01-09 11:45:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1209 transitions. [2025-01-09 11:45:12,835 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1209 transitions. Word has length 151 [2025-01-09 11:45:12,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:45:12,835 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1209 transitions. [2025-01-09 11:45:12,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:45:12,835 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1209 transitions. [2025-01-09 11:45:12,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 11:45:12,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:45:12,837 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:12,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 11:45:12,837 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:45:12,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:45:12,838 INFO L85 PathProgramCache]: Analyzing trace with hash 599358425, now seen corresponding path program 1 times [2025-01-09 11:45:12,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:45:12,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032984893] [2025-01-09 11:45:12,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:45:12,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:45:12,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 11:45:12,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 11:45:12,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:45:12,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:45:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:45:12,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:45:12,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032984893] [2025-01-09 11:45:12,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032984893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:45:12,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:45:12,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 11:45:12,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334364484] [2025-01-09 11:45:12,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:45:12,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 11:45:12,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:45:12,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 11:45:12,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:45:12,952 INFO L87 Difference]: Start difference. First operand 823 states and 1209 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:45:13,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:45:13,331 INFO L93 Difference]: Finished difference Result 1974 states and 2859 transitions. [2025-01-09 11:45:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:45:13,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-01-09 11:45:13,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:45:13,336 INFO L225 Difference]: With dead ends: 1974 [2025-01-09 11:45:13,336 INFO L226 Difference]: Without dead ends: 1259 [2025-01-09 11:45:13,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:45:13,341 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 289 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:45:13,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 468 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:45:13,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2025-01-09 11:45:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1210. [2025-01-09 11:45:13,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 968 states have (on average 1.3791322314049588) internal successors, (1335), 988 states have internal predecessors, (1335), 210 states have call successors, (210), 31 states have call predecessors, (210), 31 states have return successors, (210), 190 states have call predecessors, (210), 210 states have call successors, (210) [2025-01-09 11:45:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1755 transitions. [2025-01-09 11:45:13,418 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1755 transitions. Word has length 151 [2025-01-09 11:45:13,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:45:13,419 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1755 transitions. [2025-01-09 11:45:13,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:45:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1755 transitions. [2025-01-09 11:45:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 11:45:13,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:45:13,421 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:13,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 11:45:13,421 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:45:13,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:45:13,422 INFO L85 PathProgramCache]: Analyzing trace with hash -116324771, now seen corresponding path program 1 times [2025-01-09 11:45:13,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:45:13,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671472372] [2025-01-09 11:45:13,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:45:13,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:45:13,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 11:45:13,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 11:45:13,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:45:13,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:45:13,663 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:45:13,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:45:13,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671472372] [2025-01-09 11:45:13,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671472372] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:45:13,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:45:13,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 11:45:13,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804908741] [2025-01-09 11:45:13,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:45:13,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 11:45:13,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:45:13,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 11:45:13,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:45:13,665 INFO L87 Difference]: Start difference. First operand 1210 states and 1755 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:45:14,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:45:14,075 INFO L93 Difference]: Finished difference Result 2646 states and 3740 transitions. [2025-01-09 11:45:14,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 11:45:14,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 151 [2025-01-09 11:45:14,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:45:14,082 INFO L225 Difference]: With dead ends: 2646 [2025-01-09 11:45:14,082 INFO L226 Difference]: Without dead ends: 1545 [2025-01-09 11:45:14,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:45:14,086 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 290 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:45:14,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 257 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:45:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2025-01-09 11:45:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1275. [2025-01-09 11:45:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 999 states have (on average 1.3383383383383383) internal successors, (1337), 1023 states have internal predecessors, (1337), 234 states have call successors, (234), 41 states have call predecessors, (234), 41 states have return successors, (234), 210 states have call predecessors, (234), 234 states have call successors, (234) [2025-01-09 11:45:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1805 transitions. [2025-01-09 11:45:14,173 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1805 transitions. Word has length 151 [2025-01-09 11:45:14,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:45:14,174 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 1805 transitions. [2025-01-09 11:45:14,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:45:14,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1805 transitions. [2025-01-09 11:45:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 11:45:14,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:45:14,176 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:14,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 11:45:14,176 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:45:14,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:45:14,176 INFO L85 PathProgramCache]: Analyzing trace with hash 380365124, now seen corresponding path program 1 times [2025-01-09 11:45:14,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:45:14,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528178596] [2025-01-09 11:45:14,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:45:14,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:45:14,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 11:45:14,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 11:45:14,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:45:14,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:45:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:45:14,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:45:14,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528178596] [2025-01-09 11:45:14,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528178596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:45:14,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:45:14,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:45:14,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118599647] [2025-01-09 11:45:14,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:45:14,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:45:14,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:45:14,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:45:14,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:45:14,220 INFO L87 Difference]: Start difference. First operand 1275 states and 1805 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:45:14,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:45:14,339 INFO L93 Difference]: Finished difference Result 2850 states and 4024 transitions. [2025-01-09 11:45:14,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:45:14,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-01-09 11:45:14,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:45:14,347 INFO L225 Difference]: With dead ends: 2850 [2025-01-09 11:45:14,347 INFO L226 Difference]: Without dead ends: 1667 [2025-01-09 11:45:14,349 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 11:45:14,350 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 78 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:45:14,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 257 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:45:14,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2025-01-09 11:45:14,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1305. [2025-01-09 11:45:14,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 1028 states have (on average 1.3482490272373542) internal successors, (1386), 1052 states have internal predecessors, (1386), 234 states have call successors, (234), 42 states have call predecessors, (234), 42 states have return successors, (234), 210 states have call predecessors, (234), 234 states have call successors, (234) [2025-01-09 11:45:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1854 transitions. [2025-01-09 11:45:14,446 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1854 transitions. Word has length 152 [2025-01-09 11:45:14,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:45:14,446 INFO L471 AbstractCegarLoop]: Abstraction has 1305 states and 1854 transitions. [2025-01-09 11:45:14,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:45:14,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1854 transitions. [2025-01-09 11:45:14,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 11:45:14,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:45:14,448 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:14,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 11:45:14,449 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:45:14,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:45:14,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1308578618, now seen corresponding path program 1 times [2025-01-09 11:45:14,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:45:14,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877997918] [2025-01-09 11:45:14,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:45:14,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:45:14,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 11:45:14,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 11:45:14,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:45:14,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:45:14,568 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:45:14,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:45:14,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877997918] [2025-01-09 11:45:14,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877997918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:45:14,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:45:14,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:45:14,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176711311] [2025-01-09 11:45:14,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:45:14,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:45:14,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:45:14,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:45:14,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:45:14,571 INFO L87 Difference]: Start difference. First operand 1305 states and 1854 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:45:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:45:14,765 INFO L93 Difference]: Finished difference Result 3159 states and 4495 transitions. [2025-01-09 11:45:14,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:45:14,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-01-09 11:45:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:45:14,774 INFO L225 Difference]: With dead ends: 3159 [2025-01-09 11:45:14,775 INFO L226 Difference]: Without dead ends: 2281 [2025-01-09 11:45:14,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:45:14,779 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 131 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:45:14,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 460 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:45:14,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2025-01-09 11:45:14,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 2009. [2025-01-09 11:45:14,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2009 states, 1578 states have (on average 1.347275031685678) internal successors, (2126), 1618 states have internal predecessors, (2126), 366 states have call successors, (366), 64 states have call predecessors, (366), 64 states have return successors, (366), 326 states have call predecessors, (366), 366 states have call successors, (366) [2025-01-09 11:45:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 2858 transitions. [2025-01-09 11:45:14,912 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 2858 transitions. Word has length 152 [2025-01-09 11:45:14,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:45:14,912 INFO L471 AbstractCegarLoop]: Abstraction has 2009 states and 2858 transitions. [2025-01-09 11:45:14,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:45:14,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2858 transitions. [2025-01-09 11:45:14,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 11:45:14,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:45:14,915 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:14,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 11:45:14,915 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:45:14,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:45:14,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1179701436, now seen corresponding path program 1 times [2025-01-09 11:45:14,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:45:14,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566124440] [2025-01-09 11:45:14,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:45:14,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:45:14,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 11:45:14,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 11:45:14,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:45:14,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:45:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:45:17,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:45:17,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566124440] [2025-01-09 11:45:17,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566124440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:45:17,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:45:17,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 11:45:17,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648329607] [2025-01-09 11:45:17,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:45:17,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 11:45:17,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:45:17,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 11:45:17,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:45:17,311 INFO L87 Difference]: Start difference. First operand 2009 states and 2858 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-01-09 11:45:19,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:45:19,175 INFO L93 Difference]: Finished difference Result 2461 states and 3419 transitions. [2025-01-09 11:45:19,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 11:45:19,176 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 152 [2025-01-09 11:45:19,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:45:19,186 INFO L225 Difference]: With dead ends: 2461 [2025-01-09 11:45:19,186 INFO L226 Difference]: Without dead ends: 2459 [2025-01-09 11:45:19,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=251, Invalid=505, Unknown=0, NotChecked=0, Total=756 [2025-01-09 11:45:19,188 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 703 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:45:19,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 826 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:45:19,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2025-01-09 11:45:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2217. [2025-01-09 11:45:19,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 1747 states have (on average 1.3405838580423584) internal successors, (2342), 1792 states have internal predecessors, (2342), 396 states have call successors, (396), 73 states have call predecessors, (396), 73 states have return successors, (396), 351 states have call predecessors, (396), 396 states have call successors, (396) [2025-01-09 11:45:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 3134 transitions. [2025-01-09 11:45:19,337 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 3134 transitions. Word has length 152 [2025-01-09 11:45:19,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:45:19,338 INFO L471 AbstractCegarLoop]: Abstraction has 2217 states and 3134 transitions. [2025-01-09 11:45:19,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-01-09 11:45:19,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 3134 transitions. [2025-01-09 11:45:19,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 11:45:19,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:45:19,341 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:19,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 11:45:19,341 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:45:19,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:45:19,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1177854394, now seen corresponding path program 1 times [2025-01-09 11:45:19,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:45:19,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805593372] [2025-01-09 11:45:19,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:45:19,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:45:19,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 11:45:19,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 11:45:19,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:45:19,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:45:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:45:21,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:45:21,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805593372] [2025-01-09 11:45:21,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805593372] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:45:21,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:45:21,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 11:45:21,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311778491] [2025-01-09 11:45:21,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:45:21,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 11:45:21,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:45:21,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 11:45:21,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:45:21,804 INFO L87 Difference]: Start difference. First operand 2217 states and 3134 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:45:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:45:23,466 INFO L93 Difference]: Finished difference Result 2701 states and 3702 transitions. [2025-01-09 11:45:23,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 11:45:23,467 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-01-09 11:45:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:45:23,476 INFO L225 Difference]: With dead ends: 2701 [2025-01-09 11:45:23,476 INFO L226 Difference]: Without dead ends: 2699 [2025-01-09 11:45:23,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:45:23,478 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 184 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 11:45:23,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 810 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 11:45:23,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2025-01-09 11:45:23,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2284. [2025-01-09 11:45:23,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 1808 states have (on average 1.3384955752212389) internal successors, (2420), 1855 states have internal predecessors, (2420), 400 states have call successors, (400), 75 states have call predecessors, (400), 75 states have return successors, (400), 353 states have call predecessors, (400), 400 states have call successors, (400) [2025-01-09 11:45:23,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3220 transitions. [2025-01-09 11:45:23,628 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3220 transitions. Word has length 152 [2025-01-09 11:45:23,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:45:23,628 INFO L471 AbstractCegarLoop]: Abstraction has 2284 states and 3220 transitions. [2025-01-09 11:45:23,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:45:23,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3220 transitions. [2025-01-09 11:45:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 11:45:23,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:45:23,631 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:23,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 11:45:23,631 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:45:23,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:45:23,631 INFO L85 PathProgramCache]: Analyzing trace with hash 728097024, now seen corresponding path program 1 times [2025-01-09 11:45:23,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:45:23,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465433956] [2025-01-09 11:45:23,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:45:23,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:45:23,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 11:45:23,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 11:45:23,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:45:23,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:45:25,942 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:45:25,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:45:25,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465433956] [2025-01-09 11:45:25,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465433956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:45:25,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:45:25,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 11:45:25,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952469104] [2025-01-09 11:45:25,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:45:25,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 11:45:25,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:45:25,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 11:45:25,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:45:25,944 INFO L87 Difference]: Start difference. First operand 2284 states and 3220 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:45:27,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:45:27,079 INFO L93 Difference]: Finished difference Result 2547 states and 3514 transitions. [2025-01-09 11:45:27,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 11:45:27,080 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-01-09 11:45:27,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:45:27,090 INFO L225 Difference]: With dead ends: 2547 [2025-01-09 11:45:27,091 INFO L226 Difference]: Without dead ends: 2545 [2025-01-09 11:45:27,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:45:27,093 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 345 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:45:27,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 807 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 11:45:27,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2545 states. [2025-01-09 11:45:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2545 to 2130. [2025-01-09 11:45:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2130 states, 1685 states have (on average 1.3394658753709199) internal successors, (2257), 1728 states have internal predecessors, (2257), 372 states have call successors, (372), 72 states have call predecessors, (372), 72 states have return successors, (372), 329 states have call predecessors, (372), 372 states have call successors, (372) [2025-01-09 11:45:27,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 3001 transitions. [2025-01-09 11:45:27,257 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 3001 transitions. Word has length 152 [2025-01-09 11:45:27,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:45:27,258 INFO L471 AbstractCegarLoop]: Abstraction has 2130 states and 3001 transitions. [2025-01-09 11:45:27,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:45:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 3001 transitions. [2025-01-09 11:45:27,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 11:45:27,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:45:27,261 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:27,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 11:45:27,261 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:45:27,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:45:27,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1442592124, now seen corresponding path program 1 times [2025-01-09 11:45:27,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:45:27,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19425945] [2025-01-09 11:45:27,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:45:27,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:45:27,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 11:45:27,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 11:45:27,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:45:27,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:45:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:45:49,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:45:49,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19425945] [2025-01-09 11:45:49,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19425945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:45:49,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:45:49,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-01-09 11:45:49,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131269431] [2025-01-09 11:45:49,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:45:49,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 11:45:49,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:45:49,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 11:45:49,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-01-09 11:45:49,473 INFO L87 Difference]: Start difference. First operand 2130 states and 3001 transitions. Second operand has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-01-09 11:45:52,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:45:52,396 INFO L93 Difference]: Finished difference Result 4630 states and 6430 transitions. [2025-01-09 11:45:52,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 11:45:52,397 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 152 [2025-01-09 11:45:52,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:45:52,406 INFO L225 Difference]: With dead ends: 4630 [2025-01-09 11:45:52,407 INFO L226 Difference]: Without dead ends: 2659 [2025-01-09 11:45:52,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=323, Invalid=937, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 11:45:52,411 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 661 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:45:52,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 947 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 11:45:52,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2659 states. [2025-01-09 11:45:52,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2659 to 2380. [2025-01-09 11:45:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 1878 states have (on average 1.33493077742279) internal successors, (2507), 1925 states have internal predecessors, (2507), 412 states have call successors, (412), 89 states have call predecessors, (412), 89 states have return successors, (412), 365 states have call predecessors, (412), 412 states have call successors, (412) [2025-01-09 11:45:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3331 transitions. [2025-01-09 11:45:52,716 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3331 transitions. Word has length 152 [2025-01-09 11:45:52,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:45:52,717 INFO L471 AbstractCegarLoop]: Abstraction has 2380 states and 3331 transitions. [2025-01-09 11:45:52,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-01-09 11:45:52,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3331 transitions. [2025-01-09 11:45:52,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 11:45:52,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:45:52,720 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:52,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 11:45:52,720 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:45:52,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:45:52,720 INFO L85 PathProgramCache]: Analyzing trace with hash -762533754, now seen corresponding path program 1 times [2025-01-09 11:45:52,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:45:52,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971771518] [2025-01-09 11:45:52,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:45:52,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:45:52,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 11:45:52,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 11:45:52,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:45:52,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat