./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-76.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_fillercode_fillercodestructure_normal_file-76.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 883c6f5172a96f0287ac7e513094d32a0853666f3578c9a6dcc19d38a0beb57e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:17:21,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:17:21,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:17:21,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:17:21,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:17:21,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:17:21,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:17:21,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:17:21,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:17:21,406 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:17:21,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:17:21,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:17:21,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:17:21,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:17:21,408 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:17:21,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:17:21,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:17:21,408 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:17:21,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:17:21,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:17:21,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:17:21,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:17:21,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:17:21,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:17:21,409 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:17:21,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:17:21,409 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:17:21,409 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:17:21,409 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:17:21,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:17:21,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:17:21,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:17:21,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:17:21,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:17:21,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:17:21,410 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:17:21,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:17:21,410 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:17:21,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:17:21,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:17:21,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:17:21,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:17:21,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:17:21,411 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 -> 883c6f5172a96f0287ac7e513094d32a0853666f3578c9a6dcc19d38a0beb57e [2025-03-03 22:17:21,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:17:21,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:17:21,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:17:21,638 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:17:21,638 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:17:21,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-76.i [2025-03-03 22:17:22,730 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca8fcacc/6406aea02af646519895af4623b60584/FLAGfba94cfa0 [2025-03-03 22:17:22,980 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:17:22,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-76.i [2025-03-03 22:17:22,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca8fcacc/6406aea02af646519895af4623b60584/FLAGfba94cfa0 [2025-03-03 22:17:23,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca8fcacc/6406aea02af646519895af4623b60584 [2025-03-03 22:17:23,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:17:23,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:17:23,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:17:23,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:17:23,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:17:23,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:17:23" (1/1) ... [2025-03-03 22:17:23,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e28460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:23, skipping insertion in model container [2025-03-03 22:17:23,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:17:23" (1/1) ... [2025-03-03 22:17:23,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:17:23,411 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_fillercode_fillercodestructure_normal_file-76.i[913,926] [2025-03-03 22:17:23,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:17:23,450 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:17:23,457 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_fillercode_fillercodestructure_normal_file-76.i[913,926] [2025-03-03 22:17:23,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:17:23,487 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:17:23,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:23 WrapperNode [2025-03-03 22:17:23,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:17:23,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:17:23,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:17:23,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:17:23,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:23" (1/1) ... [2025-03-03 22:17:23,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:23" (1/1) ... [2025-03-03 22:17:23,515 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2025-03-03 22:17:23,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:17:23,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:17:23,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:17:23,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:17:23,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:23" (1/1) ... [2025-03-03 22:17:23,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:23" (1/1) ... [2025-03-03 22:17:23,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:23" (1/1) ... [2025-03-03 22:17:23,544 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-03 22:17:23,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:23" (1/1) ... [2025-03-03 22:17:23,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:23" (1/1) ... [2025-03-03 22:17:23,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:23" (1/1) ... [2025-03-03 22:17:23,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:23" (1/1) ... [2025-03-03 22:17:23,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:23" (1/1) ... [2025-03-03 22:17:23,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:23" (1/1) ... [2025-03-03 22:17:23,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:17:23,553 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:17:23,553 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:17:23,554 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:17:23,554 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:23" (1/1) ... [2025-03-03 22:17:23,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:17:23,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:17:23,583 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-03 22:17:23,588 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-03 22:17:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:17:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:17:23,602 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:17:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:17:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:17:23,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:17:23,649 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:17:23,651 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:17:23,877 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L122: havoc property_#t~bitwise13#1;havoc property_#t~short14#1; [2025-03-03 22:17:23,899 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 22:17:23,901 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:17:23,915 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:17:23,915 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:17:23,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:17:23 BoogieIcfgContainer [2025-03-03 22:17:23,915 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:17:23,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:17:23,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:17:23,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:17:23,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:17:23" (1/3) ... [2025-03-03 22:17:23,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b553fd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:17:23, skipping insertion in model container [2025-03-03 22:17:23,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:23" (2/3) ... [2025-03-03 22:17:23,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b553fd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:17:23, skipping insertion in model container [2025-03-03 22:17:23,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:17:23" (3/3) ... [2025-03-03 22:17:23,924 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-76.i [2025-03-03 22:17:23,933 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:17:23,935 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-76.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:17:23,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:17:23,984 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;@6496cc85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:17:23,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:17:23,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 47 states have internal predecessors, (67), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 22:17:23,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 22:17:23,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:17:23,997 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:17:23,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:17:24,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:17:24,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1838795237, now seen corresponding path program 1 times [2025-03-03 22:17:24,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:17:24,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688172559] [2025-03-03 22:17:24,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:17:24,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:17:24,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 22:17:24,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 22:17:24,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:17:24,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:17:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 22:17:24,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:17:24,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688172559] [2025-03-03 22:17:24,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688172559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:17:24,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765185777] [2025-03-03 22:17:24,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:17:24,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:17:24,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:17:24,204 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-03 22:17:24,205 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-03 22:17:24,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 22:17:24,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 22:17:24,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:17:24,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:17:24,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:17:24,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:17:24,350 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 22:17:24,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:17:24,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765185777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:17:24,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:17:24,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:17:24,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564913223] [2025-03-03 22:17:24,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:17:24,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:17:24,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:17:24,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:17:24,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:17:24,392 INFO L87 Difference]: Start difference. First operand has 62 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 47 states have internal predecessors, (67), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 22:17:24,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:17:24,406 INFO L93 Difference]: Finished difference Result 114 states and 188 transitions. [2025-03-03 22:17:24,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:17:24,407 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 94 [2025-03-03 22:17:24,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:17:24,411 INFO L225 Difference]: With dead ends: 114 [2025-03-03 22:17:24,412 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 22:17:24,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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-03 22:17:24,416 INFO L435 NwaCegarLoop]: 80 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, 80 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-03-03 22:17:24,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:17:24,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 22:17:24,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-03 22:17:24,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 22:17:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2025-03-03 22:17:24,447 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 94 [2025-03-03 22:17:24,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:17:24,448 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2025-03-03 22:17:24,448 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 22:17:24,448 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2025-03-03 22:17:24,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 22:17:24,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:17:24,451 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:17:24,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:17:24,651 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-03 22:17:24,652 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:17:24,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:17:24,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1876156638, now seen corresponding path program 1 times [2025-03-03 22:17:24,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:17:24,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029778414] [2025-03-03 22:17:24,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:17:24,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:17:24,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 22:17:24,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 22:17:24,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:17:24,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:17:24,782 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 22:17:24,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:17:24,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029778414] [2025-03-03 22:17:24,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029778414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:17:24,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:17:24,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:17:24,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619458790] [2025-03-03 22:17:24,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:17:24,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:17:24,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:17:24,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:17:24,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:17:24,784 INFO L87 Difference]: Start difference. First operand 55 states and 80 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:17:24,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:17:24,825 INFO L93 Difference]: Finished difference Result 131 states and 191 transitions. [2025-03-03 22:17:24,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:17:24,826 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2025-03-03 22:17:24,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:17:24,827 INFO L225 Difference]: With dead ends: 131 [2025-03-03 22:17:24,827 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 22:17:24,828 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-03-03 22:17:24,829 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 32 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:17:24,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 142 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:17:24,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 22:17:24,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2025-03-03 22:17:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 52 states have internal predecessors, (72), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 22:17:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2025-03-03 22:17:24,836 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 94 [2025-03-03 22:17:24,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:17:24,838 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2025-03-03 22:17:24,838 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:17:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2025-03-03 22:17:24,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 22:17:24,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:17:24,840 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:17:24,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:17:24,840 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:17:24,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:17:24,840 INFO L85 PathProgramCache]: Analyzing trace with hash 911258849, now seen corresponding path program 1 times [2025-03-03 22:17:24,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:17:24,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958966343] [2025-03-03 22:17:24,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:17:24,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:17:24,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 22:17:24,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 22:17:24,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:17:24,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:17:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 22:17:25,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:17:25,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958966343] [2025-03-03 22:17:25,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958966343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:17:25,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:17:25,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:17:25,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452408028] [2025-03-03 22:17:25,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:17:25,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:17:25,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:17:25,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:17:25,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:17:25,037 INFO L87 Difference]: Start difference. First operand 67 states and 98 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:17:25,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:17:25,137 INFO L93 Difference]: Finished difference Result 195 states and 288 transitions. [2025-03-03 22:17:25,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:17:25,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2025-03-03 22:17:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:17:25,139 INFO L225 Difference]: With dead ends: 195 [2025-03-03 22:17:25,142 INFO L226 Difference]: Without dead ends: 131 [2025-03-03 22:17:25,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:17:25,143 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 48 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:17:25,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 190 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:17:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-03 22:17:25,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2025-03-03 22:17:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 22:17:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 189 transitions. [2025-03-03 22:17:25,167 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 189 transitions. Word has length 94 [2025-03-03 22:17:25,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:17:25,168 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 189 transitions. [2025-03-03 22:17:25,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:17:25,168 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 189 transitions. [2025-03-03 22:17:25,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 22:17:25,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:17:25,170 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:17:25,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:17:25,170 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:17:25,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:17:25,171 INFO L85 PathProgramCache]: Analyzing trace with hash -885692510, now seen corresponding path program 1 times [2025-03-03 22:17:25,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:17:25,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214748007] [2025-03-03 22:17:25,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:17:25,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:17:25,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 22:17:25,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 22:17:25,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:17:25,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:17:25,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1396655613] [2025-03-03 22:17:25,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:17:25,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:17:25,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:17:25,263 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-03 22:17:25,264 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-03 22:17:25,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 22:17:25,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 22:17:25,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:17:25,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:17:25,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 22:17:25,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:17:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 22:17:25,831 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:17:25,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:17:25,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214748007] [2025-03-03 22:17:25,832 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:17:25,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396655613] [2025-03-03 22:17:25,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396655613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:17:25,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:17:25,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:17:25,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327854318] [2025-03-03 22:17:25,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:17:25,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:17:25,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:17:25,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:17:25,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:17:25,834 INFO L87 Difference]: Start difference. First operand 128 states and 189 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:17:26,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:17:26,429 INFO L93 Difference]: Finished difference Result 821 states and 1218 transitions. [2025-03-03 22:17:26,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 22:17:26,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2025-03-03 22:17:26,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:17:26,436 INFO L225 Difference]: With dead ends: 821 [2025-03-03 22:17:26,436 INFO L226 Difference]: Without dead ends: 696 [2025-03-03 22:17:26,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2025-03-03 22:17:26,437 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 433 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:17:26,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 557 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:17:26,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-03-03 22:17:26,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 435. [2025-03-03 22:17:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 336 states have (on average 1.369047619047619) internal successors, (460), 336 states have internal predecessors, (460), 91 states have call successors, (91), 7 states have call predecessors, (91), 7 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 22:17:26,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 642 transitions. [2025-03-03 22:17:26,481 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 642 transitions. Word has length 94 [2025-03-03 22:17:26,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:17:26,481 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 642 transitions. [2025-03-03 22:17:26,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:17:26,481 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 642 transitions. [2025-03-03 22:17:26,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 22:17:26,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:17:26,482 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:17:26,490 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-03 22:17:26,683 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-03 22:17:26,683 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:17:26,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:17:26,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1601820323, now seen corresponding path program 1 times [2025-03-03 22:17:26,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:17:26,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804996073] [2025-03-03 22:17:26,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:17:26,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:17:26,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 22:17:26,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 22:17:26,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:17:26,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:17:26,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [594994208] [2025-03-03 22:17:26,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:17:26,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:17:26,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:17:26,750 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-03 22:17:26,751 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-03 22:17:26,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 22:17:26,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 22:17:26,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:17:26,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:17:26,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 22:17:26,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:17:26,965 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 22:17:26,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:17:26,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:17:26,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804996073] [2025-03-03 22:17:26,967 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:17:26,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594994208] [2025-03-03 22:17:26,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594994208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:17:26,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:17:26,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:17:26,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758724876] [2025-03-03 22:17:26,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:17:26,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:17:26,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:17:26,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:17:26,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:17:26,968 INFO L87 Difference]: Start difference. First operand 435 states and 642 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:17:27,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:17:27,144 INFO L93 Difference]: Finished difference Result 1750 states and 2599 transitions. [2025-03-03 22:17:27,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:17:27,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2025-03-03 22:17:27,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:17:27,153 INFO L225 Difference]: With dead ends: 1750 [2025-03-03 22:17:27,153 INFO L226 Difference]: Without dead ends: 1318 [2025-03-03 22:17:27,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:17:27,155 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 155 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:17:27,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 905 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:17:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-03-03 22:17:27,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 650. [2025-03-03 22:17:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 523 states have (on average 1.3938814531548758) internal successors, (729), 523 states have internal predecessors, (729), 117 states have call successors, (117), 9 states have call predecessors, (117), 9 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-03 22:17:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 963 transitions. [2025-03-03 22:17:27,226 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 963 transitions. Word has length 94 [2025-03-03 22:17:27,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:17:27,227 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 963 transitions. [2025-03-03 22:17:27,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:17:27,227 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 963 transitions. [2025-03-03 22:17:27,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 22:17:27,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:17:27,228 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:17:27,235 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-03 22:17:27,429 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-03 22:17:27,429 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:17:27,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:17:27,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1055304213, now seen corresponding path program 1 times [2025-03-03 22:17:27,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:17:27,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239830054] [2025-03-03 22:17:27,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:17:27,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:17:27,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 22:17:27,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 22:17:27,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:17:27,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:17:27,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [996704594] [2025-03-03 22:17:27,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:17:27,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:17:27,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:17:27,489 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:17:27,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 22:17:27,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 22:17:27,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 22:17:27,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:17:27,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:17:27,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 22:17:27,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:17:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 22:17:27,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:17:27,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:17:27,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239830054] [2025-03-03 22:17:27,978 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:17:27,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996704594] [2025-03-03 22:17:27,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996704594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:17:27,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:17:27,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 22:17:27,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48978389] [2025-03-03 22:17:27,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:17:27,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 22:17:27,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:17:27,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 22:17:27,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:17:27,981 INFO L87 Difference]: Start difference. First operand 650 states and 963 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:17:28,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:17:28,387 INFO L93 Difference]: Finished difference Result 1006 states and 1481 transitions. [2025-03-03 22:17:28,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:17:28,387 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2025-03-03 22:17:28,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:17:28,392 INFO L225 Difference]: With dead ends: 1006 [2025-03-03 22:17:28,392 INFO L226 Difference]: Without dead ends: 881 [2025-03-03 22:17:28,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:17:28,395 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 370 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:17:28,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 730 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:17:28,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-03 22:17:28,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 666. [2025-03-03 22:17:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 539 states have (on average 1.411873840445269) internal successors, (761), 539 states have internal predecessors, (761), 117 states have call successors, (117), 9 states have call predecessors, (117), 9 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-03 22:17:28,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 995 transitions. [2025-03-03 22:17:28,437 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 995 transitions. Word has length 95 [2025-03-03 22:17:28,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:17:28,438 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 995 transitions. [2025-03-03 22:17:28,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:17:28,438 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 995 transitions. [2025-03-03 22:17:28,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 22:17:28,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:17:28,439 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:17:28,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 22:17:28,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:17:28,640 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:17:28,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:17:28,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1617434835, now seen corresponding path program 1 times [2025-03-03 22:17:28,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:17:28,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291019294] [2025-03-03 22:17:28,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:17:28,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:17:28,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 22:17:28,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 22:17:28,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:17:28,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:17:28,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1335106133] [2025-03-03 22:17:28,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:17:28,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:17:28,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:17:28,678 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:17:28,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 22:17:28,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 22:17:28,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 22:17:28,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:17:28,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:17:28,742 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:17:28,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 22:17:28,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 22:17:28,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:17:28,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:17:28,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:17:28,811 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:17:28,812 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:17:28,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 22:17:29,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:17:29,017 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:17:29,086 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:17:29,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:17:29 BoogieIcfgContainer [2025-03-03 22:17:29,092 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:17:29,093 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:17:29,093 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:17:29,093 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:17:29,094 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:17:23" (3/4) ... [2025-03-03 22:17:29,095 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:17:29,096 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:17:29,097 INFO L158 Benchmark]: Toolchain (without parser) took 5789.74ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.5MB in the beginning and 77.4MB in the end (delta: 34.1MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2025-03-03 22:17:29,098 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:17:29,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.36ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 97.7MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:17:29,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.16ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:17:29,098 INFO L158 Benchmark]: Boogie Preprocessor took 36.69ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 92.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:17:29,098 INFO L158 Benchmark]: IcfgBuilder took 362.04ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 72.1MB in the end (delta: 20.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 22:17:29,098 INFO L158 Benchmark]: TraceAbstraction took 5175.48ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 71.6MB in the beginning and 77.9MB in the end (delta: -6.3MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2025-03-03 22:17:29,099 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 176.2MB. Free memory was 77.9MB in the beginning and 77.4MB in the end (delta: 503.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:17:29,100 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.36ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 97.7MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.16ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.69ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 92.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 362.04ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 72.1MB in the end (delta: 20.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5175.48ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 71.6MB in the beginning and 77.9MB in the end (delta: -6.3MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 176.2MB. Free memory was 77.9MB in the beginning and 77.4MB in the end (delta: 503.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 256.5; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 7.5; [L25] double var_1_4 = 256.2; [L26] double var_1_5 = 2.75; [L27] signed long int var_1_6 = -64; [L28] double var_1_7 = 8.05; [L29] float var_1_8 = 5.25; [L30] signed long int var_1_11 = 4; [L31] unsigned short int var_1_14 = 10000; [L32] unsigned short int var_1_16 = 5; [L33] unsigned short int var_1_17 = 4; [L34] unsigned char var_1_18 = 100; [L35] unsigned char var_1_19 = 1; [L36] unsigned char var_1_20 = 8; [L37] double last_1_var_1_1 = 256.5; [L38] float last_1_var_1_8 = 5.25; [L39] signed long int last_1_var_1_11 = 4; [L40] unsigned short int last_1_var_1_14 = 10000; [L41] unsigned short int last_1_var_1_17 = 4; [L42] unsigned char last_1_var_1_18 = 100; VAL [isInitial=0, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] CALL updateLastVariables() [L114] last_1_var_1_1 = var_1_1 [L115] last_1_var_1_8 = var_1_8 [L116] last_1_var_1_11 = var_1_11 [L117] last_1_var_1_14 = var_1_14 [L118] last_1_var_1_17 = var_1_17 [L119] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L129] RET updateLastVariables() [L130] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L92] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L93] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L93] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L94] var_1_3 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L95] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L96] var_1_4 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L97] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L98] var_1_5 = __VERIFIER_nondet_double() [L99] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L99] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L100] var_1_7 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L101] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L102] CALL assume_abort_if_not(var_1_7 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L102] RET assume_abort_if_not(var_1_7 != 0.0F) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L103] var_1_16 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L104] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L105] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L105] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L106] var_1_19 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L107] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L108] CALL assume_abort_if_not(var_1_19 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L108] RET assume_abort_if_not(var_1_19 <= 64) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L109] var_1_20 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L110] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L111] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L111] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L130] RET updateVariables() [L131] CALL step() [L46] COND FALSE !(\read(var_1_2)) [L55] var_1_17 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L57] COND TRUE ! var_1_2 [L58] var_1_1 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L62] COND FALSE !(var_1_5 > (var_1_3 / var_1_7)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L67] unsigned short int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=0, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L68] EXPR var_1_6 | var_1_6 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=0, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L68] COND FALSE !((var_1_6 + (var_1_6 | var_1_6)) > stepLocal_1) [L71] COND FALSE !(var_1_5 >= var_1_1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L78] COND TRUE var_1_4 <= last_1_var_1_1 [L79] var_1_11 = (last_1_var_1_14 + -128) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L83] signed long int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_0=9872, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L84] COND TRUE (var_1_14 * var_1_17) >= stepLocal_0 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L85] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L122-L123] return (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 7, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1038 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1038 mSDsluCounter, 2604 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1760 mSDsCounter, 203 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1027 IncrementalHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 203 mSolverCounterUnsat, 844 mSDtfsCounter, 1027 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 402 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=666occurred in iteration=6, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 1159 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1132 NumberOfCodeBlocks, 1132 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 652 ConstructedInterpolants, 0 QuantifiedInterpolants, 2516 SizeOfPredicates, 14 NumberOfNonLiveVariables, 972 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 2160/2184 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 22:17:29,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_fillercode_fillercodestructure_normal_file-76.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 883c6f5172a96f0287ac7e513094d32a0853666f3578c9a6dcc19d38a0beb57e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:17:31,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:17:31,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:17:31,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:17:31,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:17:31,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:17:31,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:17:31,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:17:31,144 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:17:31,144 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:17:31,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:17:31,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:17:31,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:17:31,145 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:17:31,146 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:17:31,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:17:31,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:17:31,146 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:17:31,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:17:31,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:17:31,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:17:31,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:17:31,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:17:31,147 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:17:31,147 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:17:31,147 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:17:31,147 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:17:31,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:17:31,147 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:17:31,147 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:17:31,148 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:17:31,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:17:31,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:17:31,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:17:31,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:17:31,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:17:31,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:17:31,148 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:17:31,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:17:31,149 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:17:31,149 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:17:31,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:17:31,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:17:31,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:17:31,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:17:31,149 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 -> 883c6f5172a96f0287ac7e513094d32a0853666f3578c9a6dcc19d38a0beb57e [2025-03-03 22:17:31,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:17:31,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:17:31,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:17:31,468 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:17:31,469 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:17:31,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-76.i [2025-03-03 22:17:32,657 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89e78e334/c842e36e00794615b64e392fa412742b/FLAGfe83ba07a [2025-03-03 22:17:32,884 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:17:32,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-76.i [2025-03-03 22:17:32,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89e78e334/c842e36e00794615b64e392fa412742b/FLAGfe83ba07a [2025-03-03 22:17:33,237 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89e78e334/c842e36e00794615b64e392fa412742b [2025-03-03 22:17:33,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:17:33,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:17:33,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:17:33,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:17:33,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:17:33,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:17:33" (1/1) ... [2025-03-03 22:17:33,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf49a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:33, skipping insertion in model container [2025-03-03 22:17:33,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:17:33" (1/1) ... [2025-03-03 22:17:33,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:17:33,357 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_fillercode_fillercodestructure_normal_file-76.i[913,926] [2025-03-03 22:17:33,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:17:33,407 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:17:33,415 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_fillercode_fillercodestructure_normal_file-76.i[913,926] [2025-03-03 22:17:33,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:17:33,447 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:17:33,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:33 WrapperNode [2025-03-03 22:17:33,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:17:33,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:17:33,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:17:33,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:17:33,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:33" (1/1) ... [2025-03-03 22:17:33,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:33" (1/1) ... [2025-03-03 22:17:33,484 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2025-03-03 22:17:33,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:17:33,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:17:33,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:17:33,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:17:33,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:33" (1/1) ... [2025-03-03 22:17:33,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:33" (1/1) ... [2025-03-03 22:17:33,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:33" (1/1) ... [2025-03-03 22:17:33,506 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-03 22:17:33,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:33" (1/1) ... [2025-03-03 22:17:33,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:33" (1/1) ... [2025-03-03 22:17:33,512 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:33" (1/1) ... [2025-03-03 22:17:33,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:33" (1/1) ... [2025-03-03 22:17:33,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:33" (1/1) ... [2025-03-03 22:17:33,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:33" (1/1) ... [2025-03-03 22:17:33,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:17:33,518 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:17:33,518 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:17:33,518 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:17:33,519 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:33" (1/1) ... [2025-03-03 22:17:33,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:17:33,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:17:33,545 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-03 22:17:33,552 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-03 22:17:33,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:17:33,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:17:33,568 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:17:33,568 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:17:33,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:17:33,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:17:33,626 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:17:33,627 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:17:46,809 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 22:17:46,809 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:17:46,818 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:17:46,818 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:17:46,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:17:46 BoogieIcfgContainer [2025-03-03 22:17:46,819 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:17:46,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:17:46,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:17:46,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:17:46,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:17:33" (1/3) ... [2025-03-03 22:17:46,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5126a5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:17:46, skipping insertion in model container [2025-03-03 22:17:46,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:17:33" (2/3) ... [2025-03-03 22:17:46,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5126a5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:17:46, skipping insertion in model container [2025-03-03 22:17:46,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:17:46" (3/3) ... [2025-03-03 22:17:46,826 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-76.i [2025-03-03 22:17:46,835 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:17:46,836 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-76.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:17:46,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:17:46,893 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;@39cb751b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:17:46,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:17:46,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 22:17:46,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 22:17:46,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:17:46,901 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:17:46,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:17:46,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:17:46,905 INFO L85 PathProgramCache]: Analyzing trace with hash -722190211, now seen corresponding path program 1 times [2025-03-03 22:17:46,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:17:46,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022797385] [2025-03-03 22:17:46,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:17:46,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:17:46,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:17:46,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:17:46,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 22:17:46,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 22:17:47,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 22:17:47,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:17:47,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:17:47,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:17:47,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:17:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-03 22:17:47,642 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:17:47,643 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:17:47,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022797385] [2025-03-03 22:17:47,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022797385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:17:47,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:17:47,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:17:47,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334516576] [2025-03-03 22:17:47,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:17:47,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:17:47,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:17:47,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:17:47,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:17:47,660 INFO L87 Difference]: Start difference. First operand has 53 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 22:17:47,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:17:47,672 INFO L93 Difference]: Finished difference Result 100 states and 166 transitions. [2025-03-03 22:17:47,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:17:47,674 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 91 [2025-03-03 22:17:47,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:17:47,679 INFO L225 Difference]: With dead ends: 100 [2025-03-03 22:17:47,680 INFO L226 Difference]: Without dead ends: 50 [2025-03-03 22:17:47,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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-03 22:17:47,685 INFO L435 NwaCegarLoop]: 74 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, 74 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-03-03 22:17:47,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:17:47,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-03 22:17:47,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-03 22:17:47,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 22:17:47,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2025-03-03 22:17:47,719 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 91 [2025-03-03 22:17:47,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:17:47,720 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2025-03-03 22:17:47,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 22:17:47,720 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2025-03-03 22:17:47,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 22:17:47,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:17:47,723 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:17:47,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 22:17:47,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:17:47,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:17:47,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:17:47,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1847802976, now seen corresponding path program 1 times [2025-03-03 22:17:47,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:17:47,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008684450] [2025-03-03 22:17:47,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:17:47,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:17:47,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:17:47,928 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:17:47,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 22:17:47,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 22:17:48,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 22:17:48,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:17:48,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:17:48,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 22:17:48,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:17:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 22:17:50,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:17:50,369 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:17:50,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008684450] [2025-03-03 22:17:50,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008684450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:17:50,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:17:50,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:17:50,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426443160] [2025-03-03 22:17:50,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:17:50,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:17:50,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:17:50,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:17:50,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:17:50,372 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:17:54,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:17:58,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:17:58,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:17:58,634 INFO L93 Difference]: Finished difference Result 144 states and 216 transitions. [2025-03-03 22:17:58,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:17:58,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2025-03-03 22:17:58,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:17:58,717 INFO L225 Difference]: With dead ends: 144 [2025-03-03 22:17:58,717 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 22:17:58,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 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-03-03 22:17:58,718 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 26 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:17:58,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2025-03-03 22:17:58,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 22:17:58,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2025-03-03 22:17:58,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.378787878787879) internal successors, (91), 66 states have internal predecessors, (91), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 22:17:58,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 143 transitions. [2025-03-03 22:17:58,733 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 143 transitions. Word has length 91 [2025-03-03 22:17:58,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:17:58,733 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 143 transitions. [2025-03-03 22:17:58,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:17:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 143 transitions. [2025-03-03 22:17:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 22:17:58,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:17:58,737 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:17:58,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-03 22:17:58,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:17:58,938 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:17:58,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:17:58,938 INFO L85 PathProgramCache]: Analyzing trace with hash 40348513, now seen corresponding path program 1 times [2025-03-03 22:17:58,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:17:58,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043170028] [2025-03-03 22:17:58,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:17:58,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:17:58,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:17:58,941 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:17:58,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 22:17:58,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 22:17:59,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 22:17:59,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:17:59,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:17:59,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 22:17:59,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:18:05,315 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 22:18:05,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:18:05,315 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:18:05,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043170028] [2025-03-03 22:18:05,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043170028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:18:05,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:18:05,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:18:05,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206715006] [2025-03-03 22:18:05,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:18:05,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:18:05,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:18:05,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:18:05,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:18:05,318 INFO L87 Difference]: Start difference. First operand 95 states and 143 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:18:13,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:18:17,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:18:21,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:18:25,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:18:29,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:18:33,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:18:36,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:18:41,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:18:45,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:18:49,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:18:53,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:18:57,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:19:04,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []