./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-45.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-pe-ci_file-45.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 bbb30f5a716e95823cb1372888b0a3f5fc4a46205d14c7acf98f1ada42093098 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:27:18,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:27:19,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:27:19,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:27:19,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:27:19,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:27:19,077 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:27:19,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:27:19,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:27:19,077 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:27:19,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:27:19,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:27:19,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:27:19,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:27:19,078 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:27:19,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:27:19,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:27:19,078 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:27:19,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:27:19,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:27:19,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:27:19,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:27:19,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:27:19,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:27:19,079 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:27:19,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:27:19,079 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:27:19,079 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:27:19,079 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:27:19,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:27:19,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:27:19,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:27:19,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:27:19,080 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:27:19,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:27:19,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:27:19,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:27:19,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:27:19,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:27:19,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:27:19,080 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:27:19,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:27:19,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:27:19,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:27:19,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:27:19,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:27:19,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:27:19,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:27:19,081 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 -> bbb30f5a716e95823cb1372888b0a3f5fc4a46205d14c7acf98f1ada42093098 [2025-01-09 10:27:19,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:27:19,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:27:19,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:27:19,284 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:27:19,285 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:27:19,285 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-pe-ci_file-45.i [2025-01-09 10:27:20,472 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74037e0f1/3b29e83db9554f64899afaff345b6710/FLAG633032bb9 [2025-01-09 10:27:20,746 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:27:20,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-45.i [2025-01-09 10:27:20,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74037e0f1/3b29e83db9554f64899afaff345b6710/FLAG633032bb9 [2025-01-09 10:27:21,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74037e0f1/3b29e83db9554f64899afaff345b6710 [2025-01-09 10:27:21,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:27:21,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:27:21,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:27:21,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:27:21,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:27:21,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:27:21" (1/1) ... [2025-01-09 10:27:21,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12bdde71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:27:21, skipping insertion in model container [2025-01-09 10:27:21,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:27:21" (1/1) ... [2025-01-09 10:27:21,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:27:21,169 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-pe-ci_file-45.i[919,932] [2025-01-09 10:27:21,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:27:21,226 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:27:21,236 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-pe-ci_file-45.i[919,932] [2025-01-09 10:27:21,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:27:21,300 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:27:21,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:27:21 WrapperNode [2025-01-09 10:27:21,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:27:21,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:27:21,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:27:21,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:27:21,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:27:21" (1/1) ... [2025-01-09 10:27:21,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:27:21" (1/1) ... [2025-01-09 10:27:21,350 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2025-01-09 10:27:21,351 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:27:21,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:27:21,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:27:21,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:27:21,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:27:21" (1/1) ... [2025-01-09 10:27:21,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:27:21" (1/1) ... [2025-01-09 10:27:21,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:27:21" (1/1) ... [2025-01-09 10:27:21,390 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 10:27:21,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:27:21" (1/1) ... [2025-01-09 10:27:21,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:27:21" (1/1) ... [2025-01-09 10:27:21,400 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:27:21" (1/1) ... [2025-01-09 10:27:21,404 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:27:21" (1/1) ... [2025-01-09 10:27:21,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:27:21" (1/1) ... [2025-01-09 10:27:21,412 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:27:21" (1/1) ... [2025-01-09 10:27:21,413 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:27:21" (1/1) ... [2025-01-09 10:27:21,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:27:21,420 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:27:21,420 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:27:21,420 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:27:21,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:27:21" (1/1) ... [2025-01-09 10:27:21,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:27:21,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:27:21,460 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 10:27:21,462 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 10:27:21,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:27:21,485 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:27:21,485 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:27:21,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:27:21,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:27:21,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:27:21,548 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:27:21,550 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:27:21,856 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 10:27:21,856 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:27:21,869 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:27:21,870 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:27:21,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:27:21 BoogieIcfgContainer [2025-01-09 10:27:21,871 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:27:21,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:27:21,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:27:21,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:27:21,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:27:21" (1/3) ... [2025-01-09 10:27:21,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e43bf8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:27:21, skipping insertion in model container [2025-01-09 10:27:21,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:27:21" (2/3) ... [2025-01-09 10:27:21,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e43bf8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:27:21, skipping insertion in model container [2025-01-09 10:27:21,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:27:21" (3/3) ... [2025-01-09 10:27:21,879 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-45.i [2025-01-09 10:27:21,889 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:27:21,891 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-45.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:27:21,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:27:21,937 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;@296de957, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:27:21,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:27:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 10:27:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 10:27:21,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:27:21,948 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:27:21,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:27:21,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:27:21,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1797138748, now seen corresponding path program 1 times [2025-01-09 10:27:21,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:27:21,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163612387] [2025-01-09 10:27:21,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:27:21,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:27:22,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 10:27:22,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 10:27:22,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:27:22,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:27:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-01-09 10:27:22,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:27:22,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163612387] [2025-01-09 10:27:22,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163612387] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:27:22,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123760311] [2025-01-09 10:27:22,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:27:22,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:27:22,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:27:22,175 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 10:27:22,176 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 10:27:22,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 10:27:22,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 10:27:22,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:27:22,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:27:22,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:27:22,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:27:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-01-09 10:27:22,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:27:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123760311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:27:22,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:27:22,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:27:22,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666509648] [2025-01-09 10:27:22,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:27:22,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:27:22,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:27:22,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:27:22,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:27:22,397 INFO L87 Difference]: Start difference. First operand has 84 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 10:27:22,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:27:22,414 INFO L93 Difference]: Finished difference Result 162 states and 281 transitions. [2025-01-09 10:27:22,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:27:22,415 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 173 [2025-01-09 10:27:22,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:27:22,419 INFO L225 Difference]: With dead ends: 162 [2025-01-09 10:27:22,419 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 10:27:22,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 174 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 10:27:22,423 INFO L435 NwaCegarLoop]: 124 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, 124 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 10:27:22,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:27:22,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 10:27:22,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 10:27:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 10:27:22,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2025-01-09 10:27:22,452 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 173 [2025-01-09 10:27:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:27:22,452 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2025-01-09 10:27:22,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 10:27:22,453 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2025-01-09 10:27:22,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 10:27:22,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:27:22,455 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:27:22,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:27:22,656 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 10:27:22,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:27:22,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:27:22,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1225488848, now seen corresponding path program 1 times [2025-01-09 10:27:22,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:27:22,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036076669] [2025-01-09 10:27:22,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:27:22,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:27:22,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 10:27:22,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 10:27:22,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:27:22,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:27:22,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 10:27:22,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:27:22,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036076669] [2025-01-09 10:27:22,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036076669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:27:22,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:27:22,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:27:22,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297471998] [2025-01-09 10:27:22,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:27:22,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:27:22,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:27:22,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:27:22,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:27:22,926 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 10:27:22,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:27:22,979 INFO L93 Difference]: Finished difference Result 234 states and 360 transitions. [2025-01-09 10:27:22,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:27:22,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2025-01-09 10:27:22,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:27:22,982 INFO L225 Difference]: With dead ends: 234 [2025-01-09 10:27:22,984 INFO L226 Difference]: Without dead ends: 156 [2025-01-09 10:27:22,984 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 10:27:22,985 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 113 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:27:22,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 228 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:27:22,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-09 10:27:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2025-01-09 10:27:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 99 states have (on average 1.3232323232323233) internal successors, (131), 99 states have internal predecessors, (131), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 10:27:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 235 transitions. [2025-01-09 10:27:23,017 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 235 transitions. Word has length 173 [2025-01-09 10:27:23,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:27:23,018 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 235 transitions. [2025-01-09 10:27:23,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 10:27:23,018 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 235 transitions. [2025-01-09 10:27:23,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 10:27:23,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:27:23,021 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:27:23,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:27:23,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:27:23,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:27:23,022 INFO L85 PathProgramCache]: Analyzing trace with hash -812718335, now seen corresponding path program 1 times [2025-01-09 10:27:23,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:27:23,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066022708] [2025-01-09 10:27:23,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:27:23,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:27:23,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 10:27:23,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 10:27:23,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:27:23,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:27:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 10:27:24,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:27:24,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066022708] [2025-01-09 10:27:24,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066022708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:27:24,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:27:24,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:27:24,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452797522] [2025-01-09 10:27:24,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:27:24,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:27:24,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:27:24,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:27:24,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:27:24,471 INFO L87 Difference]: Start difference. First operand 154 states and 235 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 10:27:25,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:27:25,288 INFO L93 Difference]: Finished difference Result 411 states and 621 transitions. [2025-01-09 10:27:25,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:27:25,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2025-01-09 10:27:25,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:27:25,291 INFO L225 Difference]: With dead ends: 411 [2025-01-09 10:27:25,291 INFO L226 Difference]: Without dead ends: 260 [2025-01-09 10:27:25,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:27:25,292 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 254 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:27:25,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 302 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:27:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-01-09 10:27:25,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 227. [2025-01-09 10:27:25,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 156 states have internal predecessors, (209), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 10:27:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 345 transitions. [2025-01-09 10:27:25,321 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 345 transitions. Word has length 174 [2025-01-09 10:27:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:27:25,321 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 345 transitions. [2025-01-09 10:27:25,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 10:27:25,321 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 345 transitions. [2025-01-09 10:27:25,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 10:27:25,323 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:27:25,323 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:27:25,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:27:25,324 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:27:25,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:27:25,324 INFO L85 PathProgramCache]: Analyzing trace with hash -132659965, now seen corresponding path program 1 times [2025-01-09 10:27:25,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:27:25,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678621106] [2025-01-09 10:27:25,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:27:25,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:27:25,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 10:27:25,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 10:27:25,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:27:25,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:27:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 10:27:26,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:27:26,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678621106] [2025-01-09 10:27:26,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678621106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:27:26,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:27:26,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:27:26,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997980549] [2025-01-09 10:27:26,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:27:26,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:27:26,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:27:26,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:27:26,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:27:26,933 INFO L87 Difference]: Start difference. First operand 227 states and 345 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 10:27:27,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:27:27,370 INFO L93 Difference]: Finished difference Result 612 states and 924 transitions. [2025-01-09 10:27:27,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:27:27,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-01-09 10:27:27,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:27:27,374 INFO L225 Difference]: With dead ends: 612 [2025-01-09 10:27:27,374 INFO L226 Difference]: Without dead ends: 388 [2025-01-09 10:27:27,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:27:27,376 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 151 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:27:27,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 386 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:27:27,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-01-09 10:27:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 254. [2025-01-09 10:27:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 181 states have (on average 1.3756906077348066) internal successors, (249), 183 states have internal predecessors, (249), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 10:27:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 385 transitions. [2025-01-09 10:27:27,413 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 385 transitions. Word has length 174 [2025-01-09 10:27:27,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:27:27,413 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 385 transitions. [2025-01-09 10:27:27,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 10:27:27,413 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 385 transitions. [2025-01-09 10:27:27,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 10:27:27,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:27:27,415 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:27:27,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:27:27,415 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:27:27,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:27:27,416 INFO L85 PathProgramCache]: Analyzing trace with hash 208350019, now seen corresponding path program 1 times [2025-01-09 10:27:27,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:27:27,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511520105] [2025-01-09 10:27:27,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:27:27,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:27:27,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 10:27:27,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 10:27:27,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:27:27,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:27:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 10:27:34,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:27:34,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511520105] [2025-01-09 10:27:34,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511520105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:27:34,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:27:34,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:27:34,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505171124] [2025-01-09 10:27:34,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:27:34,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:27:34,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:27:34,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:27:34,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:27:34,482 INFO L87 Difference]: Start difference. First operand 254 states and 385 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 10:27:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:27:36,565 INFO L93 Difference]: Finished difference Result 658 states and 988 transitions. [2025-01-09 10:27:36,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:27:36,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2025-01-09 10:27:36,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:27:36,570 INFO L225 Difference]: With dead ends: 658 [2025-01-09 10:27:36,571 INFO L226 Difference]: Without dead ends: 407 [2025-01-09 10:27:36,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:27:36,578 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 249 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:27:36,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 308 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 10:27:36,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-01-09 10:27:36,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 202. [2025-01-09 10:27:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 137 states have (on average 1.3357664233576643) internal successors, (183), 138 states have internal predecessors, (183), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:27:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 303 transitions. [2025-01-09 10:27:36,646 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 303 transitions. Word has length 174 [2025-01-09 10:27:36,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:27:36,654 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 303 transitions. [2025-01-09 10:27:36,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 10:27:36,654 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 303 transitions. [2025-01-09 10:27:36,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 10:27:36,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:27:36,655 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:27:36,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:27:36,655 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:27:36,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:27:36,656 INFO L85 PathProgramCache]: Analyzing trace with hash 888408389, now seen corresponding path program 1 times [2025-01-09 10:27:36,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:27:36,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797181018] [2025-01-09 10:27:36,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:27:36,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:27:36,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 10:27:36,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 10:27:36,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:27:36,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:27:46,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 10:27:46,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:27:46,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797181018] [2025-01-09 10:27:46,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797181018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:27:46,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:27:46,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:27:46,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448056265] [2025-01-09 10:27:46,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:27:46,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:27:46,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:27:46,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:27:46,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:27:46,782 INFO L87 Difference]: Start difference. First operand 202 states and 303 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 10:27:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:27:47,468 INFO L93 Difference]: Finished difference Result 527 states and 785 transitions. [2025-01-09 10:27:47,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:27:47,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-01-09 10:27:47,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:27:47,472 INFO L225 Difference]: With dead ends: 527 [2025-01-09 10:27:47,472 INFO L226 Difference]: Without dead ends: 341 [2025-01-09 10:27:47,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:27:47,473 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 131 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:27:47,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 413 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:27:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-01-09 10:27:47,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 202. [2025-01-09 10:27:47,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 137 states have (on average 1.3357664233576643) internal successors, (183), 138 states have internal predecessors, (183), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:27:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 303 transitions. [2025-01-09 10:27:47,506 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 303 transitions. Word has length 174 [2025-01-09 10:27:47,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:27:47,506 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 303 transitions. [2025-01-09 10:27:47,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 10:27:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 303 transitions. [2025-01-09 10:27:47,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 10:27:47,508 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:27:47,508 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:27:47,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:27:47,508 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:27:47,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:27:47,508 INFO L85 PathProgramCache]: Analyzing trace with hash 352491407, now seen corresponding path program 1 times [2025-01-09 10:27:47,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:27:47,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470454746] [2025-01-09 10:27:47,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:27:47,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:27:47,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 10:27:47,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 10:27:47,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:27:47,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:27:47,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 10:27:47,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:27:47,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470454746] [2025-01-09 10:27:47,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470454746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:27:47,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:27:47,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:27:47,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969403983] [2025-01-09 10:27:47,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:27:47,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:27:47,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:27:47,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:27:47,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:27:47,588 INFO L87 Difference]: Start difference. First operand 202 states and 303 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 10:27:47,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:27:47,644 INFO L93 Difference]: Finished difference Result 455 states and 681 transitions. [2025-01-09 10:27:47,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:27:47,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-01-09 10:27:47,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:27:47,647 INFO L225 Difference]: With dead ends: 455 [2025-01-09 10:27:47,647 INFO L226 Difference]: Without dead ends: 269 [2025-01-09 10:27:47,647 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 10:27:47,648 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 33 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:27:47,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 269 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:27:47,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-01-09 10:27:47,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 239. [2025-01-09 10:27:47,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 174 states have (on average 1.367816091954023) internal successors, (238), 175 states have internal predecessors, (238), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:27:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 358 transitions. [2025-01-09 10:27:47,691 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 358 transitions. Word has length 174 [2025-01-09 10:27:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:27:47,691 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 358 transitions. [2025-01-09 10:27:47,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 10:27:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 358 transitions. [2025-01-09 10:27:47,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 10:27:47,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:27:47,693 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:27:47,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:27:47,693 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:27:47,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:27:47,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1938098299, now seen corresponding path program 1 times [2025-01-09 10:27:47,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:27:47,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27864925] [2025-01-09 10:27:47,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:27:47,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:27:47,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 10:27:47,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 10:27:47,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:27:47,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:27:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 10:27:48,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:27:48,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27864925] [2025-01-09 10:27:48,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27864925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:27:48,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:27:48,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:27:48,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97707577] [2025-01-09 10:27:48,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:27:48,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:27:48,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:27:48,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:27:48,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:27:48,552 INFO L87 Difference]: Start difference. First operand 239 states and 358 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 10:27:48,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:27:48,958 INFO L93 Difference]: Finished difference Result 630 states and 932 transitions. [2025-01-09 10:27:48,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:27:48,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-01-09 10:27:48,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:27:48,961 INFO L225 Difference]: With dead ends: 630 [2025-01-09 10:27:48,961 INFO L226 Difference]: Without dead ends: 407 [2025-01-09 10:27:48,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:27:48,964 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 139 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:27:48,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 448 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:27:48,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-01-09 10:27:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 331. [2025-01-09 10:27:49,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 242 states have (on average 1.3553719008264462) internal successors, (328), 245 states have internal predecessors, (328), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 10:27:49,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 488 transitions. [2025-01-09 10:27:49,024 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 488 transitions. Word has length 174 [2025-01-09 10:27:49,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:27:49,024 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 488 transitions. [2025-01-09 10:27:49,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 10:27:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 488 transitions. [2025-01-09 10:27:49,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 10:27:49,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:27:49,027 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:27:49,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:27:49,027 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:27:49,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:27:49,028 INFO L85 PathProgramCache]: Analyzing trace with hash -917029945, now seen corresponding path program 1 times [2025-01-09 10:27:49,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:27:49,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133366485] [2025-01-09 10:27:49,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:27:49,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:27:49,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 10:27:49,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 10:27:49,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:27:49,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:27:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 10:27:55,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:27:55,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133366485] [2025-01-09 10:27:55,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133366485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:27:55,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:27:55,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:27:55,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362794536] [2025-01-09 10:27:55,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:27:55,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:27:55,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:27:55,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:27:55,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:27:55,940 INFO L87 Difference]: Start difference. First operand 331 states and 488 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 10:27:56,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:27:56,491 INFO L93 Difference]: Finished difference Result 715 states and 1049 transitions. [2025-01-09 10:27:56,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:27:56,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-01-09 10:27:56,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:27:56,494 INFO L225 Difference]: With dead ends: 715 [2025-01-09 10:27:56,494 INFO L226 Difference]: Without dead ends: 400 [2025-01-09 10:27:56,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:27:56,495 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 141 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:27:56,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 452 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:27:56,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-01-09 10:27:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 314. [2025-01-09 10:27:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 225 states have (on average 1.3466666666666667) internal successors, (303), 228 states have internal predecessors, (303), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 10:27:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 463 transitions. [2025-01-09 10:27:56,562 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 463 transitions. Word has length 174 [2025-01-09 10:27:56,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:27:56,562 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 463 transitions. [2025-01-09 10:27:56,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 10:27:56,562 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 463 transitions. [2025-01-09 10:27:56,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 10:27:56,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:27:56,563 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:27:56,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:27:56,563 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:27:56,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:27:56,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1240090247, now seen corresponding path program 1 times [2025-01-09 10:27:56,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:27:56,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175128040] [2025-01-09 10:27:56,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:27:56,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:27:56,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 10:27:56,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 10:27:56,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:27:56,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:41,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 10:28:41,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:41,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175128040] [2025-01-09 10:28:41,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175128040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:41,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:41,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 10:28:41,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161813312] [2025-01-09 10:28:41,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:41,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 10:28:41,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:41,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 10:28:41,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:28:41,512 INFO L87 Difference]: Start difference. First operand 314 states and 463 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 10:28:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:44,332 INFO L93 Difference]: Finished difference Result 420 states and 603 transitions. [2025-01-09 10:28:44,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 10:28:44,333 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-01-09 10:28:44,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:44,335 INFO L225 Difference]: With dead ends: 420 [2025-01-09 10:28:44,335 INFO L226 Difference]: Without dead ends: 418 [2025-01-09 10:28:44,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:28:44,336 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 218 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:44,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 620 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 10:28:44,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-01-09 10:28:44,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 357. [2025-01-09 10:28:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 266 states have (on average 1.349624060150376) internal successors, (359), 269 states have internal predecessors, (359), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 10:28:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 519 transitions. [2025-01-09 10:28:44,391 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 519 transitions. Word has length 175 [2025-01-09 10:28:44,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:44,392 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 519 transitions. [2025-01-09 10:28:44,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 10:28:44,392 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 519 transitions. [2025-01-09 10:28:44,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 10:28:44,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:44,393 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:44,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:28:44,394 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:44,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:44,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1466529147, now seen corresponding path program 1 times [2025-01-09 10:28:44,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:44,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266064878] [2025-01-09 10:28:44,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:44,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:44,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 10:28:44,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 10:28:44,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:44,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat