./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 64123f5116db47fa03ac4ec656265c4b4fc7f86761672b728533a9657e1ff5e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:10:42,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:10:42,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:10:42,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:10:42,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:10:42,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:10:42,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:10:42,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:10:42,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:10:42,100 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:10:42,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:10:42,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:10:42,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:10:42,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:10:42,101 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:10:42,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:10:42,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:10:42,101 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:10:42,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:10:42,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:10:42,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:10:42,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:10:42,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:10:42,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:10:42,101 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:10:42,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:10:42,101 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:10:42,101 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:10:42,101 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:10:42,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:10:42,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:10:42,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:10:42,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:10:42,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:10:42,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:10:42,102 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:10:42,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:10:42,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:10:42,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:10:42,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:10:42,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:10:42,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:10:42,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:10:42,102 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/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 -> 64123f5116db47fa03ac4ec656265c4b4fc7f86761672b728533a9657e1ff5e6 [2025-03-04 00:10:42,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:10:42,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:10:42,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:10:42,313 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:10:42,313 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:10:42,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-4.i [2025-03-04 00:10:43,431 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e99f63c/fc21d4e326be43ecab45a7df83c52b82/FLAG309f736d1 [2025-03-04 00:10:43,694 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:10:43,696 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-4.i [2025-03-04 00:10:43,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e99f63c/fc21d4e326be43ecab45a7df83c52b82/FLAG309f736d1 [2025-03-04 00:10:43,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e99f63c/fc21d4e326be43ecab45a7df83c52b82 [2025-03-04 00:10:43,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:10:43,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:10:43,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:10:43,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:10:43,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:10:43,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:10:43" (1/1) ... [2025-03-04 00:10:43,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f6906a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:43, skipping insertion in model container [2025-03-04 00:10:43,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:10:43" (1/1) ... [2025-03-04 00:10:44,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:10:44,117 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-4.i[915,928] [2025-03-04 00:10:44,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:10:44,262 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:10:44,271 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-4.i[915,928] [2025-03-04 00:10:44,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:10:44,343 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:10:44,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:44 WrapperNode [2025-03-04 00:10:44,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:10:44,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:10:44,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:10:44,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:10:44,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:44" (1/1) ... [2025-03-04 00:10:44,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:44" (1/1) ... [2025-03-04 00:10:44,417 INFO L138 Inliner]: procedures = 26, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 381 [2025-03-04 00:10:44,417 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:10:44,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:10:44,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:10:44,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:10:44,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:44" (1/1) ... [2025-03-04 00:10:44,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:44" (1/1) ... [2025-03-04 00:10:44,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:44" (1/1) ... [2025-03-04 00:10:44,470 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-03-04 00:10:44,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:44" (1/1) ... [2025-03-04 00:10:44,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:44" (1/1) ... [2025-03-04 00:10:44,487 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:44" (1/1) ... [2025-03-04 00:10:44,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:44" (1/1) ... [2025-03-04 00:10:44,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:44" (1/1) ... [2025-03-04 00:10:44,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:44" (1/1) ... [2025-03-04 00:10:44,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:10:44,513 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:10:44,513 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:10:44,513 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:10:44,513 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:44" (1/1) ... [2025-03-04 00:10:44,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:10:44,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:44,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:10:44,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:10:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:10:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:10:44,558 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:10:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:10:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:10:44,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:10:44,648 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:10:44,649 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:10:45,179 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L359: havoc property_#t~ite33#1;havoc property_#t~bitwise32#1;havoc property_#t~short34#1; [2025-03-04 00:10:45,230 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2025-03-04 00:10:45,230 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:10:45,251 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:10:45,253 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:10:45,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:10:45 BoogieIcfgContainer [2025-03-04 00:10:45,254 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:10:45,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:10:45,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:10:45,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:10:45,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:10:43" (1/3) ... [2025-03-04 00:10:45,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662ed29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:10:45, skipping insertion in model container [2025-03-04 00:10:45,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:44" (2/3) ... [2025-03-04 00:10:45,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662ed29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:10:45, skipping insertion in model container [2025-03-04 00:10:45,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:10:45" (3/3) ... [2025-03-04 00:10:45,261 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-4.i [2025-03-04 00:10:45,296 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:10:45,299 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-4.i that has 2 procedures, 157 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:10:45,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:10:45,357 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;@51a8bf52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:10:45,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:10:45,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 157 states, 107 states have (on average 1.4672897196261683) internal successors, (157), 108 states have internal predecessors, (157), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 00:10:45,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-04 00:10:45,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:45,379 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 00:10:45,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:45,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:45,385 INFO L85 PathProgramCache]: Analyzing trace with hash 78475465, now seen corresponding path program 1 times [2025-03-04 00:10:45,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:45,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802364926] [2025-03-04 00:10:45,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:45,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:45,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-04 00:10:45,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-04 00:10:45,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:45,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2025-03-04 00:10:45,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:45,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802364926] [2025-03-04 00:10:45,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802364926] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:45,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419063494] [2025-03-04 00:10:45,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:45,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:45,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:45,803 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:10:45,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:10:45,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-04 00:10:46,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-04 00:10:46,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:46,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:46,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:10:46,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2025-03-04 00:10:46,083 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:10:46,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419063494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:46,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:10:46,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:10:46,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291951879] [2025-03-04 00:10:46,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:46,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:10:46,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:46,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:10:46,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:10:46,106 INFO L87 Difference]: Start difference. First operand has 157 states, 107 states have (on average 1.4672897196261683) internal successors, (157), 108 states have internal predecessors, (157), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) Second operand has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (47), 2 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-04 00:10:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:46,146 INFO L93 Difference]: Finished difference Result 308 states and 544 transitions. [2025-03-04 00:10:46,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:10:46,148 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (47), 2 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) Word has length 311 [2025-03-04 00:10:46,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:46,154 INFO L225 Difference]: With dead ends: 308 [2025-03-04 00:10:46,155 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 00:10:46,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 312 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-03-04 00:10:46,164 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:46,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:10:46,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 00:10:46,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-04 00:10:46,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 00:10:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 246 transitions. [2025-03-04 00:10:46,211 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 246 transitions. Word has length 311 [2025-03-04 00:10:46,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:46,211 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 246 transitions. [2025-03-04 00:10:46,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (47), 2 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-04 00:10:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 246 transitions. [2025-03-04 00:10:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-04 00:10:46,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:46,215 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 00:10:46,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:10:46,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:10:46,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:46,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:46,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2129303984, now seen corresponding path program 1 times [2025-03-04 00:10:46,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:46,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158910411] [2025-03-04 00:10:46,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:46,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:46,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-04 00:10:46,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-04 00:10:46,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:46,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-03-04 00:10:47,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:47,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158910411] [2025-03-04 00:10:47,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158910411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:47,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:47,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:10:47,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057204565] [2025-03-04 00:10:47,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:47,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:10:47,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:47,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:10:47,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:10:47,049 INFO L87 Difference]: Start difference. First operand 154 states and 246 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-03-04 00:10:47,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:47,313 INFO L93 Difference]: Finished difference Result 424 states and 678 transitions. [2025-03-04 00:10:47,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:10:47,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 311 [2025-03-04 00:10:47,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:47,319 INFO L225 Difference]: With dead ends: 424 [2025-03-04 00:10:47,320 INFO L226 Difference]: Without dead ends: 273 [2025-03-04 00:10:47,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:10:47,322 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 183 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:47,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 951 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:10:47,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-04 00:10:47,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 158. [2025-03-04 00:10:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 109 states have (on average 1.4495412844036697) internal successors, (158), 109 states have internal predecessors, (158), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 00:10:47,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 252 transitions. [2025-03-04 00:10:47,348 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 252 transitions. Word has length 311 [2025-03-04 00:10:47,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:47,351 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 252 transitions. [2025-03-04 00:10:47,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-03-04 00:10:47,351 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 252 transitions. [2025-03-04 00:10:47,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-04 00:10:47,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:47,357 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 00:10:47,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:10:47,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:47,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:47,359 INFO L85 PathProgramCache]: Analyzing trace with hash -621752175, now seen corresponding path program 1 times [2025-03-04 00:10:47,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:47,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519667148] [2025-03-04 00:10:47,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:47,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:47,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-04 00:10:47,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-04 00:10:47,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:47,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-03-04 00:10:48,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:48,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519667148] [2025-03-04 00:10:48,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519667148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:48,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:48,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:10:48,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256863960] [2025-03-04 00:10:48,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:48,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:10:48,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:48,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:10:48,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:10:48,185 INFO L87 Difference]: Start difference. First operand 158 states and 252 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-03-04 00:10:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:48,389 INFO L93 Difference]: Finished difference Result 469 states and 751 transitions. [2025-03-04 00:10:48,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:10:48,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 311 [2025-03-04 00:10:48,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:48,392 INFO L225 Difference]: With dead ends: 469 [2025-03-04 00:10:48,392 INFO L226 Difference]: Without dead ends: 314 [2025-03-04 00:10:48,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:10:48,393 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 204 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:48,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 712 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:10:48,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-04 00:10:48,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 250. [2025-03-04 00:10:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 153 states have (on average 1.3725490196078431) internal successors, (210), 153 states have internal predecessors, (210), 94 states have call successors, (94), 2 states have call predecessors, (94), 2 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-04 00:10:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 398 transitions. [2025-03-04 00:10:48,421 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 398 transitions. Word has length 311 [2025-03-04 00:10:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:48,421 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 398 transitions. [2025-03-04 00:10:48,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-03-04 00:10:48,422 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 398 transitions. [2025-03-04 00:10:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-04 00:10:48,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:48,423 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 00:10:48,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:10:48,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:48,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:48,425 INFO L85 PathProgramCache]: Analyzing trace with hash -291986414, now seen corresponding path program 1 times [2025-03-04 00:10:48,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:48,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186285566] [2025-03-04 00:10:48,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:48,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:48,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-04 00:10:48,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-04 00:10:48,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:48,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:49,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 135 proven. 3 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-03-04 00:10:49,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:49,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186285566] [2025-03-04 00:10:49,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186285566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:49,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490091959] [2025-03-04 00:10:49,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:49,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:49,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:49,987 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:10:49,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:10:50,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-04 00:10:50,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-04 00:10:50,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:50,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:50,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 00:10:50,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 319 proven. 129 refuted. 0 times theorem prover too weak. 3876 trivial. 0 not checked. [2025-03-04 00:10:51,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 135 proven. 3 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-03-04 00:10:52,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490091959] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:10:52,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:10:52,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 22 [2025-03-04 00:10:52,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152012275] [2025-03-04 00:10:52,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:10:52,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 00:10:52,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:52,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 00:10:52,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-03-04 00:10:52,509 INFO L87 Difference]: Start difference. First operand 250 states and 398 transitions. Second operand has 22 states, 22 states have (on average 8.590909090909092) internal successors, (189), 20 states have internal predecessors, (189), 6 states have call successors, (141), 3 states have call predecessors, (141), 6 states have return successors, (141), 6 states have call predecessors, (141), 6 states have call successors, (141) [2025-03-04 00:10:54,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:54,812 INFO L93 Difference]: Finished difference Result 782 states and 1243 transitions. [2025-03-04 00:10:54,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 00:10:54,813 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.590909090909092) internal successors, (189), 20 states have internal predecessors, (189), 6 states have call successors, (141), 3 states have call predecessors, (141), 6 states have return successors, (141), 6 states have call predecessors, (141), 6 states have call successors, (141) Word has length 311 [2025-03-04 00:10:54,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:54,817 INFO L225 Difference]: With dead ends: 782 [2025-03-04 00:10:54,817 INFO L226 Difference]: Without dead ends: 617 [2025-03-04 00:10:54,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=361, Invalid=1361, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 00:10:54,819 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 1131 mSDsluCounter, 2312 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 2563 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:54,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 2563 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [575 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 00:10:54,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-03-04 00:10:54,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 399. [2025-03-04 00:10:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 252 states have (on average 1.376984126984127) internal successors, (347), 252 states have internal predecessors, (347), 141 states have call successors, (141), 5 states have call predecessors, (141), 5 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2025-03-04 00:10:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 629 transitions. [2025-03-04 00:10:54,871 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 629 transitions. Word has length 311 [2025-03-04 00:10:54,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:54,872 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 629 transitions. [2025-03-04 00:10:54,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.590909090909092) internal successors, (189), 20 states have internal predecessors, (189), 6 states have call successors, (141), 3 states have call predecessors, (141), 6 states have return successors, (141), 6 states have call predecessors, (141), 6 states have call successors, (141) [2025-03-04 00:10:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 629 transitions. [2025-03-04 00:10:54,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-04 00:10:54,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:54,874 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 00:10:54,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:10:55,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 00:10:55,078 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:55,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:55,078 INFO L85 PathProgramCache]: Analyzing trace with hash 997660343, now seen corresponding path program 1 times [2025-03-04 00:10:55,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:55,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106187801] [2025-03-04 00:10:55,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:55,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:55,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-04 00:10:55,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-04 00:10:55,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:55,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 18 proven. 120 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-03-04 00:10:55,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:55,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106187801] [2025-03-04 00:10:55,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106187801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:55,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334691316] [2025-03-04 00:10:55,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:55,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:55,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:55,776 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:10:55,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:10:55,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-04 00:10:55,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-04 00:10:55,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:55,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:55,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 00:10:55,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 2672 proven. 276 refuted. 0 times theorem prover too weak. 1376 trivial. 0 not checked. [2025-03-04 00:10:57,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 99 proven. 174 refuted. 0 times theorem prover too weak. 4051 trivial. 0 not checked. [2025-03-04 00:10:58,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334691316] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:10:58,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:10:58,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 11] total 29 [2025-03-04 00:10:58,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372542561] [2025-03-04 00:10:58,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:10:58,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 00:10:58,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:58,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 00:10:58,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2025-03-04 00:10:58,800 INFO L87 Difference]: Start difference. First operand 399 states and 629 transitions. Second operand has 29 states, 29 states have (on average 7.689655172413793) internal successors, (223), 28 states have internal predecessors, (223), 8 states have call successors, (134), 5 states have call predecessors, (134), 10 states have return successors, (135), 8 states have call predecessors, (135), 8 states have call successors, (135) [2025-03-04 00:11:03,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:03,613 INFO L93 Difference]: Finished difference Result 1594 states and 2389 transitions. [2025-03-04 00:11:03,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-03-04 00:11:03,613 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.689655172413793) internal successors, (223), 28 states have internal predecessors, (223), 8 states have call successors, (134), 5 states have call predecessors, (134), 10 states have return successors, (135), 8 states have call predecessors, (135), 8 states have call successors, (135) Word has length 312 [2025-03-04 00:11:03,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:03,620 INFO L225 Difference]: With dead ends: 1594 [2025-03-04 00:11:03,620 INFO L226 Difference]: Without dead ends: 1296 [2025-03-04 00:11:03,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 609 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3678 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2489, Invalid=9501, Unknown=0, NotChecked=0, Total=11990 [2025-03-04 00:11:03,625 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 3268 mSDsluCounter, 2630 mSDsCounter, 0 mSdLazyCounter, 3958 mSolverCounterSat, 621 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3268 SdHoareTripleChecker+Valid, 2957 SdHoareTripleChecker+Invalid, 4579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 621 IncrementalHoareTripleChecker+Valid, 3958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:03,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3268 Valid, 2957 Invalid, 4579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [621 Valid, 3958 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-04 00:11:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2025-03-04 00:11:03,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 848. [2025-03-04 00:11:03,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 581 states have (on average 1.3614457831325302) internal successors, (791), 581 states have internal predecessors, (791), 235 states have call successors, (235), 31 states have call predecessors, (235), 31 states have return successors, (235), 235 states have call predecessors, (235), 235 states have call successors, (235) [2025-03-04 00:11:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1261 transitions. [2025-03-04 00:11:03,697 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1261 transitions. Word has length 312 [2025-03-04 00:11:03,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:03,698 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1261 transitions. [2025-03-04 00:11:03,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.689655172413793) internal successors, (223), 28 states have internal predecessors, (223), 8 states have call successors, (134), 5 states have call predecessors, (134), 10 states have return successors, (135), 8 states have call predecessors, (135), 8 states have call successors, (135) [2025-03-04 00:11:03,698 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1261 transitions. [2025-03-04 00:11:03,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-04 00:11:03,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:03,703 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 00:11:03,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:11:03,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:03,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:03,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:03,908 INFO L85 PathProgramCache]: Analyzing trace with hash -574808424, now seen corresponding path program 1 times [2025-03-04 00:11:03,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:03,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007583891] [2025-03-04 00:11:03,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:03,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:03,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-04 00:11:04,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-04 00:11:04,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:04,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat