./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-55.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-55.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 3ad6401ee446a34982dd0c8d0ba268337aa0159c5f8a85e383082a041a6d1435 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:22:05,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:22:05,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:22:05,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:22:05,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:22:05,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:22:05,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:22:05,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:22:05,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:22:05,910 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:22:05,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:22:05,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:22:05,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:22:05,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:22:05,912 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:22:05,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:22:05,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:22:05,912 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:22:05,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:22:05,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:22:05,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:22:05,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:22:05,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:22:05,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:22:05,913 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:22:05,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:22:05,913 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:22:05,913 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:22:05,913 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:22:05,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:22:05,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:22:05,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:22:05,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:22:05,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:22:05,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:22:05,914 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:22:05,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:22:05,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:22:05,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:22:05,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:22:05,914 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:22:05,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:22:05,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:22:05,914 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 -> 3ad6401ee446a34982dd0c8d0ba268337aa0159c5f8a85e383082a041a6d1435 [2025-03-03 23:22:06,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:22:06,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:22:06,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:22:06,137 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:22:06,137 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:22:06,139 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-55.i [2025-03-03 23:22:07,256 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b24fbec0/e66438f1130f4777acd36b28c5ad1297/FLAG030fcbf5f [2025-03-03 23:22:07,512 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:22:07,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-55.i [2025-03-03 23:22:07,520 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b24fbec0/e66438f1130f4777acd36b28c5ad1297/FLAG030fcbf5f [2025-03-03 23:22:07,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b24fbec0/e66438f1130f4777acd36b28c5ad1297 [2025-03-03 23:22:07,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:22:07,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:22:07,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:22:07,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:22:07,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:22:07,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:22:07" (1/1) ... [2025-03-03 23:22:07,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f915dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:07, skipping insertion in model container [2025-03-03 23:22:07,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:22:07" (1/1) ... [2025-03-03 23:22:07,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:22:07,947 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-55.i[915,928] [2025-03-03 23:22:07,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:22:08,000 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:22:08,009 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-55.i[915,928] [2025-03-03 23:22:08,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:22:08,039 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:22:08,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:08 WrapperNode [2025-03-03 23:22:08,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:22:08,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:22:08,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:22:08,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:22:08,048 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:22:08" (1/1) ... [2025-03-03 23:22:08,054 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:22:08" (1/1) ... [2025-03-03 23:22:08,074 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-03-03 23:22:08,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:22:08,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:22:08,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:22:08,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:22:08,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:08" (1/1) ... [2025-03-03 23:22:08,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:08" (1/1) ... [2025-03-03 23:22:08,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:08" (1/1) ... [2025-03-03 23:22:08,090 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:22:08,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:08" (1/1) ... [2025-03-03 23:22:08,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:08" (1/1) ... [2025-03-03 23:22:08,094 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:08" (1/1) ... [2025-03-03 23:22:08,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:08" (1/1) ... [2025-03-03 23:22:08,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:08" (1/1) ... [2025-03-03 23:22:08,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:08" (1/1) ... [2025-03-03 23:22:08,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:22:08,098 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:22:08,098 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:22:08,098 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:22:08,099 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:08" (1/1) ... [2025-03-03 23:22:08,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:22:08,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:22:08,125 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:22:08,126 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:22:08,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:22:08,141 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:22:08,141 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:22:08,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:22:08,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:22:08,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:22:08,183 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:22:08,184 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:22:08,389 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 23:22:08,389 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:22:08,397 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:22:08,397 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:22:08,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:22:08 BoogieIcfgContainer [2025-03-03 23:22:08,397 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:22:08,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:22:08,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:22:08,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:22:08,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:22:07" (1/3) ... [2025-03-03 23:22:08,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3abedfa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:22:08, skipping insertion in model container [2025-03-03 23:22:08,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:08" (2/3) ... [2025-03-03 23:22:08,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3abedfa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:22:08, skipping insertion in model container [2025-03-03 23:22:08,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:22:08" (3/3) ... [2025-03-03 23:22:08,405 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-55.i [2025-03-03 23:22:08,415 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:22:08,416 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-55.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:22:08,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:22:08,474 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;@4a5bf28e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:22:08,476 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:22:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 23:22:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 23:22:08,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:22:08,487 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:08,487 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:22:08,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:22:08,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2021689872, now seen corresponding path program 1 times [2025-03-03 23:22:08,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:22:08,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291296739] [2025-03-03 23:22:08,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:22:08,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:22:08,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 23:22:08,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 23:22:08,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:22:08,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:22:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-03 23:22:08,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:22:08,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291296739] [2025-03-03 23:22:08,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291296739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:22:08,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238992815] [2025-03-03 23:22:08,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:22:08,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:22:08,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:22:08,689 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:22:08,692 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:22:08,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 23:22:08,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 23:22:08,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:22:08,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:22:08,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:22:08,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:22:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-03 23:22:08,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:22:08,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238992815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:22:08,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:22:08,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:22:08,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011122466] [2025-03-03 23:22:08,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:22:08,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:22:08,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:22:08,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:22:08,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:22:08,863 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 23:22:08,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:22:08,876 INFO L93 Difference]: Finished difference Result 94 states and 158 transitions. [2025-03-03 23:22:08,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:22:08,878 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 106 [2025-03-03 23:22:08,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:22:08,882 INFO L225 Difference]: With dead ends: 94 [2025-03-03 23:22:08,882 INFO L226 Difference]: Without dead ends: 47 [2025-03-03 23:22:08,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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:22:08,887 INFO L435 NwaCegarLoop]: 68 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, 68 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:22:08,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:22:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-03 23:22:08,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-03 23:22:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 23:22:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2025-03-03 23:22:08,935 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 106 [2025-03-03 23:22:08,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:22:08,935 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2025-03-03 23:22:08,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 23:22:08,935 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2025-03-03 23:22:08,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 23:22:08,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:22:08,940 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:08,947 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:22:09,144 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:22:09,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:22:09,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:22:09,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1822506735, now seen corresponding path program 1 times [2025-03-03 23:22:09,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:22:09,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330006350] [2025-03-03 23:22:09,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:22:09,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:22:09,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 23:22:09,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 23:22:09,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:22:09,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:22:09,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [474798967] [2025-03-03 23:22:09,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:22:09,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:22:09,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:22:09,235 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:22:09,236 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:22:09,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 23:22:09,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 23:22:09,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:22:09,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:22:09,401 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:22:09,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 23:22:09,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 23:22:09,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:22:09,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:22:09,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:22:09,469 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:22:09,470 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:22:09,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 23:22:09,671 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,SelfDestructingSolverStorable1 [2025-03-03 23:22:09,674 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 23:22:09,720 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:22:09,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:22:09 BoogieIcfgContainer [2025-03-03 23:22:09,722 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:22:09,723 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:22:09,723 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:22:09,723 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:22:09,724 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:22:08" (3/4) ... [2025-03-03 23:22:09,725 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:22:09,726 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:22:09,726 INFO L158 Benchmark]: Toolchain (without parser) took 1899.27ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 77.3MB in the end (delta: 27.2MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2025-03-03 23:22:09,727 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:22:09,727 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.96ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 92.8MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:22:09,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.04ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:22:09,727 INFO L158 Benchmark]: Boogie Preprocessor took 22.20ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 88.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:22:09,727 INFO L158 Benchmark]: IcfgBuilder took 299.52ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 72.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:22:09,728 INFO L158 Benchmark]: TraceAbstraction took 1323.76ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 77.3MB in the end (delta: -4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:22:09,728 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 77.3MB in the end (delta: 54.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:22:09,729 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 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.96ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 92.8MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.04ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.20ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 88.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 299.52ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 72.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1323.76ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 77.3MB in the end (delta: -4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 77.3MB in the end (delta: 54.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryArithmeticFLOAToperation at line 39. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 16; [L26] signed char var_1_7 = 25; [L27] unsigned short int var_1_8 = 5; [L28] unsigned short int var_1_9 = 1; [L29] signed char var_1_12 = 1; [L30] float var_1_13 = 127.75; [L31] float var_1_14 = 0.0; [L32] float var_1_15 = 255.7; [L33] float var_1_16 = 7.6; [L34] unsigned long int var_1_17 = 64; [L35] signed long int var_1_18 = 0; VAL [isInitial=0, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] FCALL updateLastVariables() [L106] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L70] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L70] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L71] var_1_5 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L72] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L73] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L74] var_1_6 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_7=25, var_1_8=5, var_1_9=1] [L75] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_7=25, var_1_8=5, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=5, var_1_9=1] [L76] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=5, var_1_9=1] [L77] var_1_8 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_9=1] [L78] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_8 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_9=1] [L79] RET assume_abort_if_not(var_1_8 <= 65535) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_9=1] [L80] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=1] [L80] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=1] [L81] var_1_9 = __VERIFIER_nondet_ushort() [L82] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1] [L82] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1] [L83] CALL assume_abort_if_not(var_1_9 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1] [L83] RET assume_abort_if_not(var_1_9 <= 65535) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1] [L84] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=-131070] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=-131070] [L84] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=-131070] [L85] var_1_12 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=-131070] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=-131070] [L86] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=-131070] [L87] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=-131070] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=-131070] [L87] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=-131070] [L88] var_1_14 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=-131070] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=-131070] [L89] RET assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=-131070] [L90] var_1_15 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=-131070] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=-131070] [L91] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=-131070] [L92] var_1_16 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=-131070] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=-131070] [L93] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=-131070] [L106] RET updateVariables() [L107] CALL step() [L39] var_1_13 = ((var_1_14 - var_1_15) - var_1_16) [L40] var_1_17 = var_1_6 [L41] var_1_18 = var_1_9 [L42] unsigned short int stepLocal_3 = var_1_9; [L43] unsigned long int stepLocal_2 = var_1_17; VAL [isInitial=1, stepLocal_2=1, stepLocal_3=-131070, var_1_12=-127, var_1_17=1, var_1_18=2, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=25, var_1_8=-1, var_1_9=-131070] [L44] COND FALSE !(stepLocal_2 <= ((var_1_17 / var_1_8) / var_1_9)) [L51] var_1_7 = var_1_12 VAL [isInitial=1, stepLocal_3=-131070, var_1_12=-127, var_1_17=1, var_1_18=2, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=-127, var_1_8=-1, var_1_9=-131070] [L53] signed char stepLocal_1 = var_1_7; [L54] unsigned char stepLocal_0 = var_1_7 >= var_1_7; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-127, stepLocal_3=-131070, var_1_12=-127, var_1_17=1, var_1_18=2, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=-127, var_1_8=-1, var_1_9=-131070] [L55] COND FALSE !(\read(var_1_2)) [L64] var_1_1 = var_1_6 VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-127, stepLocal_3=-131070, var_1_12=-127, var_1_17=1, var_1_18=2, var_1_1=1, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=-127, var_1_8=-1, var_1_9=-131070] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((var_1_2 ? (((var_1_7 >= var_1_7) && var_1_5) ? ((var_1_7 >= var_1_7) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) var_1_6))) : 1) : (var_1_1 == ((unsigned short int) var_1_6))) && ((var_1_17 <= ((var_1_17 / var_1_8) / var_1_9)) ? ((var_1_9 == (var_1_18 * (~ var_1_18))) ? (var_1_7 == ((signed char) var_1_12)) : (var_1_7 == ((signed char) var_1_12))) : (var_1_7 == ((signed char) var_1_12)))) && (var_1_13 == ((float) ((var_1_14 - var_1_15) - var_1_16)))) && (var_1_17 == ((unsigned long int) var_1_6))) && (var_1_18 == ((signed long int) var_1_9)) ; VAL [\result=0, isInitial=1, var_1_12=-127, var_1_17=1, var_1_18=2, var_1_1=1, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=-127, var_1_8=-1, var_1_9=-131070] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=-127, var_1_17=1, var_1_18=2, var_1_1=1, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=-127, var_1_8=-1, var_1_9=-131070] [L19] reach_error() VAL [isInitial=1, var_1_12=-127, var_1_17=1, var_1_18=2, var_1_1=1, var_1_2=0, var_1_5=-255, var_1_6=1, var_1_7=-127, var_1_8=-1, var_1_9=-131070] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 68 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 424 NumberOfCodeBlocks, 424 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 250 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1056/1088 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:22:09,743 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-55.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 3ad6401ee446a34982dd0c8d0ba268337aa0159c5f8a85e383082a041a6d1435 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:22:11,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:22:11,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:22:11,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:22:11,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:22:11,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:22:11,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:22:11,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:22:11,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:22:11,613 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:22:11,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:22:11,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:22:11,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:22:11,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:22:11,614 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:22:11,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:22:11,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:22:11,614 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:22:11,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:22:11,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:22:11,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:22:11,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:22:11,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:22:11,615 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:22:11,615 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:22:11,615 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:22:11,615 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:22:11,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:22:11,615 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:22:11,615 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:22:11,615 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:22:11,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:22:11,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:22:11,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:22:11,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:22:11,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:22:11,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:22:11,616 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:22:11,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:22:11,616 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:22:11,616 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:22:11,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:22:11,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:22:11,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:22:11,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:22:11,616 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 -> 3ad6401ee446a34982dd0c8d0ba268337aa0159c5f8a85e383082a041a6d1435 [2025-03-03 23:22:11,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:22:11,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:22:11,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:22:11,868 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:22:11,869 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:22:11,869 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-55.i [2025-03-03 23:22:13,005 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d05bc0d90/adc002e0bc664bd7ab72a4deed5b9d4a/FLAG55d7f45d5 [2025-03-03 23:22:13,221 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:22:13,222 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-55.i [2025-03-03 23:22:13,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d05bc0d90/adc002e0bc664bd7ab72a4deed5b9d4a/FLAG55d7f45d5 [2025-03-03 23:22:13,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d05bc0d90/adc002e0bc664bd7ab72a4deed5b9d4a [2025-03-03 23:22:13,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:22:13,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:22:13,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:22:13,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:22:13,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:22:13,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4489d974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13, skipping insertion in model container [2025-03-03 23:22:13,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:22:13,711 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-55.i[915,928] [2025-03-03 23:22:13,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:22:13,765 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:22:13,776 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-55.i[915,928] [2025-03-03 23:22:13,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:22:13,812 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:22:13,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13 WrapperNode [2025-03-03 23:22:13,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:22:13,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:22:13,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:22:13,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:22:13,821 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:22:13" (1/1) ... [2025-03-03 23:22:13,830 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:22:13" (1/1) ... [2025-03-03 23:22:13,861 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2025-03-03 23:22:13,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:22:13,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:22:13,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:22:13,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:22:13,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,881 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:22:13,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:22:13,896 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:22:13,896 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:22:13,896 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:22:13,897 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:22:13,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:22:13,920 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:22:13,922 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:22:13,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:22:13,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:22:13,938 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:22:13,938 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:22:13,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:22:13,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:22:13,986 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:22:13,988 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:22:14,665 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 23:22:14,665 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:22:14,672 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:22:14,672 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:22:14,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:22:14 BoogieIcfgContainer [2025-03-03 23:22:14,672 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:22:14,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:22:14,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:22:14,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:22:14,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:22:13" (1/3) ... [2025-03-03 23:22:14,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ef75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:22:14, skipping insertion in model container [2025-03-03 23:22:14,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (2/3) ... [2025-03-03 23:22:14,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ef75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:22:14, skipping insertion in model container [2025-03-03 23:22:14,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:22:14" (3/3) ... [2025-03-03 23:22:14,680 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-55.i [2025-03-03 23:22:14,690 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:22:14,693 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-55.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:22:14,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:22:14,737 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;@7a19e619, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:22:14,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:22:14,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 23:22:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 23:22:14,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:22:14,750 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:14,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:22:14,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:22:14,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2021689872, now seen corresponding path program 1 times [2025-03-03 23:22:14,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:22:14,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148813950] [2025-03-03 23:22:14,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:22:14,773 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:22:14,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:22:14,776 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:22:14,777 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:22:14,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 23:22:14,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 23:22:14,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:22:14,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:22:14,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:22:15,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:22:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-03 23:22:15,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:22:15,032 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:22:15,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148813950] [2025-03-03 23:22:15,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148813950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:22:15,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:22:15,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:22:15,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707875651] [2025-03-03 23:22:15,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:22:15,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:22:15,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:22:15,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:22:15,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:22:15,049 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 23:22:15,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:22:15,063 INFO L93 Difference]: Finished difference Result 94 states and 158 transitions. [2025-03-03 23:22:15,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:22:15,064 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 106 [2025-03-03 23:22:15,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:22:15,068 INFO L225 Difference]: With dead ends: 94 [2025-03-03 23:22:15,068 INFO L226 Difference]: Without dead ends: 47 [2025-03-03 23:22:15,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 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:22:15,071 INFO L435 NwaCegarLoop]: 68 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, 68 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:22:15,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:22:15,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-03 23:22:15,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-03 23:22:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 23:22:15,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2025-03-03 23:22:15,097 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 106 [2025-03-03 23:22:15,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:22:15,097 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2025-03-03 23:22:15,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 23:22:15,097 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2025-03-03 23:22:15,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 23:22:15,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:22:15,100 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:15,108 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:22:15,300 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:22:15,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:22:15,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:22:15,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1822506735, now seen corresponding path program 1 times [2025-03-03 23:22:15,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:22:15,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781779261] [2025-03-03 23:22:15,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:22:15,302 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:22:15,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:22:15,304 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:22:15,305 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:22:15,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 23:22:15,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 23:22:15,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:22:15,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:22:15,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 23:22:15,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:22:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 23:22:52,245 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:22:52,245 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:22:52,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781779261] [2025-03-03 23:22:52,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781779261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:22:52,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:22:52,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 23:22:52,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382157635] [2025-03-03 23:22:52,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:22:52,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 23:22:52,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:22:52,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 23:22:52,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-03-03 23:22:52,248 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 states have internal predecessors, (33), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 23:22:54,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:23:33,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:23:33,063 INFO L93 Difference]: Finished difference Result 99 states and 130 transitions. [2025-03-03 23:23:33,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 23:23:33,063 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 states have internal predecessors, (33), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 106 [2025-03-03 23:23:33,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:23:33,065 INFO L225 Difference]: With dead ends: 99 [2025-03-03 23:23:33,065 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 23:23:33,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2025-03-03 23:23:33,066 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 114 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2025-03-03 23:23:33,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 333 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 14.9s Time] [2025-03-03 23:23:33,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 23:23:33,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2025-03-03 23:23:33,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 50 states have (on average 1.12) internal successors, (56), 51 states have internal predecessors, (56), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 23:23:33,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 118 transitions. [2025-03-03 23:23:33,085 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 118 transitions. Word has length 106 [2025-03-03 23:23:33,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:23:33,085 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 118 transitions. [2025-03-03 23:23:33,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 states have internal predecessors, (33), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 23:23:33,085 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2025-03-03 23:23:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 23:23:33,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:23:33,086 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,096 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:23:33,287 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:23:33,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:23:33,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:23:33,288 INFO L85 PathProgramCache]: Analyzing trace with hash -630749161, now seen corresponding path program 1 times [2025-03-03 23:23:33,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:23:33,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939501896] [2025-03-03 23:23:33,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:23:33,288 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:33,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:23:33,292 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:23:33,292 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:23:33,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 23:23:33,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 23:23:33,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:23:33,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:23:33,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 23:23:33,500 INFO L279 TraceCheckSpWp]: Computing forward predicates...