./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_floatingpointinfluence_has-floats_file-92.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 8a414fc8edfc2d8d8869c2a8a1f169297ecf9d798ee385b139bec6a9c64dec89 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:49:48,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:49:48,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:49:48,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:49:48,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:49:48,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:49:48,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:49:48,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:49:48,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:49:48,503 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:49:48,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:49:48,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:49:48,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:49:48,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:49:48,504 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:49:48,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:49:48,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:49:48,505 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:49:48,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:49:48,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:49:48,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:49:48,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:49:48,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:49:48,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:49:48,505 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:49:48,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:49:48,505 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:49:48,505 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:49:48,505 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:49:48,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:49:48,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:49:48,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:49:48,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:49:48,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:49:48,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:49:48,507 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:49:48,507 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:49:48,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:49:48,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:49:48,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:49:48,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:49:48,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:49:48,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:49:48,507 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 -> 8a414fc8edfc2d8d8869c2a8a1f169297ecf9d798ee385b139bec6a9c64dec89 [2025-03-17 02:49:48,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:49:48,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:49:48,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:49:48,739 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:49:48,739 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:49:48,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-92.i [2025-03-17 02:49:49,817 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ea434e68/5c4e7ea0292c463dbc633f23a0e3ff76/FLAGdcc4adaac [2025-03-17 02:49:50,029 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:49:50,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-92.i [2025-03-17 02:49:50,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ea434e68/5c4e7ea0292c463dbc633f23a0e3ff76/FLAGdcc4adaac [2025-03-17 02:49:50,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ea434e68/5c4e7ea0292c463dbc633f23a0e3ff76 [2025-03-17 02:49:50,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:49:50,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:49:50,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:49:50,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:49:50,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:49:50,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:49:50" (1/1) ... [2025-03-17 02:49:50,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b49f2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:50, skipping insertion in model container [2025-03-17 02:49:50,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:49:50" (1/1) ... [2025-03-17 02:49:50,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:49:50,500 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_floatingpointinfluence_has-floats_file-92.i[917,930] [2025-03-17 02:49:50,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:49:50,553 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:49:50,563 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_floatingpointinfluence_has-floats_file-92.i[917,930] [2025-03-17 02:49:50,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:49:50,602 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:49:50,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:50 WrapperNode [2025-03-17 02:49:50,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:49:50,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:49:50,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:49:50,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:49:50,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:50" (1/1) ... [2025-03-17 02:49:50,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:50" (1/1) ... [2025-03-17 02:49:50,645 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2025-03-17 02:49:50,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:49:50,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:49:50,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:49:50,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:49:50,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:50" (1/1) ... [2025-03-17 02:49:50,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:50" (1/1) ... [2025-03-17 02:49:50,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:50" (1/1) ... [2025-03-17 02:49:50,679 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-17 02:49:50,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:50" (1/1) ... [2025-03-17 02:49:50,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:50" (1/1) ... [2025-03-17 02:49:50,685 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:50" (1/1) ... [2025-03-17 02:49:50,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:50" (1/1) ... [2025-03-17 02:49:50,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:50" (1/1) ... [2025-03-17 02:49:50,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:50" (1/1) ... [2025-03-17 02:49:50,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:49:50,700 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:49:50,700 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:49:50,700 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:49:50,700 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:50" (1/1) ... [2025-03-17 02:49:50,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:49:50,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:49:50,725 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-17 02:49:50,728 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-17 02:49:50,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:49:50,747 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:49:50,747 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:49:50,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:49:50,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:49:50,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:49:50,806 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:49:50,807 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:49:51,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~bitwise15#1;havoc property_#t~short16#1; [2025-03-17 02:49:51,068 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 02:49:51,069 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:49:51,091 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:49:51,092 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:49:51,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:49:51 BoogieIcfgContainer [2025-03-17 02:49:51,092 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:49:51,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:49:51,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:49:51,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:49:51,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:49:50" (1/3) ... [2025-03-17 02:49:51,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741f9e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:49:51, skipping insertion in model container [2025-03-17 02:49:51,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:50" (2/3) ... [2025-03-17 02:49:51,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741f9e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:49:51, skipping insertion in model container [2025-03-17 02:49:51,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:49:51" (3/3) ... [2025-03-17 02:49:51,100 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-92.i [2025-03-17 02:49:51,112 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:49:51,113 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-92.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:49:51,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:49:51,171 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;@63a4288b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:49:51,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:49:51,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 02:49:51,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 02:49:51,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:49:51,186 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:49:51,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:49:51,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:49:51,192 INFO L85 PathProgramCache]: Analyzing trace with hash 866377978, now seen corresponding path program 1 times [2025-03-17 02:49:51,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:49:51,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997823735] [2025-03-17 02:49:51,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:51,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:49:51,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 02:49:51,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 02:49:51,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:51,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:49:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 02:49:51,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:49:51,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997823735] [2025-03-17 02:49:51,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997823735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:49:51,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937247888] [2025-03-17 02:49:51,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:51,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:49:51,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:49:51,395 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-17 02:49:51,397 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-17 02:49:51,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 02:49:51,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 02:49:51,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:51,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:49:51,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:49:51,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:49:51,543 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 02:49:51,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:49:51,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937247888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:49:51,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:49:51,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:49:51,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140270164] [2025-03-17 02:49:51,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:49:51,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:49:51,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:49:51,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:49:51,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:49:51,563 INFO L87 Difference]: Start difference. First operand has 58 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 02:49:51,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:49:51,581 INFO L93 Difference]: Finished difference Result 113 states and 189 transitions. [2025-03-17 02:49:51,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:49:51,583 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 120 [2025-03-17 02:49:51,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:49:51,590 INFO L225 Difference]: With dead ends: 113 [2025-03-17 02:49:51,591 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 02:49:51,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 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-17 02:49:51,594 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:49:51,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:49:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 02:49:51,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-17 02:49:51,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 02:49:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2025-03-17 02:49:51,627 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 120 [2025-03-17 02:49:51,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:49:51,628 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2025-03-17 02:49:51,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 02:49:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2025-03-17 02:49:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 02:49:51,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:49:51,630 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:49:51,637 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-17 02:49:51,834 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-17 02:49:51,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:49:51,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:49:51,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1054824963, now seen corresponding path program 1 times [2025-03-17 02:49:51,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:49:51,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753404158] [2025-03-17 02:49:51,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:51,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:49:51,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 02:49:51,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 02:49:51,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:51,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:49:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 02:49:52,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:49:52,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753404158] [2025-03-17 02:49:52,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753404158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:49:52,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:49:52,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:49:52,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86467812] [2025-03-17 02:49:52,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:49:52,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:49:52,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:49:52,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:49:52,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:49:52,262 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:49:52,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:49:52,421 INFO L93 Difference]: Finished difference Result 112 states and 164 transitions. [2025-03-17 02:49:52,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:49:52,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2025-03-17 02:49:52,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:49:52,423 INFO L225 Difference]: With dead ends: 112 [2025-03-17 02:49:52,423 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 02:49:52,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:49:52,424 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 21 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:49:52,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 161 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:49:52,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 02:49:52,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2025-03-17 02:49:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 02:49:52,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2025-03-17 02:49:52,436 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 120 [2025-03-17 02:49:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:49:52,437 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2025-03-17 02:49:52,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:49:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2025-03-17 02:49:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 02:49:52,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:49:52,441 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:49:52,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:49:52,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:49:52,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:49:52,442 INFO L85 PathProgramCache]: Analyzing trace with hash -900906917, now seen corresponding path program 1 times [2025-03-17 02:49:52,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:49:52,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899309900] [2025-03-17 02:49:52,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:52,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:49:52,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 02:49:52,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 02:49:52,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:52,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:49:52,810 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 02:49:52,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:49:52,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899309900] [2025-03-17 02:49:52,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899309900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:49:52,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351548356] [2025-03-17 02:49:52,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:52,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:49:52,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:49:52,814 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-17 02:49:52,815 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-17 02:49:52,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 02:49:52,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 02:49:52,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:52,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:49:52,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 02:49:52,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:49:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 178 proven. 6 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2025-03-17 02:49:53,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:49:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 02:49:53,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351548356] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 02:49:53,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 02:49:53,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-17 02:49:53,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292455208] [2025-03-17 02:49:53,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 02:49:53,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:49:53,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:49:53,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:49:53,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:49:53,213 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 02:49:53,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:49:53,705 INFO L93 Difference]: Finished difference Result 243 states and 339 transitions. [2025-03-17 02:49:53,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 02:49:53,706 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 122 [2025-03-17 02:49:53,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:49:53,708 INFO L225 Difference]: With dead ends: 243 [2025-03-17 02:49:53,708 INFO L226 Difference]: Without dead ends: 188 [2025-03-17 02:49:53,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2025-03-17 02:49:53,709 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 212 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:49:53,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 325 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:49:53,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-17 02:49:53,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 62. [2025-03-17 02:49:53,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 02:49:53,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2025-03-17 02:49:53,731 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 122 [2025-03-17 02:49:53,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:49:53,732 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2025-03-17 02:49:53,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 02:49:53,733 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2025-03-17 02:49:53,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 02:49:53,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:49:53,736 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:49:53,743 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-17 02:49:53,937 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,SelfDestructingSolverStorable2 [2025-03-17 02:49:53,937 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:49:53,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:49:53,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1586605916, now seen corresponding path program 1 times [2025-03-17 02:49:53,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:49:53,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120740746] [2025-03-17 02:49:53,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:53,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:49:53,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 02:49:53,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 02:49:53,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:53,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 02:49:53,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1323737812] [2025-03-17 02:49:53,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:53,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:49:53,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:49:54,001 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-17 02:49:54,003 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-17 02:49:54,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 02:49:54,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 02:49:54,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:54,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:49:54,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 02:49:54,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:49:54,318 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 456 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-17 02:49:54,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:49:54,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:49:54,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120740746] [2025-03-17 02:49:54,655 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 02:49:54,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323737812] [2025-03-17 02:49:54,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323737812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:49:54,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:49:54,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-17 02:49:54,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185364594] [2025-03-17 02:49:54,655 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 02:49:54,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:49:54,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:49:54,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:49:54,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:49:54,657 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 02:49:58,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 02:49:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:49:58,904 INFO L93 Difference]: Finished difference Result 135 states and 181 transitions. [2025-03-17 02:49:58,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 02:49:58,906 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 122 [2025-03-17 02:49:58,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:49:58,907 INFO L225 Difference]: With dead ends: 135 [2025-03-17 02:49:58,907 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 02:49:58,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-17 02:49:58,909 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 38 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:49:58,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 143 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-17 02:49:58,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 02:49:58,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2025-03-17 02:49:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 02:49:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2025-03-17 02:49:58,931 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 89 transitions. Word has length 122 [2025-03-17 02:49:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:49:58,932 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 89 transitions. [2025-03-17 02:49:58,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 02:49:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2025-03-17 02:49:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 02:49:58,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:49:58,935 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:49:58,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 02:49:59,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:49:59,137 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:49:59,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:49:59,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1597109020, now seen corresponding path program 1 times [2025-03-17 02:49:59,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:49:59,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805200496] [2025-03-17 02:49:59,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:59,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:49:59,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 02:49:59,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 02:49:59,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:59,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 02:49:59,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [685067960] [2025-03-17 02:49:59,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:59,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:49:59,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:49:59,182 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-17 02:49:59,183 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-17 02:49:59,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 02:49:59,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 02:49:59,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:59,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:49:59,257 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:49:59,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 02:49:59,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 02:49:59,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:59,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:49:59,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:49:59,342 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:49:59,343 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:49:59,353 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-17 02:49:59,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:49:59,548 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 02:49:59,605 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:49:59,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:49:59 BoogieIcfgContainer [2025-03-17 02:49:59,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:49:59,611 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:49:59,611 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:49:59,611 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:49:59,611 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:49:51" (3/4) ... [2025-03-17 02:49:59,613 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:49:59,613 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:49:59,614 INFO L158 Benchmark]: Toolchain (without parser) took 9236.84ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 98.2MB in the end (delta: 34.7MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2025-03-17 02:49:59,614 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:49:59,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.19ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 120.0MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:49:59,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.41ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 118.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:49:59,614 INFO L158 Benchmark]: Boogie Preprocessor took 43.28ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 115.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:49:59,615 INFO L158 Benchmark]: IcfgBuilder took 392.87ms. Allocated memory is still 167.8MB. Free memory was 115.4MB in the beginning and 96.2MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:49:59,615 INFO L158 Benchmark]: TraceAbstraction took 8516.39ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 98.2MB in the end (delta: -2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:49:59,615 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 98.2MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:49:59,616 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.22ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.19ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 120.0MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.41ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 118.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.28ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 115.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 392.87ms. Allocated memory is still 167.8MB. Free memory was 115.4MB in the beginning and 96.2MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8516.39ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 98.2MB in the end (delta: -2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 98.2MB in the end (delta: 50.8kB). 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 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_2 = 2; [L24] signed char var_1_3 = 8; [L25] signed char var_1_4 = 0; [L26] signed char var_1_5 = 32; [L27] signed char var_1_6 = 10; [L28] double var_1_7 = 1000000.625; [L29] double var_1_8 = 16.65; [L30] double var_1_9 = 15.5; [L31] signed short int var_1_10 = 500; [L32] unsigned short int var_1_11 = 8; [L33] unsigned char var_1_13 = 0; [L34] unsigned short int var_1_14 = 100; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 0; [L37] float var_1_17 = 2.4; [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] FCALL updateLastVariables() [L102] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_char() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L63] CALL assume_abort_if_not(var_1_2 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L63] RET assume_abort_if_not(var_1_2 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L64] var_1_3 = __VERIFIER_nondet_char() [L65] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L65] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L66] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L66] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L67] var_1_4 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L68] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L69] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L69] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L70] var_1_5 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L72] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L72] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L73] var_1_6 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L74] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L75] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L75] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L76] var_1_8 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_9=31/2] [L77] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_9=31/2] [L78] var_1_9 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L79] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L80] var_1_14 = __VERIFIER_nondet_ushort() [L81] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L81] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L82] CALL assume_abort_if_not(var_1_14 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L82] RET assume_abort_if_not(var_1_14 <= 65535) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L83] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L83] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L84] var_1_15 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L85] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L86] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L86] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L87] var_1_16 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L88] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L89] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L89] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L102] RET updateVariables() [L103] CALL step() [L41] var_1_1 = ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L42] EXPR var_1_6 & var_1_3 VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L42] signed long int stepLocal_0 = (~ var_1_5) * (var_1_6 & var_1_3); [L43] COND TRUE stepLocal_0 >= var_1_4 [L44] var_1_7 = var_1_8 VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L48] var_1_10 = ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))) [L49] signed long int stepLocal_1 = var_1_6 / var_1_14; VAL [isInitial=1, stepLocal_1=0, var_1_10=2, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L50] COND FALSE !(stepLocal_1 < -100) [L53] var_1_13 = (var_1_15 && var_1_16) VAL [isInitial=1, var_1_10=2, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L55] var_1_17 = var_1_8 VAL [isInitial=1, var_1_10=2, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L56] COND TRUE ! var_1_13 [L57] var_1_11 = (var_1_5 + (((((var_1_6) > (1)) ? (var_1_6) : (1))) + 64)) VAL [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : (var_1_7 == ((double) var_1_9))) VAL [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L94] EXPR var_1_6 & var_1_3 VAL [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L94] EXPR (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : (var_1_7 == ((double) var_1_9))) VAL [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L94-L95] return (((((var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : (var_1_7 == ((double) var_1_9)))) && (var_1_10 == ((signed short int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))))) && ((! var_1_13) ? (var_1_11 == ((unsigned short int) (var_1_5 + (((((var_1_6) > (1)) ? (var_1_6) : (1))) + 64)))) : 1)) && (((var_1_6 / var_1_14) < -100) ? (var_1_13 == ((unsigned char) (! (! (! var_1_15))))) : (var_1_13 == ((unsigned char) (var_1_15 && var_1_16))))) && (var_1_17 == ((float) var_1_8)) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 105 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 5, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 709 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 427 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 628 IncrementalHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 282 mSDtfsCounter, 628 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 559 GetRequests, 515 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=4, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 133 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1092 NumberOfCodeBlocks, 1092 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 841 ConstructedInterpolants, 1 QuantifiedInterpolants, 2325 SizeOfPredicates, 4 NumberOfNonLiveVariables, 842 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 4695/4788 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-17 02:49:59,637 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_floatingpointinfluence_has-floats_file-92.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 8a414fc8edfc2d8d8869c2a8a1f169297ecf9d798ee385b139bec6a9c64dec89 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:50:01,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:50:01,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:50:01,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:50:01,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:50:01,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:50:01,497 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:50:01,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:50:01,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:50:01,497 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:50:01,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:50:01,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:50:01,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:50:01,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:50:01,498 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:50:01,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:50:01,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:50:01,498 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:50:01,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:50:01,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:50:01,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:50:01,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:50:01,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:50:01,499 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:50:01,499 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:50:01,499 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:50:01,499 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:50:01,499 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:50:01,499 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:50:01,499 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:50:01,499 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:50:01,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:50:01,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:50:01,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:50:01,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:50:01,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:50:01,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:50:01,500 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:50:01,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:50:01,500 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:50:01,500 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:50:01,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:50:01,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:50:01,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:50:01,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:50:01,501 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 -> 8a414fc8edfc2d8d8869c2a8a1f169297ecf9d798ee385b139bec6a9c64dec89 [2025-03-17 02:50:01,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:50:01,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:50:01,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:50:01,773 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:50:01,773 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:50:01,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-92.i [2025-03-17 02:50:02,925 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fb6268ea/ae16a4e630bc4f2b89ed7369f0ef7f55/FLAGca435daf6 [2025-03-17 02:50:03,130 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:50:03,131 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-92.i [2025-03-17 02:50:03,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fb6268ea/ae16a4e630bc4f2b89ed7369f0ef7f55/FLAGca435daf6 [2025-03-17 02:50:03,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fb6268ea/ae16a4e630bc4f2b89ed7369f0ef7f55 [2025-03-17 02:50:03,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:50:03,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:50:03,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:50:03,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:50:03,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:50:03,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:50:03" (1/1) ... [2025-03-17 02:50:03,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21d45283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:50:03, skipping insertion in model container [2025-03-17 02:50:03,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:50:03" (1/1) ... [2025-03-17 02:50:03,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:50:03,587 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_floatingpointinfluence_has-floats_file-92.i[917,930] [2025-03-17 02:50:03,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:50:03,637 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:50:03,645 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_floatingpointinfluence_has-floats_file-92.i[917,930] [2025-03-17 02:50:03,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:50:03,672 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:50:03,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:50:03 WrapperNode [2025-03-17 02:50:03,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:50:03,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:50:03,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:50:03,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:50:03,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:50:03" (1/1) ... [2025-03-17 02:50:03,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:50:03" (1/1) ... [2025-03-17 02:50:03,710 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2025-03-17 02:50:03,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:50:03,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:50:03,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:50:03,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:50:03,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:50:03" (1/1) ... [2025-03-17 02:50:03,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:50:03" (1/1) ... [2025-03-17 02:50:03,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:50:03" (1/1) ... [2025-03-17 02:50:03,732 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-17 02:50:03,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:50:03" (1/1) ... [2025-03-17 02:50:03,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:50:03" (1/1) ... [2025-03-17 02:50:03,742 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:50:03" (1/1) ... [2025-03-17 02:50:03,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:50:03" (1/1) ... [2025-03-17 02:50:03,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:50:03" (1/1) ... [2025-03-17 02:50:03,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:50:03" (1/1) ... [2025-03-17 02:50:03,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:50:03,749 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:50:03,749 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:50:03,749 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:50:03,751 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:50:03" (1/1) ... [2025-03-17 02:50:03,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:50:03,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:50:03,775 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-17 02:50:03,781 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-17 02:50:03,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:50:03,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:50:03,795 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:50:03,795 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:50:03,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:50:03,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:50:03,844 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:50:03,845 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:50:04,231 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 02:50:04,231 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:50:04,239 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:50:04,240 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:50:04,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:50:04 BoogieIcfgContainer [2025-03-17 02:50:04,241 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:50:04,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:50:04,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:50:04,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:50:04,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:50:03" (1/3) ... [2025-03-17 02:50:04,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f8e947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:50:04, skipping insertion in model container [2025-03-17 02:50:04,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:50:03" (2/3) ... [2025-03-17 02:50:04,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f8e947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:50:04, skipping insertion in model container [2025-03-17 02:50:04,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:50:04" (3/3) ... [2025-03-17 02:50:04,249 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-92.i [2025-03-17 02:50:04,258 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:50:04,259 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-92.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:50:04,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:50:04,299 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;@7eebf702, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:50:04,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:50:04,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 02:50:04,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 02:50:04,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:50:04,310 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:50:04,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:50:04,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:50:04,313 INFO L85 PathProgramCache]: Analyzing trace with hash -764194179, now seen corresponding path program 1 times [2025-03-17 02:50:04,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:50:04,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465699160] [2025-03-17 02:50:04,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:50:04,321 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-17 02:50:04,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:50:04,323 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-17 02:50:04,324 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-17 02:50:04,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 02:50:04,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 02:50:04,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:50:04,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:50:04,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 02:50:04,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:50:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 456 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-17 02:50:05,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:50:05,715 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:50:05,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465699160] [2025-03-17 02:50:05,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465699160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:50:05,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [888745466] [2025-03-17 02:50:05,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:50:05,716 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 02:50:05,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 02:50:05,718 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 02:50:05,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2025-03-17 02:50:05,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 02:50:06,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 02:50:06,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:50:06,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:50:06,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 02:50:06,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:50:06,359 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 456 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-17 02:50:06,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:50:06,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [888745466] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:50:06,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 02:50:06,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-17 02:50:06,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713243479] [2025-03-17 02:50:06,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 02:50:06,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:50:06,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:50:06,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:50:06,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:50:06,616 INFO L87 Difference]: Start difference. First operand has 47 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 02:50:08,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:50:08,010 INFO L93 Difference]: Finished difference Result 103 states and 171 transitions. [2025-03-17 02:50:08,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 02:50:08,021 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 115 [2025-03-17 02:50:08,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:50:08,025 INFO L225 Difference]: With dead ends: 103 [2025-03-17 02:50:08,025 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 02:50:08,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-17 02:50:08,029 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 39 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:50:08,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 142 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 02:50:08,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 02:50:08,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2025-03-17 02:50:08,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 02:50:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2025-03-17 02:50:08,068 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 115 [2025-03-17 02:50:08,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:50:08,069 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2025-03-17 02:50:08,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 02:50:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2025-03-17 02:50:08,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 02:50:08,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:50:08,071 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:50:08,081 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-17 02:50:08,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2025-03-17 02:50:08,477 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,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 02:50:08,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:50:08,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:50:08,479 INFO L85 PathProgramCache]: Analyzing trace with hash -735565028, now seen corresponding path program 1 times [2025-03-17 02:50:08,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:50:08,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824289657] [2025-03-17 02:50:08,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:50:08,479 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-17 02:50:08,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:50:08,481 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-17 02:50:08,482 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-17 02:50:08,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 02:50:08,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 02:50:08,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:50:08,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:50:08,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 02:50:08,656 INFO L279 TraceCheckSpWp]: Computing forward predicates...