./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-22.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 ef69fa322edc34489e265db107286930d1dc540dffa71844564e9de95771e40f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:33:05,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:33:05,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:33:05,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:33:05,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:33:05,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:33:05,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:33:05,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:33:05,582 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:33:05,583 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:33:05,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:33:05,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:33:05,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:33:05,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:33:05,584 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:33:05,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:33:05,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:33:05,584 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:33:05,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:33:05,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:33:05,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:33:05,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:33:05,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:33:05,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:33:05,585 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:33:05,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:33:05,585 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:33:05,585 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:33:05,585 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:33:05,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:33:05,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:33:05,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:33:05,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:33:05,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:33:05,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:33:05,587 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:33:05,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:33:05,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:33:05,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:33:05,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:33:05,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:33:05,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:33:05,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:33:05,587 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 -> ef69fa322edc34489e265db107286930d1dc540dffa71844564e9de95771e40f [2025-03-03 22:33:05,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:33:05,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:33:05,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:33:05,817 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:33:05,817 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:33:05,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-22.i [2025-03-03 22:33:06,991 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fed84ee/a4cd20244d154900a616b3bd6371e343/FLAG85118b049 [2025-03-03 22:33:07,217 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:33:07,218 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-22.i [2025-03-03 22:33:07,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fed84ee/a4cd20244d154900a616b3bd6371e343/FLAG85118b049 [2025-03-03 22:33:07,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fed84ee/a4cd20244d154900a616b3bd6371e343 [2025-03-03 22:33:07,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:33:07,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:33:07,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:33:07,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:33:07,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:33:07,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:33:07" (1/1) ... [2025-03-03 22:33:07,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14c24ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:07, skipping insertion in model container [2025-03-03 22:33:07,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:33:07" (1/1) ... [2025-03-03 22:33:07,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:33:07,677 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_no-floats_file-22.i[916,929] [2025-03-03 22:33:07,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:33:07,727 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:33:07,735 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_no-floats_file-22.i[916,929] [2025-03-03 22:33:07,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:33:07,774 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:33:07,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:07 WrapperNode [2025-03-03 22:33:07,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:33:07,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:33:07,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:33:07,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:33:07,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:07" (1/1) ... [2025-03-03 22:33:07,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:07" (1/1) ... [2025-03-03 22:33:07,814 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2025-03-03 22:33:07,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:33:07,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:33:07,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:33:07,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:33:07,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:07" (1/1) ... [2025-03-03 22:33:07,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:07" (1/1) ... [2025-03-03 22:33:07,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:07" (1/1) ... [2025-03-03 22:33:07,840 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:33:07,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:07" (1/1) ... [2025-03-03 22:33:07,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:07" (1/1) ... [2025-03-03 22:33:07,844 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:07" (1/1) ... [2025-03-03 22:33:07,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:07" (1/1) ... [2025-03-03 22:33:07,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:07" (1/1) ... [2025-03-03 22:33:07,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:07" (1/1) ... [2025-03-03 22:33:07,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:33:07,851 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:33:07,851 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:33:07,851 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:33:07,852 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:07" (1/1) ... [2025-03-03 22:33:07,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:33:07,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:33:07,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:33:07,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:33:07,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:33:07,896 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:33:07,896 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:33:07,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:33:07,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:33:07,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:33:07,950 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:33:07,952 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:33:08,148 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L90: havoc property_#t~bitwise11#1;havoc property_#t~short12#1; [2025-03-03 22:33:08,170 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 22:33:08,170 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:33:08,189 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:33:08,190 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:33:08,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:33:08 BoogieIcfgContainer [2025-03-03 22:33:08,191 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:33:08,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:33:08,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:33:08,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:33:08,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:33:07" (1/3) ... [2025-03-03 22:33:08,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a6ee8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:33:08, skipping insertion in model container [2025-03-03 22:33:08,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:07" (2/3) ... [2025-03-03 22:33:08,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a6ee8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:33:08, skipping insertion in model container [2025-03-03 22:33:08,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:33:08" (3/3) ... [2025-03-03 22:33:08,201 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-22.i [2025-03-03 22:33:08,211 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:33:08,213 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-22.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:33:08,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:33:08,262 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;@26690f18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:33:08,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:33:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 22:33:08,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 22:33:08,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:33:08,273 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:33:08,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:33:08,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:33:08,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1227151877, now seen corresponding path program 1 times [2025-03-03 22:33:08,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:33:08,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148039650] [2025-03-03 22:33:08,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:33:08,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:33:08,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 22:33:08,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 22:33:08,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:33:08,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:33:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-03 22:33:08,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:33:08,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148039650] [2025-03-03 22:33:08,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148039650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:33:08,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124550244] [2025-03-03 22:33:08,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:33:08,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:33:08,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:33:08,464 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:33:08,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:33:08,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 22:33:08,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 22:33:08,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:33:08,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:33:08,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:33:08,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:33:08,554 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-03 22:33:08,554 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:33:08,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124550244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:33:08,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:33:08,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:33:08,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683872299] [2025-03-03 22:33:08,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:33:08,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:33:08,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:33:08,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:33:08,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:33:08,571 INFO L87 Difference]: Start difference. First operand has 52 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 22:33:08,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:33:08,590 INFO L93 Difference]: Finished difference Result 97 states and 159 transitions. [2025-03-03 22:33:08,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:33:08,592 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2025-03-03 22:33:08,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:33:08,596 INFO L225 Difference]: With dead ends: 97 [2025-03-03 22:33:08,596 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 22:33:08,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:33:08,602 INFO L435 NwaCegarLoop]: 67 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, 67 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-03 22:33:08,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:33:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 22:33:08,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-03 22:33:08,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 22:33:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-03-03 22:33:08,633 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 82 [2025-03-03 22:33:08,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:33:08,633 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-03-03 22:33:08,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 22:33:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-03-03 22:33:08,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 22:33:08,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:33:08,637 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:33:08,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:33:08,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:33:08,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:33:08,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:33:08,838 INFO L85 PathProgramCache]: Analyzing trace with hash 2132536837, now seen corresponding path program 1 times [2025-03-03 22:33:08,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:33:08,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683242776] [2025-03-03 22:33:08,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:33:08,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:33:08,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 22:33:08,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 22:33:08,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:33:08,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:33:09,318 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:33:09,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:33:09,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683242776] [2025-03-03 22:33:09,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683242776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:33:09,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:33:09,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:33:09,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11642947] [2025-03-03 22:33:09,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:33:09,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:33:09,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:33:09,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:33:09,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:33:09,321 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:33:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:33:09,597 INFO L93 Difference]: Finished difference Result 159 states and 230 transitions. [2025-03-03 22:33:09,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:33:09,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2025-03-03 22:33:09,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:33:09,600 INFO L225 Difference]: With dead ends: 159 [2025-03-03 22:33:09,601 INFO L226 Difference]: Without dead ends: 114 [2025-03-03 22:33:09,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:33:09,602 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 99 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:33:09,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 157 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:33:09,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-03 22:33:09,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 83. [2025-03-03 22:33:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:33:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2025-03-03 22:33:09,621 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 82 [2025-03-03 22:33:09,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:33:09,621 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2025-03-03 22:33:09,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:33:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2025-03-03 22:33:09,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 22:33:09,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:33:09,624 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:33:09,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:33:09,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:33:09,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:33:09,625 INFO L85 PathProgramCache]: Analyzing trace with hash 369416486, now seen corresponding path program 1 times [2025-03-03 22:33:09,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:33:09,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046796467] [2025-03-03 22:33:09,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:33:09,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:33:09,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 22:33:09,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 22:33:09,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:33:09,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:33:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:33:09,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:33:09,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046796467] [2025-03-03 22:33:09,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046796467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:33:09,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:33:09,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:33:09,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653920394] [2025-03-03 22:33:09,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:33:09,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:33:09,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:33:09,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:33:09,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:33:09,907 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:33:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:33:10,141 INFO L93 Difference]: Finished difference Result 165 states and 238 transitions. [2025-03-03 22:33:10,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:33:10,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2025-03-03 22:33:10,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:33:10,143 INFO L225 Difference]: With dead ends: 165 [2025-03-03 22:33:10,143 INFO L226 Difference]: Without dead ends: 114 [2025-03-03 22:33:10,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:33:10,144 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 76 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:33:10,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 175 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:33:10,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-03 22:33:10,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 84. [2025-03-03 22:33:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:33:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2025-03-03 22:33:10,167 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 121 transitions. Word has length 83 [2025-03-03 22:33:10,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:33:10,168 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 121 transitions. [2025-03-03 22:33:10,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:33:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2025-03-03 22:33:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 22:33:10,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:33:10,169 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:33:10,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:33:10,170 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:33:10,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:33:10,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1972783398, now seen corresponding path program 1 times [2025-03-03 22:33:10,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:33:10,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880454602] [2025-03-03 22:33:10,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:33:10,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:33:10,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 22:33:10,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 22:33:10,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:33:10,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:33:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:33:10,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:33:10,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880454602] [2025-03-03 22:33:10,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880454602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:33:10,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:33:10,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:33:10,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719420592] [2025-03-03 22:33:10,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:33:10,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:33:10,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:33:10,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:33:10,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:33:10,692 INFO L87 Difference]: Start difference. First operand 84 states and 121 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 22:33:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:33:10,968 INFO L93 Difference]: Finished difference Result 235 states and 333 transitions. [2025-03-03 22:33:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:33:10,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2025-03-03 22:33:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:33:10,970 INFO L225 Difference]: With dead ends: 235 [2025-03-03 22:33:10,971 INFO L226 Difference]: Without dead ends: 190 [2025-03-03 22:33:10,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:33:10,973 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 146 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:33:10,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 223 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:33:10,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-03 22:33:11,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 161. [2025-03-03 22:33:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 118 states have (on average 1.3220338983050848) internal successors, (156), 119 states have internal predecessors, (156), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 22:33:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 232 transitions. [2025-03-03 22:33:11,016 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 232 transitions. Word has length 83 [2025-03-03 22:33:11,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:33:11,016 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 232 transitions. [2025-03-03 22:33:11,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 22:33:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 232 transitions. [2025-03-03 22:33:11,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 22:33:11,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:33:11,018 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:33:11,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:33:11,018 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:33:11,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:33:11,018 INFO L85 PathProgramCache]: Analyzing trace with hash 175832039, now seen corresponding path program 1 times [2025-03-03 22:33:11,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:33:11,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526186782] [2025-03-03 22:33:11,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:33:11,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:33:11,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 22:33:11,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 22:33:11,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:33:11,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:33:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:33:11,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:33:11,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526186782] [2025-03-03 22:33:11,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526186782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:33:11,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:33:11,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:33:11,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390488536] [2025-03-03 22:33:11,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:33:11,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:33:11,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:33:11,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:33:11,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:33:11,059 INFO L87 Difference]: Start difference. First operand 161 states and 232 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:33:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:33:11,091 INFO L93 Difference]: Finished difference Result 286 states and 415 transitions. [2025-03-03 22:33:11,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:33:11,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2025-03-03 22:33:11,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:33:11,094 INFO L225 Difference]: With dead ends: 286 [2025-03-03 22:33:11,094 INFO L226 Difference]: Without dead ends: 169 [2025-03-03 22:33:11,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:33:11,095 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 13 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:33:11,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 123 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:33:11,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-03 22:33:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2025-03-03 22:33:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 118 states have (on average 1.305084745762712) internal successors, (154), 119 states have internal predecessors, (154), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 22:33:11,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 230 transitions. [2025-03-03 22:33:11,122 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 230 transitions. Word has length 83 [2025-03-03 22:33:11,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:33:11,123 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 230 transitions. [2025-03-03 22:33:11,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:33:11,124 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 230 transitions. [2025-03-03 22:33:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 22:33:11,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:33:11,124 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:33:11,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 22:33:11,125 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:33:11,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:33:11,126 INFO L85 PathProgramCache]: Analyzing trace with hash 419864360, now seen corresponding path program 1 times [2025-03-03 22:33:11,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:33:11,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127204339] [2025-03-03 22:33:11,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:33:11,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:33:11,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 22:33:11,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 22:33:11,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:33:11,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:33:11,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:33:11,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 22:33:11,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 22:33:11,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:33:11,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:33:11,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:33:11,227 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:33:11,228 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:33:11,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 22:33:11,232 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 22:33:11,288 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:33:11,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:33:11 BoogieIcfgContainer [2025-03-03 22:33:11,293 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:33:11,294 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:33:11,294 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:33:11,294 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:33:11,295 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:33:08" (3/4) ... [2025-03-03 22:33:11,297 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:33:11,297 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:33:11,298 INFO L158 Benchmark]: Toolchain (without parser) took 3739.45ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 72.1MB in the end (delta: 49.9MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. [2025-03-03 22:33:11,298 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:33:11,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.04ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 109.1MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:33:11,299 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.99ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 106.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:33:11,299 INFO L158 Benchmark]: Boogie Preprocessor took 31.78ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 103.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:33:11,299 INFO L158 Benchmark]: IcfgBuilder took 339.90ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 85.5MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:33:11,300 INFO L158 Benchmark]: TraceAbstraction took 3100.88ms. Allocated memory is still 167.8MB. Free memory was 85.0MB in the beginning and 72.1MB in the end (delta: 12.9MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2025-03-03 22:33:11,300 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 167.8MB. Free memory was 72.1MB in the beginning and 72.1MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:33:11,301 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.18ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.04ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 109.1MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.99ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 106.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.78ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 103.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 339.90ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 85.5MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3100.88ms. Allocated memory is still 167.8MB. Free memory was 85.0MB in the beginning and 72.1MB in the end (delta: 12.9MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 167.8MB. Free memory was 72.1MB in the beginning and 72.1MB 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 to_int at line 62, overapproximation of to_int at line 90, overapproximation of bitwiseAnd at line 52. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L23] unsigned char var_1_4 = 0; [L24] unsigned short int var_1_5 = 256; [L25] unsigned short int var_1_6 = 44772; [L26] signed long int var_1_7 = 5; [L27] signed long int var_1_8 = 7; [L28] signed long int var_1_9 = 64; [L29] signed long int var_1_10 = 128; [L30] unsigned long int var_1_11 = 8; [L31] unsigned long int var_1_12 = 3135928546; [L32] signed short int last_1_var_1_1 = -5; [L33] unsigned long int last_1_var_1_11 = 8; VAL [isInitial=0, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=0, var_1_5=256, var_1_6=44772, var_1_7=5, var_1_8=7, var_1_9=64] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] CALL updateLastVariables() [L86] last_1_var_1_1 = var_1_1 [L87] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=0, var_1_5=256, var_1_6=44772, var_1_7=5, var_1_8=7, var_1_9=64] [L97] RET updateLastVariables() [L98] CALL updateVariables() [L66] var_1_4 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_5=256, var_1_6=44772, var_1_7=5, var_1_8=7, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_5=256, var_1_6=44772, var_1_7=5, var_1_8=7, var_1_9=64] [L67] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_5=256, var_1_6=44772, var_1_7=5, var_1_8=7, var_1_9=64] [L68] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=44772, var_1_7=5, var_1_8=7, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=44772, var_1_7=5, var_1_8=7, var_1_9=64] [L68] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=44772, var_1_7=5, var_1_8=7, var_1_9=64] [L69] var_1_6 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=7, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=7, var_1_9=64] [L70] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=7, var_1_9=64] [L71] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=7, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=7, var_1_9=64] [L71] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=7, var_1_9=64] [L72] var_1_8 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=64] [L73] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=64] [L74] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=64] [L74] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=64] [L75] var_1_9 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L78] var_1_10 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L80] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L81] var_1_12 = __VERIFIER_nondet_ulong() [L82] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_12 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L83] RET assume_abort_if_not(var_1_12 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L98] RET updateVariables() [L99] CALL step() [L37] signed long int stepLocal_0 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10=0, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L38] COND TRUE \read(var_1_4) [L39] var_1_5 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10=0, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L45] COND TRUE var_1_5 == var_1_5 [L46] var_1_1 = (var_1_5 + -16) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10=0, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L52] EXPR var_1_5 & last_1_var_1_11 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10=0, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L52] COND TRUE last_1_var_1_11 >= (var_1_5 & last_1_var_1_11) [L53] var_1_11 = ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) < ((var_1_12 - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) : ((var_1_12 - last_1_var_1_11)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10=0, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L61] COND TRUE var_1_1 < var_1_5 [L62] var_1_7 = (((10.25f + var_1_8) + var_1_9) + var_1_10) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10=0, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_8=0, var_1_9=0] [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR ((((var_1_5 == var_1_5) ? (var_1_1 == ((signed short int) (var_1_5 + -16))) : (var_1_4 ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && (var_1_4 ? (var_1_5 == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? (var_1_5 == ((unsigned short int) ((((last_1_var_1_11) > ((var_1_6 - 8))) ? (last_1_var_1_11) : ((var_1_6 - 8)))))) : 1))) && ((var_1_1 < var_1_5) ? (var_1_7 == ((signed long int) (((10.25f + var_1_8) + var_1_9) + var_1_10))) : 1)) && ((last_1_var_1_11 >= (var_1_5 & last_1_var_1_11)) ? (var_1_11 == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) < ((var_1_12 - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) : ((var_1_12 - last_1_var_1_11)))))) : ((5.7 < var_1_9) ? (var_1_11 == ((unsigned long int) last_1_var_1_11)) : (var_1_11 == ((unsigned long int) last_1_var_1_11)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=3135928548, var_1_8=0, var_1_9=0] [L90-L91] return ((((var_1_5 == var_1_5) ? (var_1_1 == ((signed short int) (var_1_5 + -16))) : (var_1_4 ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && (var_1_4 ? (var_1_5 == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? (var_1_5 == ((unsigned short int) ((((last_1_var_1_11) > ((var_1_6 - 8))) ? (last_1_var_1_11) : ((var_1_6 - 8)))))) : 1))) && ((var_1_1 < var_1_5) ? (var_1_7 == ((signed long int) (((10.25f + var_1_8) + var_1_9) + var_1_10))) : 1)) && ((last_1_var_1_11 >= (var_1_5 & last_1_var_1_11)) ? (var_1_11 == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) < ((var_1_12 - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) : ((var_1_12 - last_1_var_1_11)))))) : ((5.7 < var_1_9) ? (var_1_11 == ((unsigned long int) last_1_var_1_11)) : (var_1_11 == ((unsigned long int) last_1_var_1_11)))) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=3135928548, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=3135928548, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 334 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 334 mSDsluCounter, 745 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 425 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 420 IncrementalHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 320 mSDtfsCounter, 420 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=4, InterpolantAutomatonStates: 23, 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, 5 MinimizatonAttempts, 98 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 579 NumberOfCodeBlocks, 579 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 489 ConstructedInterpolants, 0 QuantifiedInterpolants, 1765 SizeOfPredicates, 0 NumberOfNonLiveVariables, 200 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 1562/1584 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 22:33:11,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_no-floats_file-22.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 ef69fa322edc34489e265db107286930d1dc540dffa71844564e9de95771e40f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:33:13,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:33:13,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:33:13,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:33:13,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:33:13,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:33:13,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:33:13,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:33:13,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:33:13,207 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:33:13,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:33:13,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:33:13,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:33:13,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:33:13,208 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:33:13,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:33:13,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:33:13,208 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:33:13,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:33:13,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:33:13,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:33:13,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:33:13,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:33:13,209 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:33:13,209 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:33:13,209 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:33:13,209 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:33:13,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:33:13,210 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:33:13,210 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:33:13,210 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:33:13,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:33:13,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:33:13,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:33:13,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:33:13,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:33:13,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:33:13,211 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:33:13,211 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:33:13,211 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:33:13,211 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:33:13,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:33:13,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:33:13,211 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:33:13,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:33:13,212 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 -> ef69fa322edc34489e265db107286930d1dc540dffa71844564e9de95771e40f [2025-03-03 22:33:13,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:33:13,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:33:13,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:33:13,433 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:33:13,433 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:33:13,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-22.i [2025-03-03 22:33:14,550 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b37fa5929/6a34f34a4ef04409b83d1c4565f76807/FLAGfab369be3 [2025-03-03 22:33:14,783 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:33:14,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-22.i [2025-03-03 22:33:14,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b37fa5929/6a34f34a4ef04409b83d1c4565f76807/FLAGfab369be3 [2025-03-03 22:33:15,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b37fa5929/6a34f34a4ef04409b83d1c4565f76807 [2025-03-03 22:33:15,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:33:15,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:33:15,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:33:15,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:33:15,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:33:15,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:33:15" (1/1) ... [2025-03-03 22:33:15,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3542d7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:15, skipping insertion in model container [2025-03-03 22:33:15,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:33:15" (1/1) ... [2025-03-03 22:33:15,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:33:15,255 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_no-floats_file-22.i[916,929] [2025-03-03 22:33:15,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:33:15,311 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:33:15,319 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_no-floats_file-22.i[916,929] [2025-03-03 22:33:15,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:33:15,360 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:33:15,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:15 WrapperNode [2025-03-03 22:33:15,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:33:15,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:33:15,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:33:15,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:33:15,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:15" (1/1) ... [2025-03-03 22:33:15,380 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:15" (1/1) ... [2025-03-03 22:33:15,401 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2025-03-03 22:33:15,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:33:15,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:33:15,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:33:15,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:33:15,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:15" (1/1) ... [2025-03-03 22:33:15,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:15" (1/1) ... [2025-03-03 22:33:15,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:15" (1/1) ... [2025-03-03 22:33:15,422 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:33:15,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:15" (1/1) ... [2025-03-03 22:33:15,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:15" (1/1) ... [2025-03-03 22:33:15,429 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:15" (1/1) ... [2025-03-03 22:33:15,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:15" (1/1) ... [2025-03-03 22:33:15,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:15" (1/1) ... [2025-03-03 22:33:15,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:15" (1/1) ... [2025-03-03 22:33:15,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:33:15,434 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:33:15,434 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:33:15,434 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:33:15,436 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:15" (1/1) ... [2025-03-03 22:33:15,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:33:15,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:33:15,463 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:33:15,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:33:15,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:33:15,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:33:15,485 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:33:15,485 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:33:15,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:33:15,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:33:15,549 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:33:15,551 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:33:24,109 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 22:33:24,110 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:33:24,118 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:33:24,119 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:33:24,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:33:24 BoogieIcfgContainer [2025-03-03 22:33:24,119 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:33:24,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:33:24,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:33:24,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:33:24,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:33:15" (1/3) ... [2025-03-03 22:33:24,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4989a0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:33:24, skipping insertion in model container [2025-03-03 22:33:24,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:15" (2/3) ... [2025-03-03 22:33:24,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4989a0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:33:24, skipping insertion in model container [2025-03-03 22:33:24,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:33:24" (3/3) ... [2025-03-03 22:33:24,126 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-22.i [2025-03-03 22:33:24,135 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:33:24,137 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-22.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:33:24,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:33:24,177 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;@29d7129d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:33:24,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:33:24,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 22:33:24,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 22:33:24,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:33:24,186 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:33:24,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:33:24,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:33:24,190 INFO L85 PathProgramCache]: Analyzing trace with hash 389742875, now seen corresponding path program 1 times [2025-03-03 22:33:24,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:33:24,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939700883] [2025-03-03 22:33:24,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:33:24,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:33:24,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:33:24,199 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:33:24,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 22:33:24,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 22:33:24,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 22:33:24,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:33:24,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:33:24,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:33:24,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:33:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-03 22:33:24,392 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:33:24,392 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:33:24,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939700883] [2025-03-03 22:33:24,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939700883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:33:24,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:33:24,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:33:24,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447548004] [2025-03-03 22:33:24,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:33:24,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:33:24,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:33:24,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:33:24,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:33:24,409 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 22:33:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:33:24,425 INFO L93 Difference]: Finished difference Result 78 states and 129 transitions. [2025-03-03 22:33:24,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:33:24,426 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2025-03-03 22:33:24,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:33:24,430 INFO L225 Difference]: With dead ends: 78 [2025-03-03 22:33:24,430 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 22:33:24,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:33:24,433 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:33:24,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:33:24,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 22:33:24,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-03 22:33:24,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 22:33:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2025-03-03 22:33:24,462 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 79 [2025-03-03 22:33:24,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:33:24,463 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2025-03-03 22:33:24,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 22:33:24,463 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2025-03-03 22:33:24,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 22:33:24,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:33:24,466 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:33:24,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 22:33:24,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:33:24,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:33:24,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:33:24,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1455189275, now seen corresponding path program 1 times [2025-03-03 22:33:24,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:33:24,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781543253] [2025-03-03 22:33:24,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:33:24,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:33:24,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:33:24,671 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:33:24,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 22:33:24,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 22:33:24,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 22:33:24,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:33:24,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:33:24,877 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:33:24,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 22:33:25,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 22:33:25,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:33:25,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:33:25,067 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2025-03-03 22:33:25,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1744626807] [2025-03-03 22:33:25,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:33:25,068 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 22:33:25,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 22:33:25,071 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 22:33:25,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-03 22:33:25,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 22:33:25,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 22:33:25,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:33:25,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:33:25,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 22:33:25,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:33:34,878 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 22:33:42,979 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 22:33:55,145 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 22:34:03,252 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 22:34:10,847 WARN L286 SmtUtils]: Spent 7.59s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 22:34:18,942 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 22:34:27,039 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 22:34:34,238 WARN L286 SmtUtils]: Spent 7.20s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 22:34:42,147 WARN L286 SmtUtils]: Spent 7.91s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 22:34:50,281 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)