./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-68.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_loopvsstraightlinecode_25-while_file-68.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 cc0f50b1e3335724e12d8f8ff753e8d68608bc02a42487f7cc093f8f08f9715b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:23:34,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:23:34,739 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:23:34,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:23:34,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:23:34,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:23:34,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:23:34,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:23:34,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:23:34,770 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:23:34,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:23:34,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:23:34,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:23:34,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:23:34,772 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:23:34,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:23:34,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:23:34,772 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:23:34,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:23:34,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:23:34,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:23:34,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:23:34,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:23:34,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:23:34,773 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:23:34,773 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:23:34,773 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:23:34,773 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:23:34,773 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:23:34,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:23:34,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:23:34,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:23:34,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:23:34,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:23:34,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:23:34,774 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:23:34,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:23:34,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:23:34,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:23:34,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:23:34,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:23:34,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:23:34,775 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:23:34,775 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 -> cc0f50b1e3335724e12d8f8ff753e8d68608bc02a42487f7cc093f8f08f9715b [2025-03-03 23:23:34,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:23:35,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:23:35,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:23:35,010 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:23:35,010 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:23:35,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-68.i [2025-03-03 23:23:36,159 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79dbbf3e4/1de0258d0799472fa9e7bd520c542c07/FLAG093ae7407 [2025-03-03 23:23:36,379 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:23:36,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-68.i [2025-03-03 23:23:36,385 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79dbbf3e4/1de0258d0799472fa9e7bd520c542c07/FLAG093ae7407 [2025-03-03 23:23:36,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79dbbf3e4/1de0258d0799472fa9e7bd520c542c07 [2025-03-03 23:23:36,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:23:36,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:23:36,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:23:36,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:23:36,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:23:36,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:23:36" (1/1) ... [2025-03-03 23:23:36,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:36, skipping insertion in model container [2025-03-03 23:23:36,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:23:36" (1/1) ... [2025-03-03 23:23:36,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:23:36,826 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_loopvsstraightlinecode_25-while_file-68.i[915,928] [2025-03-03 23:23:36,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:23:36,873 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:23:36,882 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_loopvsstraightlinecode_25-while_file-68.i[915,928] [2025-03-03 23:23:36,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:23:36,913 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:23:36,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:36 WrapperNode [2025-03-03 23:23:36,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:23:36,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:23:36,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:23:36,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:23:36,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:36" (1/1) ... [2025-03-03 23:23:36,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:36" (1/1) ... [2025-03-03 23:23:36,944 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-03-03 23:23:36,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:23:36,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:23:36,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:23:36,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:23:36,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:36" (1/1) ... [2025-03-03 23:23:36,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:36" (1/1) ... [2025-03-03 23:23:36,955 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:36" (1/1) ... [2025-03-03 23:23:36,967 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 23:23:36,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:36" (1/1) ... [2025-03-03 23:23:36,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:36" (1/1) ... [2025-03-03 23:23:36,971 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:36" (1/1) ... [2025-03-03 23:23:36,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:36" (1/1) ... [2025-03-03 23:23:36,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:36" (1/1) ... [2025-03-03 23:23:36,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:36" (1/1) ... [2025-03-03 23:23:36,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:23:36,983 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:23:36,983 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:23:36,983 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:23:36,984 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:36" (1/1) ... [2025-03-03 23:23:36,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:23:36,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:23:37,011 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 23:23:37,013 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 23:23:37,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:23:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:23:37,031 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:23:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:23:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:23:37,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:23:37,082 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:23:37,083 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:23:37,259 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~bitwise13#1;havoc property_#t~short14#1; [2025-03-03 23:23:37,287 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 23:23:37,288 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:23:37,299 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:23:37,300 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:23:37,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:23:37 BoogieIcfgContainer [2025-03-03 23:23:37,300 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:23:37,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:23:37,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:23:37,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:23:37,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:23:36" (1/3) ... [2025-03-03 23:23:37,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4559032a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:23:37, skipping insertion in model container [2025-03-03 23:23:37,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:36" (2/3) ... [2025-03-03 23:23:37,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4559032a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:23:37, skipping insertion in model container [2025-03-03 23:23:37,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:23:37" (3/3) ... [2025-03-03 23:23:37,307 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-68.i [2025-03-03 23:23:37,317 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:23:37,318 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-68.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:23:37,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:23:37,374 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;@6b674495, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:23:37,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:23:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 23:23:37,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 23:23:37,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:23:37,388 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:23:37,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:23:37,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:23:37,393 INFO L85 PathProgramCache]: Analyzing trace with hash -38240136, now seen corresponding path program 1 times [2025-03-03 23:23:37,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:23:37,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47549488] [2025-03-03 23:23:37,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:23:37,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:23:37,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 23:23:37,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 23:23:37,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:23:37,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:23:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-03 23:23:37,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:23:37,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47549488] [2025-03-03 23:23:37,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47549488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:23:37,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936293482] [2025-03-03 23:23:37,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:23:37,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:23:37,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:23:37,604 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 23:23:37,606 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 23:23:37,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 23:23:37,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 23:23:37,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:23:37,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:23:37,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:23:37,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:23:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-03 23:23:37,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:23:37,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936293482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:23:37,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:23:37,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:23:37,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526058314] [2025-03-03 23:23:37,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:23:37,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:23:37,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:23:37,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:23:37,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:23:37,772 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 23:23:37,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:23:37,791 INFO L93 Difference]: Finished difference Result 102 states and 165 transitions. [2025-03-03 23:23:37,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:23:37,793 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2025-03-03 23:23:37,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:23:37,796 INFO L225 Difference]: With dead ends: 102 [2025-03-03 23:23:37,797 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 23:23:37,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:23:37,800 INFO L435 NwaCegarLoop]: 71 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, 71 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 23:23:37,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:23:37,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 23:23:37,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-03 23:23:37,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 23:23:37,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2025-03-03 23:23:37,830 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 94 [2025-03-03 23:23:37,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:23:37,831 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2025-03-03 23:23:37,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 23:23:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2025-03-03 23:23:37,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 23:23:37,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:23:37,836 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:23:37,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 23:23:38,041 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 23:23:38,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:23:38,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:23:38,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1426722140, now seen corresponding path program 1 times [2025-03-03 23:23:38,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:23:38,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191252024] [2025-03-03 23:23:38,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:23:38,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:23:38,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 23:23:38,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 23:23:38,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:23:38,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:23:38,539 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 23:23:38,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:23:38,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191252024] [2025-03-03 23:23:38,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191252024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:23:38,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:23:38,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:23:38,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508009837] [2025-03-03 23:23:38,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:23:38,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:23:38,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:23:38,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:23:38,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:23:38,543 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 23:23:38,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:23:38,649 INFO L93 Difference]: Finished difference Result 118 states and 169 transitions. [2025-03-03 23:23:38,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:23:38,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2025-03-03 23:23:38,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:23:38,652 INFO L225 Difference]: With dead ends: 118 [2025-03-03 23:23:38,652 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 23:23:38,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:23:38,653 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 20 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:23:38,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 232 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:23:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 23:23:38,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2025-03-03 23:23:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 23:23:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2025-03-03 23:23:38,662 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 94 [2025-03-03 23:23:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:23:38,663 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2025-03-03 23:23:38,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 23:23:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2025-03-03 23:23:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 23:23:38,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:23:38,665 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:23:38,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:23:38,665 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:23:38,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:23:38,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1481858796, now seen corresponding path program 1 times [2025-03-03 23:23:38,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:23:38,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677534024] [2025-03-03 23:23:38,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:23:38,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:23:38,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 23:23:38,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 23:23:38,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:23:38,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:23:38,906 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-03 23:23:38,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:23:38,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677534024] [2025-03-03 23:23:38,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677534024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:23:38,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919779673] [2025-03-03 23:23:38,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:23:38,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:23:38,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:23:38,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:23:38,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 23:23:38,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 23:23:38,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 23:23:38,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:23:38,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:23:38,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 23:23:38,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:23:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-03 23:23:39,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:23:39,513 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-03 23:23:39,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919779673] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:23:39,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:23:39,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-03-03 23:23:39,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057101998] [2025-03-03 23:23:39,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:23:39,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 23:23:39,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:23:39,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 23:23:39,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-03 23:23:39,515 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand has 15 states, 14 states have (on average 4.357142857142857) internal successors, (61), 15 states have internal predecessors, (61), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2025-03-03 23:23:39,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:23:39,932 INFO L93 Difference]: Finished difference Result 230 states and 328 transitions. [2025-03-03 23:23:39,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 23:23:39,933 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.357142857142857) internal successors, (61), 15 states have internal predecessors, (61), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) Word has length 95 [2025-03-03 23:23:39,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:23:39,934 INFO L225 Difference]: With dead ends: 230 [2025-03-03 23:23:39,934 INFO L226 Difference]: Without dead ends: 173 [2025-03-03 23:23:39,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2025-03-03 23:23:39,937 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 296 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:23:39,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 255 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:23:39,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-03 23:23:39,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 132. [2025-03-03 23:23:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 100 states have (on average 1.36) internal successors, (136), 100 states have internal predecessors, (136), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 23:23:39,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 192 transitions. [2025-03-03 23:23:39,962 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 192 transitions. Word has length 95 [2025-03-03 23:23:39,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:23:39,962 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 192 transitions. [2025-03-03 23:23:39,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.357142857142857) internal successors, (61), 15 states have internal predecessors, (61), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2025-03-03 23:23:39,962 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 192 transitions. [2025-03-03 23:23:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 23:23:39,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:23:39,965 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:23:39,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 23:23:40,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 23:23:40,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:23:40,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:23:40,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1897812319, now seen corresponding path program 1 times [2025-03-03 23:23:40,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:23:40,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585247454] [2025-03-03 23:23:40,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:23:40,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:23:40,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 23:23:40,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 23:23:40,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:23:40,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:23:40,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1488957145] [2025-03-03 23:23:40,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:23:40,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:23:40,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:23:40,198 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:23:40,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 23:23:40,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 23:23:40,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 23:23:40,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:23:40,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:23:40,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 23:23:40,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:23:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 23:23:40,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:23:40,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:23:40,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585247454] [2025-03-03 23:23:40,564 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 23:23:40,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488957145] [2025-03-03 23:23:40,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488957145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:23:40,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:23:40,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 23:23:40,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798923600] [2025-03-03 23:23:40,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:23:40,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:23:40,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:23:40,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:23:40,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:23:40,566 INFO L87 Difference]: Start difference. First operand 132 states and 192 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 23:23:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:23:40,695 INFO L93 Difference]: Finished difference Result 297 states and 431 transitions. [2025-03-03 23:23:40,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:23:40,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2025-03-03 23:23:40,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:23:40,699 INFO L225 Difference]: With dead ends: 297 [2025-03-03 23:23:40,700 INFO L226 Difference]: Without dead ends: 166 [2025-03-03 23:23:40,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:23:40,702 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 21 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:23:40,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 241 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:23:40,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-03 23:23:40,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-03-03 23:23:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 118 states have internal predecessors, (155), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 23:23:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 239 transitions. [2025-03-03 23:23:40,725 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 239 transitions. Word has length 96 [2025-03-03 23:23:40,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:23:40,726 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 239 transitions. [2025-03-03 23:23:40,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 23:23:40,726 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 239 transitions. [2025-03-03 23:23:40,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 23:23:40,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:23:40,727 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:23:40,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 23:23:40,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:23:40,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:23:40,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:23:40,931 INFO L85 PathProgramCache]: Analyzing trace with hash -817609373, now seen corresponding path program 1 times [2025-03-03 23:23:40,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:23:40,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729913422] [2025-03-03 23:23:40,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:23:40,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:23:40,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 23:23:40,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 23:23:40,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:23:40,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:23:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 23:23:41,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:23:41,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729913422] [2025-03-03 23:23:41,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729913422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:23:41,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:23:41,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:23:41,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194066337] [2025-03-03 23:23:41,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:23:41,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:23:41,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:23:41,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:23:41,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:23:41,410 INFO L87 Difference]: Start difference. First operand 166 states and 239 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 23:23:41,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:23:41,670 INFO L93 Difference]: Finished difference Result 359 states and 507 transitions. [2025-03-03 23:23:41,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:23:41,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2025-03-03 23:23:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:23:41,672 INFO L225 Difference]: With dead ends: 359 [2025-03-03 23:23:41,672 INFO L226 Difference]: Without dead ends: 230 [2025-03-03 23:23:41,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:23:41,673 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 133 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:23:41,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 401 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:23:41,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-03 23:23:41,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 209. [2025-03-03 23:23:41,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 152 states have (on average 1.25) internal successors, (190), 154 states have internal predecessors, (190), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 47 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-03 23:23:41,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 288 transitions. [2025-03-03 23:23:41,701 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 288 transitions. Word has length 98 [2025-03-03 23:23:41,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:23:41,701 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 288 transitions. [2025-03-03 23:23:41,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 23:23:41,702 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 288 transitions. [2025-03-03 23:23:41,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 23:23:41,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:23:41,703 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:23:41,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:23:41,703 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:23:41,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:23:41,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1440450791, now seen corresponding path program 1 times [2025-03-03 23:23:41,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:23:41,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255466510] [2025-03-03 23:23:41,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:23:41,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:23:41,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 23:23:41,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 23:23:41,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:23:41,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:23:41,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1760255719] [2025-03-03 23:23:41,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:23:41,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:23:41,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:23:41,735 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:23:41,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 23:23:41,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 23:23:41,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 23:23:41,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:23:41,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:23:41,798 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:23:41,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 23:23:41,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 23:23:41,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:23:41,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:23:41,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:23:41,865 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:23:41,866 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:23:41,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 23:23:42,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:23:42,072 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 23:23:42,109 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:23:42,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:23:42 BoogieIcfgContainer [2025-03-03 23:23:42,111 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:23:42,112 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:23:42,112 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:23:42,112 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:23:42,113 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:23:37" (3/4) ... [2025-03-03 23:23:42,114 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:23:42,114 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:23:42,115 INFO L158 Benchmark]: Toolchain (without parser) took 5393.80ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 132.3MB in the beginning and 99.5MB in the end (delta: 32.8MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. [2025-03-03 23:23:42,115 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:23:42,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.79ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 120.1MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:23:42,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.83ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 118.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:23:42,116 INFO L158 Benchmark]: Boogie Preprocessor took 37.81ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 116.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:23:42,116 INFO L158 Benchmark]: IcfgBuilder took 317.38ms. Allocated memory is still 167.8MB. Free memory was 116.8MB in the beginning and 99.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:23:42,116 INFO L158 Benchmark]: TraceAbstraction took 4809.36ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 99.1MB in the beginning and 99.5MB in the end (delta: -462.1kB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2025-03-03 23:23:42,116 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 201.3MB. Free memory was 99.5MB in the beginning and 99.5MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:23:42,117 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.21ms. Allocated memory is still 226.5MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.79ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 120.1MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.83ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 118.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.81ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 116.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 317.38ms. Allocated memory is still 167.8MB. Free memory was 116.8MB in the beginning and 99.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4809.36ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 99.1MB in the beginning and 99.5MB in the end (delta: -462.1kB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 201.3MB. Free memory was 99.5MB in the beginning and 99.5MB in the end (delta: 33.1kB). 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 shiftRight at line 48, overapproximation of shiftRight at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 39, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] float var_1_2 = 64.5; [L24] float var_1_3 = 16.8; [L25] signed long int var_1_8 = 10; [L26] signed long int var_1_9 = 25; [L27] double var_1_10 = 0.75; [L28] signed long int var_1_11 = 2; [L29] signed long int var_1_12 = 32; [L30] unsigned char var_1_13 = 0; [L31] unsigned char var_1_14 = 0; [L32] double var_1_15 = 50.2; [L33] signed long int last_1_var_1_9 = 25; [L34] double last_1_var_1_10 = 0.75; VAL [isInitial=0, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_2=129/2, var_1_3=84/5, var_1_8=10, var_1_9=25] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L90] last_1_var_1_9 = var_1_9 [L91] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_2=129/2, var_1_3=84/5, var_1_8=10, var_1_9=25] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_3=84/5, var_1_8=10, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_3=84/5, var_1_8=10, var_1_9=25] [L67] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_3=84/5, var_1_8=10, var_1_9=25] [L68] var_1_3 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=10, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=10, var_1_9=25] [L69] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=10, var_1_9=25] [L70] var_1_8 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L71] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L72] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L72] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L73] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L73] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L74] var_1_11 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L75] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L76] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L76] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L77] var_1_12 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L78] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L79] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L79] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L80] var_1_13 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L81] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L82] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L82] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L83] var_1_14 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L84] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L85] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L85] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L86] var_1_15 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=32, var_1_8=27, var_1_9=25] [L87] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=32, var_1_8=27, var_1_9=25] [L102] RET updateVariables() [L103] CALL step() [L38] signed long int stepLocal_0 = last_1_var_1_9 + last_1_var_1_9; VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=32, var_1_8=27, var_1_9=25] [L39] COND FALSE !((var_1_2 - var_1_3) >= last_1_var_1_10) [L44] var_1_1 = last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L46] signed long int stepLocal_2 = var_1_1; [L47] signed long int stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_1=25, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L48] EXPR var_1_8 >> last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_1=25, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L48] COND FALSE !((var_1_8 >> last_1_var_1_9) > stepLocal_1) [L55] var_1_9 = last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L57] COND TRUE ((((var_1_9) > (var_1_1)) ? (var_1_9) : (var_1_1))) == (var_1_9 * (var_1_11 - var_1_12)) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L58] COND TRUE var_1_13 || var_1_14 [L59] var_1_10 = var_1_15 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_2=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR (((var_1_2 - var_1_3) >= last_1_var_1_10) ? (((last_1_var_1_9 + last_1_var_1_9) >= (last_1_var_1_9 / var_1_8)) ? (var_1_1 == ((signed long int) last_1_var_1_9)) : 1) : (var_1_1 == ((signed long int) last_1_var_1_9))) && (((var_1_8 >> last_1_var_1_9) > var_1_1) ? (((var_1_1 >> 8) > var_1_1) ? (var_1_9 == ((signed long int) var_1_1)) : (var_1_9 == ((signed long int) last_1_var_1_9))) : (var_1_9 == ((signed long int) last_1_var_1_9))) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L94] EXPR var_1_8 >> last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L94] EXPR (((var_1_2 - var_1_3) >= last_1_var_1_10) ? (((last_1_var_1_9 + last_1_var_1_9) >= (last_1_var_1_9 / var_1_8)) ? (var_1_1 == ((signed long int) last_1_var_1_9)) : 1) : (var_1_1 == ((signed long int) last_1_var_1_9))) && (((var_1_8 >> last_1_var_1_9) > var_1_1) ? (((var_1_1 >> 8) > var_1_1) ? (var_1_9 == ((signed long int) var_1_1)) : (var_1_9 == ((signed long int) last_1_var_1_9))) : (var_1_9 == ((signed long int) last_1_var_1_9))) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L94-L95] return ((((var_1_2 - var_1_3) >= last_1_var_1_10) ? (((last_1_var_1_9 + last_1_var_1_9) >= (last_1_var_1_9 / var_1_8)) ? (var_1_1 == ((signed long int) last_1_var_1_9)) : 1) : (var_1_1 == ((signed long int) last_1_var_1_9))) && (((var_1_8 >> last_1_var_1_9) > var_1_1) ? (((var_1_1 >> 8) > var_1_1) ? (var_1_9 == ((signed long int) var_1_1)) : (var_1_9 == ((signed long int) last_1_var_1_9))) : (var_1_9 == ((signed long int) last_1_var_1_9)))) && ((((((var_1_9) > (var_1_1)) ? (var_1_9) : (var_1_1))) == (var_1_9 * (var_1_11 - var_1_12))) ? ((var_1_13 || var_1_14) ? (var_1_10 == ((double) var_1_15)) : (var_1_10 == ((double) var_1_15))) : 1) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 481 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 470 mSDsluCounter, 1200 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 864 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 806 IncrementalHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 336 mSDtfsCounter, 806 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=5, InterpolantAutomatonStates: 37, 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, 72 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 960 NumberOfCodeBlocks, 960 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 753 ConstructedInterpolants, 0 QuantifiedInterpolants, 2273 SizeOfPredicates, 7 NumberOfNonLiveVariables, 670 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 2805/2912 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 23:23:42,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-68.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 cc0f50b1e3335724e12d8f8ff753e8d68608bc02a42487f7cc093f8f08f9715b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:23:43,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:23:43,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:23:43,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:23:43,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:23:43,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:23:43,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:23:43,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:23:43,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:23:43,962 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:23:43,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:23:43,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:23:43,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:23:43,964 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:23:43,964 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:23:43,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:23:43,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:23:43,964 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:23:43,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:23:43,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:23:43,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:23:43,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:23:43,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:23:43,965 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:23:43,965 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:23:43,965 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:23:43,965 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:23:43,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:23:43,965 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:23:43,965 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:23:43,965 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:23:43,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:23:43,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:23:43,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:23:43,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:23:43,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:23:43,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:23:43,967 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:23:43,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:23:43,967 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:23:43,967 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:23:43,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:23:43,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:23:43,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:23:43,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:23:43,968 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 -> cc0f50b1e3335724e12d8f8ff753e8d68608bc02a42487f7cc093f8f08f9715b [2025-03-03 23:23:44,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:23:44,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:23:44,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:23:44,183 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:23:44,183 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:23:44,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-68.i [2025-03-03 23:23:45,368 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffacc885f/5eef067e501b4dbb92c9489cfe619b74/FLAG81f8e4b6e [2025-03-03 23:23:45,528 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:23:45,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-68.i [2025-03-03 23:23:45,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffacc885f/5eef067e501b4dbb92c9489cfe619b74/FLAG81f8e4b6e [2025-03-03 23:23:45,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffacc885f/5eef067e501b4dbb92c9489cfe619b74 [2025-03-03 23:23:45,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:23:45,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:23:45,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:23:45,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:23:45,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:23:45,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:23:45" (1/1) ... [2025-03-03 23:23:45,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5796b6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:45, skipping insertion in model container [2025-03-03 23:23:45,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:23:45" (1/1) ... [2025-03-03 23:23:45,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:23:46,049 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_loopvsstraightlinecode_25-while_file-68.i[915,928] [2025-03-03 23:23:46,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:23:46,103 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:23:46,113 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_loopvsstraightlinecode_25-while_file-68.i[915,928] [2025-03-03 23:23:46,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:23:46,139 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:23:46,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:46 WrapperNode [2025-03-03 23:23:46,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:23:46,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:23:46,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:23:46,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:23:46,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:46" (1/1) ... [2025-03-03 23:23:46,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:46" (1/1) ... [2025-03-03 23:23:46,171 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2025-03-03 23:23:46,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:23:46,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:23:46,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:23:46,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:23:46,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:46" (1/1) ... [2025-03-03 23:23:46,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:46" (1/1) ... [2025-03-03 23:23:46,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:46" (1/1) ... [2025-03-03 23:23:46,195 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 23:23:46,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:46" (1/1) ... [2025-03-03 23:23:46,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:46" (1/1) ... [2025-03-03 23:23:46,202 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:46" (1/1) ... [2025-03-03 23:23:46,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:46" (1/1) ... [2025-03-03 23:23:46,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:46" (1/1) ... [2025-03-03 23:23:46,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:46" (1/1) ... [2025-03-03 23:23:46,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:23:46,215 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:23:46,215 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:23:46,215 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:23:46,216 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:46" (1/1) ... [2025-03-03 23:23:46,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:23:46,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:23:46,245 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 23:23:46,249 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 23:23:46,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:23:46,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:23:46,267 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:23:46,267 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:23:46,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:23:46,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:23:46,327 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:23:46,329 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:23:47,288 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 23:23:47,288 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:23:47,294 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:23:47,294 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:23:47,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:23:47 BoogieIcfgContainer [2025-03-03 23:23:47,295 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:23:47,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:23:47,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:23:47,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:23:47,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:23:45" (1/3) ... [2025-03-03 23:23:47,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3831cf46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:23:47, skipping insertion in model container [2025-03-03 23:23:47,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:23:46" (2/3) ... [2025-03-03 23:23:47,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3831cf46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:23:47, skipping insertion in model container [2025-03-03 23:23:47,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:23:47" (3/3) ... [2025-03-03 23:23:47,301 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-68.i [2025-03-03 23:23:47,310 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:23:47,312 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-68.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:23:47,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:23:47,350 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;@43558e9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:23:47,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:23:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 23:23:47,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 23:23:47,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:23:47,358 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:23:47,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:23:47,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:23:47,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1808572969, now seen corresponding path program 1 times [2025-03-03 23:23:47,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:23:47,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411644433] [2025-03-03 23:23:47,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:23:47,372 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 23:23:47,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:23:47,374 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 23:23:47,375 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 23:23:47,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 23:23:47,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 23:23:47,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:23:47,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:23:47,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:23:47,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:23:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-03 23:23:47,604 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:23:47,605 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:23:47,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411644433] [2025-03-03 23:23:47,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411644433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:23:47,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:23:47,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:23:47,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984882792] [2025-03-03 23:23:47,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:23:47,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:23:47,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:23:47,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:23:47,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:23:47,623 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 23:23:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:23:47,639 INFO L93 Difference]: Finished difference Result 88 states and 145 transitions. [2025-03-03 23:23:47,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:23:47,640 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2025-03-03 23:23:47,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:23:47,644 INFO L225 Difference]: With dead ends: 88 [2025-03-03 23:23:47,644 INFO L226 Difference]: Without dead ends: 44 [2025-03-03 23:23:47,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:23:47,648 INFO L435 NwaCegarLoop]: 63 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, 63 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 23:23:47,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:23:47,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-03 23:23:47,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-03 23:23:47,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 23:23:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2025-03-03 23:23:47,671 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 91 [2025-03-03 23:23:47,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:23:47,672 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2025-03-03 23:23:47,672 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 23:23:47,672 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2025-03-03 23:23:47,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 23:23:47,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:23:47,674 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:23:47,682 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 23:23:47,875 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 23:23:47,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:23:47,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:23:47,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1920786373, now seen corresponding path program 1 times [2025-03-03 23:23:47,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:23:47,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16398783] [2025-03-03 23:23:47,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:23:47,876 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 23:23:47,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:23:47,878 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 23:23:47,891 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 23:23:47,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 23:23:48,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 23:23:48,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:23:48,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:23:48,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 23:23:48,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:24:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 23:24:00,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:24:00,998 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:24:00,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16398783] [2025-03-03 23:24:00,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16398783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:24:00,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:24:00,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:24:00,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159401143] [2025-03-03 23:24:00,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:24:01,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:24:01,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:24:01,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:24:01,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:24:01,001 INFO L87 Difference]: Start difference. First operand 44 states and 63 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 23:24:29,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:24:29,519 INFO L93 Difference]: Finished difference Result 113 states and 157 transitions. [2025-03-03 23:24:29,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:24:29,534 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2025-03-03 23:24:29,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:24:29,536 INFO L225 Difference]: With dead ends: 113 [2025-03-03 23:24:29,536 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 23:24:29,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:24:29,537 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 77 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:24:29,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 289 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 23.6s Time] [2025-03-03 23:24:29,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 23:24:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2025-03-03 23:24:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 59 states have internal predecessors, (76), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 23:24:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2025-03-03 23:24:29,554 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 91 [2025-03-03 23:24:29,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:24:29,555 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2025-03-03 23:24:29,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 23:24:29,555 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2025-03-03 23:24:29,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 23:24:29,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:24:29,557 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:24:29,567 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 (3)] Ended with exit code 0 [2025-03-03 23:24:29,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:24:29,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:24:29,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:24:29,759 INFO L85 PathProgramCache]: Analyzing trace with hash -612808670, now seen corresponding path program 1 times [2025-03-03 23:24:29,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:24:29,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274563391] [2025-03-03 23:24:29,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:24:29,760 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 23:24:29,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:24:29,762 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:24:29,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 23:24:29,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 23:24:29,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 23:24:29,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:24:29,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:24:29,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 23:24:29,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:24:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-03 23:24:56,396 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:24:56,396 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:24:56,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274563391] [2025-03-03 23:24:56,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274563391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:24:56,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:24:56,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 23:24:56,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321340081] [2025-03-03 23:24:56,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:24:56,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 23:24:56,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:24:56,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 23:24:56,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:24:56,398 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14)