./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-66.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2fb5494f31021cb0f379142b5b5cf1efd42a1c877a9dec66b9c682ab4f055ad0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:44:59,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:44:59,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:44:59,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:44:59,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:44:59,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:44:59,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:44:59,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:44:59,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:44:59,902 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:44:59,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:44:59,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:44:59,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:44:59,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:44:59,902 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:44:59,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:44:59,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:44:59,902 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:44:59,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:44:59,903 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:44:59,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:44:59,903 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:44:59,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:44:59,903 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:44:59,903 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:44:59,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:44:59,903 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:44:59,903 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:44:59,903 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:44:59,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:44:59,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:44:59,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:44:59,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:44:59,904 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:44:59,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:44:59,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:44:59,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:44:59,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:44:59,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:44:59,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:44:59,906 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:44:59,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:44:59,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:44:59,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:44:59,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:44:59,906 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:44:59,906 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:44:59,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:44:59,907 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 -> 2fb5494f31021cb0f379142b5b5cf1efd42a1c877a9dec66b9c682ab4f055ad0 [2025-01-09 13:45:00,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:45:00,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:45:00,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:45:00,140 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:45:00,140 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:45:00,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-66.i [2025-01-09 13:45:01,290 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/88d815d02/2618b33546184a32980818886f0a6440/FLAGe6d77fa31 [2025-01-09 13:45:01,524 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:45:01,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-66.i [2025-01-09 13:45:01,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/88d815d02/2618b33546184a32980818886f0a6440/FLAGe6d77fa31 [2025-01-09 13:45:01,869 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/88d815d02/2618b33546184a32980818886f0a6440 [2025-01-09 13:45:01,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:45:01,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:45:01,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:45:01,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:45:01,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:45:01,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:45:01" (1/1) ... [2025-01-09 13:45:01,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e365b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:45:01, skipping insertion in model container [2025-01-09 13:45:01,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:45:01" (1/1) ... [2025-01-09 13:45:01,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:45:01,999 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_loopvsstraightlinecode_50-1loop_file-66.i[915,928] [2025-01-09 13:45:02,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:45:02,052 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:45:02,058 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_loopvsstraightlinecode_50-1loop_file-66.i[915,928] [2025-01-09 13:45:02,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:45:02,085 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:45:02,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:45:02 WrapperNode [2025-01-09 13:45:02,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:45:02,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:45:02,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:45:02,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:45:02,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:45:02" (1/1) ... [2025-01-09 13:45:02,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:45:02" (1/1) ... [2025-01-09 13:45:02,118 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2025-01-09 13:45:02,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:45:02,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:45:02,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:45:02,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:45:02,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:45:02" (1/1) ... [2025-01-09 13:45:02,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:45:02" (1/1) ... [2025-01-09 13:45:02,128 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:45:02" (1/1) ... [2025-01-09 13:45:02,139 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 13:45:02,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:45:02" (1/1) ... [2025-01-09 13:45:02,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:45:02" (1/1) ... [2025-01-09 13:45:02,144 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:45:02" (1/1) ... [2025-01-09 13:45:02,144 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:45:02" (1/1) ... [2025-01-09 13:45:02,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:45:02" (1/1) ... [2025-01-09 13:45:02,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:45:02" (1/1) ... [2025-01-09 13:45:02,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:45:02" (1/1) ... [2025-01-09 13:45:02,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:45:02,150 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:45:02,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:45:02,150 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:45:02,151 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:45:02" (1/1) ... [2025-01-09 13:45:02,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:45:02,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:45:02,176 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 13:45:02,181 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 13:45:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:45:02,195 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:45:02,195 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:45:02,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:45:02,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:45:02,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:45:02,246 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:45:02,248 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:45:02,436 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 13:45:02,437 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:45:02,447 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:45:02,447 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:45:02,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:45:02 BoogieIcfgContainer [2025-01-09 13:45:02,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:45:02,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:45:02,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:45:02,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:45:02,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:45:01" (1/3) ... [2025-01-09 13:45:02,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ac86ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:45:02, skipping insertion in model container [2025-01-09 13:45:02,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:45:02" (2/3) ... [2025-01-09 13:45:02,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ac86ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:45:02, skipping insertion in model container [2025-01-09 13:45:02,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:45:02" (3/3) ... [2025-01-09 13:45:02,455 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-66.i [2025-01-09 13:45:02,466 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:45:02,467 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-66.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:45:02,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:45:02,510 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;@6ec7fd77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:45:02,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:45:02,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:45:02,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:45:02,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:45:02,521 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:45:02,522 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:45:02,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:45:02,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1974806305, now seen corresponding path program 1 times [2025-01-09 13:45:02,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:45:02,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415383277] [2025-01-09 13:45:02,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:45:02,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:45:02,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:45:02,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:45:02,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:45:02,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:45:02,708 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 13:45:02,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:45:02,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415383277] [2025-01-09 13:45:02,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415383277] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:45:02,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039361860] [2025-01-09 13:45:02,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:45:02,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:45:02,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:45:02,712 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 13:45:02,713 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 13:45:02,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:45:02,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:45:02,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:45:02,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:45:02,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:45:02,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:45:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 13:45:02,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:45:02,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039361860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:45:02,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:45:02,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:45:02,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975365074] [2025-01-09 13:45:02,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:45:02,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:45:02,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:45:02,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:45:02,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:45:02,889 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:45:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:45:02,908 INFO L93 Difference]: Finished difference Result 117 states and 197 transitions. [2025-01-09 13:45:02,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:45:02,909 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2025-01-09 13:45:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:45:02,913 INFO L225 Difference]: With dead ends: 117 [2025-01-09 13:45:02,913 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 13:45:02,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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 13:45:02,917 INFO L435 NwaCegarLoop]: 89 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, 89 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 13:45:02,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:45:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 13:45:02,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-09 13:45:02,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:45:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2025-01-09 13:45:02,945 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 119 [2025-01-09 13:45:02,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:45:02,945 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2025-01-09 13:45:02,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:45:02,946 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2025-01-09 13:45:02,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:45:02,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:45:02,949 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:45:02,956 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 13:45:03,149 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 13:45:03,150 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:45:03,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:45:03,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1569859681, now seen corresponding path program 1 times [2025-01-09 13:45:03,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:45:03,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863036760] [2025-01-09 13:45:03,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:45:03,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:45:03,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:45:03,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:45:03,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:45:03,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:45:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:45:21,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:45:21,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863036760] [2025-01-09 13:45:21,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863036760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:45:21,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:45:21,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 13:45:21,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808119491] [2025-01-09 13:45:21,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:45:21,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 13:45:21,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:45:21,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 13:45:21,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 13:45:21,543 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:45:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:45:22,344 INFO L93 Difference]: Finished difference Result 222 states and 322 transitions. [2025-01-09 13:45:22,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 13:45:22,345 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 13:45:22,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:45:22,346 INFO L225 Difference]: With dead ends: 222 [2025-01-09 13:45:22,346 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 13:45:22,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-01-09 13:45:22,348 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 235 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:45:22,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 457 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 13:45:22,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 13:45:22,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 103. [2025-01-09 13:45:22,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 79 states have internal predecessors, (109), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 13:45:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 153 transitions. [2025-01-09 13:45:22,361 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 153 transitions. Word has length 119 [2025-01-09 13:45:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:45:22,362 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 153 transitions. [2025-01-09 13:45:22,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:45:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 153 transitions. [2025-01-09 13:45:22,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:45:22,363 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:45:22,363 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:45:22,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:45:22,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:45:22,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:45:22,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1571706723, now seen corresponding path program 1 times [2025-01-09 13:45:22,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:45:22,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790216001] [2025-01-09 13:45:22,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:45:22,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:45:22,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:45:22,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:45:22,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:45:22,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:45:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:45:44,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:45:44,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790216001] [2025-01-09 13:45:44,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790216001] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:45:44,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:45:44,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 13:45:44,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45637112] [2025-01-09 13:45:44,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:45:44,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 13:45:44,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:45:45,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 13:45:45,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-01-09 13:45:45,000 INFO L87 Difference]: Start difference. First operand 103 states and 153 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:45:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:45:46,697 INFO L93 Difference]: Finished difference Result 152 states and 212 transitions. [2025-01-09 13:45:46,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 13:45:46,698 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 13:45:46,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:45:46,701 INFO L225 Difference]: With dead ends: 152 [2025-01-09 13:45:46,701 INFO L226 Difference]: Without dead ends: 150 [2025-01-09 13:45:46,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-01-09 13:45:46,702 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 148 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 13:45:46,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 461 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 13:45:46,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-09 13:45:46,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 103. [2025-01-09 13:45:46,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 79 states have internal predecessors, (109), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 13:45:46,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 153 transitions. [2025-01-09 13:45:46,712 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 153 transitions. Word has length 119 [2025-01-09 13:45:46,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:45:46,712 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 153 transitions. [2025-01-09 13:45:46,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:45:46,713 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 153 transitions. [2025-01-09 13:45:46,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:45:46,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:45:46,714 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:45:46,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:45:46,714 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:45:46,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:45:46,714 INFO L85 PathProgramCache]: Analyzing trace with hash 889801311, now seen corresponding path program 1 times [2025-01-09 13:45:46,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:45:46,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994193958] [2025-01-09 13:45:46,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:45:46,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:45:46,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:45:46,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:45:46,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:45:46,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:46:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:46:01,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:46:01,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994193958] [2025-01-09 13:46:01,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994193958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:46:01,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:46:01,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 13:46:01,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663114057] [2025-01-09 13:46:01,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:46:01,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 13:46:01,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:46:01,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 13:46:01,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 13:46:01,396 INFO L87 Difference]: Start difference. First operand 103 states and 153 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:46:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:46:02,441 INFO L93 Difference]: Finished difference Result 168 states and 231 transitions. [2025-01-09 13:46:02,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 13:46:02,441 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 13:46:02,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:46:02,442 INFO L225 Difference]: With dead ends: 168 [2025-01-09 13:46:02,442 INFO L226 Difference]: Without dead ends: 166 [2025-01-09 13:46:02,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-01-09 13:46:02,443 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 175 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:46:02,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 523 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 13:46:02,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-09 13:46:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 108. [2025-01-09 13:46:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 13:46:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2025-01-09 13:46:02,456 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 119 [2025-01-09 13:46:02,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:46:02,457 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2025-01-09 13:46:02,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:46:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2025-01-09 13:46:02,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:46:02,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:46:02,458 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:46:02,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:46:02,458 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:46:02,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:46:02,459 INFO L85 PathProgramCache]: Analyzing trace with hash 891648353, now seen corresponding path program 1 times [2025-01-09 13:46:02,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:46:02,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623977235] [2025-01-09 13:46:02,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:46:02,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:46:02,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:46:02,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:46:02,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:46:02,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:46:23,882 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:46:23,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:46:23,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623977235] [2025-01-09 13:46:23,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623977235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:46:23,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:46:23,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 13:46:23,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201131699] [2025-01-09 13:46:23,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:46:23,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 13:46:23,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:46:23,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 13:46:23,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-01-09 13:46:23,883 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:46:25,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:46:25,094 INFO L93 Difference]: Finished difference Result 148 states and 208 transitions. [2025-01-09 13:46:25,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 13:46:25,096 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 13:46:25,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:46:25,097 INFO L225 Difference]: With dead ends: 148 [2025-01-09 13:46:25,097 INFO L226 Difference]: Without dead ends: 146 [2025-01-09 13:46:25,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-01-09 13:46:25,098 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 170 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:46:25,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 373 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 13:46:25,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-09 13:46:25,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 103. [2025-01-09 13:46:25,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 79 states have internal predecessors, (109), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 13:46:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 153 transitions. [2025-01-09 13:46:25,112 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 153 transitions. Word has length 119 [2025-01-09 13:46:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:46:25,112 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 153 transitions. [2025-01-09 13:46:25,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:46:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 153 transitions. [2025-01-09 13:46:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:46:25,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:46:25,114 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:46:25,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:46:25,114 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:46:25,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:46:25,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1828025119, now seen corresponding path program 1 times [2025-01-09 13:46:25,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:46:25,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408827061] [2025-01-09 13:46:25,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:46:25,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:46:25,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:46:25,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:46:25,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:46:25,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:46:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:46:25,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:46:25,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408827061] [2025-01-09 13:46:25,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408827061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:46:25,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:46:25,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:46:25,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601185552] [2025-01-09 13:46:25,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:46:25,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:46:25,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:46:25,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:46:25,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:46:25,156 INFO L87 Difference]: Start difference. First operand 103 states and 153 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:46:25,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:46:25,188 INFO L93 Difference]: Finished difference Result 283 states and 424 transitions. [2025-01-09 13:46:25,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:46:25,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 13:46:25,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:46:25,190 INFO L225 Difference]: With dead ends: 283 [2025-01-09 13:46:25,191 INFO L226 Difference]: Without dead ends: 183 [2025-01-09 13:46:25,193 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 13:46:25,194 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 73 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:46:25,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 222 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:46:25,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-09 13:46:25,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2025-01-09 13:46:25,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 132 states have (on average 1.3257575757575757) internal successors, (175), 134 states have internal predecessors, (175), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 13:46:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 263 transitions. [2025-01-09 13:46:25,218 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 263 transitions. Word has length 119 [2025-01-09 13:46:25,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:46:25,218 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 263 transitions. [2025-01-09 13:46:25,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:46:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 263 transitions. [2025-01-09 13:46:25,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:46:25,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:46:25,219 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:46:25,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 13:46:25,221 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:46:25,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:46:25,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1018678493, now seen corresponding path program 1 times [2025-01-09 13:46:25,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:46:25,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142001610] [2025-01-09 13:46:25,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:46:25,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:46:25,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:46:25,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:46:25,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:46:25,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat