./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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-95.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 53f30ab10a4288d06e689397b8d255251f9aba86c268e0c63f767760f0335ff0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:37:09,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:37:09,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:37:09,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:37:09,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:37:09,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:37:09,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:37:09,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:37:09,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:37:09,300 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:37:09,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:37:09,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:37:09,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:37:09,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:37:09,303 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:37:09,303 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:37:09,303 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:37:09,304 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:37:09,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:37:09,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:37:09,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:37:09,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:37:09,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:37:09,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:37:09,307 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:37:09,307 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:37:09,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:37:09,308 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:37:09,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:37:09,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:37:09,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:37:09,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:37:09,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:37:09,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:37:09,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:37:09,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:37:09,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:37:09,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:37:09,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:37:09,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:37:09,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:37:09,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:37:09,314 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 53f30ab10a4288d06e689397b8d255251f9aba86c268e0c63f767760f0335ff0 [2024-11-12 05:37:09,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:37:09,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:37:09,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:37:09,653 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:37:09,654 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:37:09,655 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-95.i [2024-11-12 05:37:11,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:37:11,287 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:37:11,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-95.i [2024-11-12 05:37:11,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3211c6d7b/34b0b8184d8d4d2dac3c331dcb21d17d/FLAGfc8d14275 [2024-11-12 05:37:11,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3211c6d7b/34b0b8184d8d4d2dac3c331dcb21d17d [2024-11-12 05:37:11,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:37:11,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:37:11,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:37:11,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:37:11,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:37:11,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:37:11" (1/1) ... [2024-11-12 05:37:11,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@692fa149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:11, skipping insertion in model container [2024-11-12 05:37:11,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:37:11" (1/1) ... [2024-11-12 05:37:11,347 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:37:11,519 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-95.i[915,928] [2024-11-12 05:37:11,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:37:11,568 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:37:11,578 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-95.i[915,928] [2024-11-12 05:37:11,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:37:11,628 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:37:11,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:11 WrapperNode [2024-11-12 05:37:11,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:37:11,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:37:11,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:37:11,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:37:11,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:11" (1/1) ... [2024-11-12 05:37:11,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:11" (1/1) ... [2024-11-12 05:37:11,670 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2024-11-12 05:37:11,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:37:11,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:37:11,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:37:11,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:37:11,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:11" (1/1) ... [2024-11-12 05:37:11,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:11" (1/1) ... [2024-11-12 05:37:11,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:11" (1/1) ... [2024-11-12 05:37:11,698 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]. [2024-11-12 05:37:11,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:11" (1/1) ... [2024-11-12 05:37:11,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:11" (1/1) ... [2024-11-12 05:37:11,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:11" (1/1) ... [2024-11-12 05:37:11,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:11" (1/1) ... [2024-11-12 05:37:11,714 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:11" (1/1) ... [2024-11-12 05:37:11,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:11" (1/1) ... [2024-11-12 05:37:11,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:37:11,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:37:11,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:37:11,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:37:11,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:11" (1/1) ... [2024-11-12 05:37:11,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:37:11,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:37:11,763 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) [2024-11-12 05:37:11,767 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 [2024-11-12 05:37:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:37:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:37:11,816 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:37:11,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:37:11,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:37:11,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:37:11,900 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:37:11,905 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:37:12,216 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 05:37:12,216 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:37:12,234 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:37:12,234 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:37:12,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:37:12 BoogieIcfgContainer [2024-11-12 05:37:12,235 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:37:12,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:37:12,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:37:12,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:37:12,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:37:11" (1/3) ... [2024-11-12 05:37:12,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5535af89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:37:12, skipping insertion in model container [2024-11-12 05:37:12,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:11" (2/3) ... [2024-11-12 05:37:12,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5535af89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:37:12, skipping insertion in model container [2024-11-12 05:37:12,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:37:12" (3/3) ... [2024-11-12 05:37:12,245 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-95.i [2024-11-12 05:37:12,261 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:37:12,261 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:37:12,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:37:12,341 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;@48eb341c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:37:12,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:37:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 05:37:12,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-12 05:37:12,359 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:37:12,360 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:37:12,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:37:12,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:37:12,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1667905273, now seen corresponding path program 1 times [2024-11-12 05:37:12,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:37:12,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160136890] [2024-11-12 05:37:12,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:37:12,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:37:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:12,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:37:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:12,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:37:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:12,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:37:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:12,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:37:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:12,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:37:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:12,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:37:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:12,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:37:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:12,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 05:37:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:12,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 05:37:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:12,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 05:37:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:12,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:37:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:12,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 05:37:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:12,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:37:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 05:37:12,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:37:12,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160136890] [2024-11-12 05:37:12,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160136890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:37:12,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:37:12,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:37:12,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549175116] [2024-11-12 05:37:12,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:37:12,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:37:12,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:37:12,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:37:12,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:37:12,786 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 05:37:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:37:12,813 INFO L93 Difference]: Finished difference Result 81 states and 133 transitions. [2024-11-12 05:37:12,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:37:12,815 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 83 [2024-11-12 05:37:12,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:37:12,823 INFO L225 Difference]: With dead ends: 81 [2024-11-12 05:37:12,824 INFO L226 Difference]: Without dead ends: 40 [2024-11-12 05:37:12,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:37:12,832 INFO L435 NwaCegarLoop]: 56 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, 56 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 [2024-11-12 05:37:12,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:37:12,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-12 05:37:12,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-12 05:37:12,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 05:37:12,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2024-11-12 05:37:12,874 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 83 [2024-11-12 05:37:12,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:37:12,874 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2024-11-12 05:37:12,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 05:37:12,875 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2024-11-12 05:37:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-12 05:37:12,879 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:37:12,879 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:37:12,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:37:12,880 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:37:12,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:37:12,881 INFO L85 PathProgramCache]: Analyzing trace with hash -498736269, now seen corresponding path program 1 times [2024-11-12 05:37:12,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:37:12,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848364086] [2024-11-12 05:37:12,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:37:12,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:37:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:37:12,992 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:37:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:37:13,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:37:13,090 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:37:13,093 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:37:13,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:37:13,099 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 05:37:13,177 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:37:13,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:37:13 BoogieIcfgContainer [2024-11-12 05:37:13,185 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:37:13,185 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:37:13,185 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:37:13,186 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:37:13,186 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:37:12" (3/4) ... [2024-11-12 05:37:13,189 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:37:13,190 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:37:13,191 INFO L158 Benchmark]: Toolchain (without parser) took 1876.46ms. Allocated memory is still 138.4MB. Free memory was 100.8MB in the beginning and 54.1MB in the end (delta: 46.7MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2024-11-12 05:37:13,191 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 138.4MB. Free memory is still 109.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:37:13,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.80ms. Allocated memory is still 138.4MB. Free memory was 100.4MB in the beginning and 86.5MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 05:37:13,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.42ms. Allocated memory is still 138.4MB. Free memory was 86.5MB in the beginning and 84.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:37:13,194 INFO L158 Benchmark]: Boogie Preprocessor took 51.13ms. Allocated memory is still 138.4MB. Free memory was 84.0MB in the beginning and 81.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 05:37:13,194 INFO L158 Benchmark]: RCFGBuilder took 511.36ms. Allocated memory is still 138.4MB. Free memory was 81.0MB in the beginning and 102.4MB in the end (delta: -21.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 05:37:13,196 INFO L158 Benchmark]: TraceAbstraction took 948.19ms. Allocated memory is still 138.4MB. Free memory was 101.7MB in the beginning and 54.8MB in the end (delta: 46.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-12 05:37:13,197 INFO L158 Benchmark]: Witness Printer took 4.62ms. Allocated memory is still 138.4MB. Free memory was 54.8MB in the beginning and 54.1MB in the end (delta: 672.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:37:13,201 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 138.4MB. Free memory is still 109.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.80ms. Allocated memory is still 138.4MB. Free memory was 100.4MB in the beginning and 86.5MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.42ms. Allocated memory is still 138.4MB. Free memory was 86.5MB in the beginning and 84.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.13ms. Allocated memory is still 138.4MB. Free memory was 84.0MB in the beginning and 81.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 511.36ms. Allocated memory is still 138.4MB. Free memory was 81.0MB in the beginning and 102.4MB in the end (delta: -21.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 948.19ms. Allocated memory is still 138.4MB. Free memory was 101.7MB in the beginning and 54.8MB in the end (delta: 46.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Witness Printer took 4.62ms. Allocated memory is still 138.4MB. Free memory was 54.8MB in the beginning and 54.1MB in the end (delta: 672.3kB). 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 85, overapproximation of someUnaryDOUBLEoperation at line 24, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] float var_1_3 = 1.8; [L24] double var_1_5 = -0.75; [L25] double var_1_6 = 128.2; [L26] float var_1_8 = 127.4; [L27] float var_1_9 = 99999999.4; [L28] float var_1_10 = 2.8; [L29] double var_1_11 = 7.875; [L30] unsigned char var_1_12 = 128; [L31] unsigned char var_1_13 = 1; [L32] unsigned char var_1_14 = 25; [L33] unsigned char var_1_15 = 64; [L34] signed short int var_1_16 = 16; VAL [isInitial=0, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L89] isInitial = 1 [L90] FCALL initially() [L91] COND TRUE 1 [L92] FCALL updateLastVariables() [L93] CALL updateVariables() [L60] var_1_5 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L61] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L62] CALL assume_abort_if_not(var_1_5 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L62] RET assume_abort_if_not(var_1_5 != 0.0F) VAL [isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L63] var_1_6 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_8=637/5, var_1_9=499999997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_8=637/5, var_1_9=499999997/5] [L64] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_8=637/5, var_1_9=499999997/5] [L65] CALL assume_abort_if_not(var_1_6 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_8=637/5, var_1_9=499999997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_8=637/5, var_1_9=499999997/5] [L65] RET assume_abort_if_not(var_1_6 != 0.0F) VAL [isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_8=637/5, var_1_9=499999997/5] [L66] var_1_8 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_9=499999997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_9=499999997/5] [L67] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_9=499999997/5] [L68] var_1_9 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L69] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L70] var_1_10 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L71] RET assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L72] var_1_13 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L73] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L74] CALL assume_abort_if_not(var_1_13 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L74] RET assume_abort_if_not(var_1_13 <= 64) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L75] var_1_14 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L76] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L77] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=0, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=0, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L77] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=0, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L78] var_1_15 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=0, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=0, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L79] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=0, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L80] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=0, var_1_15=127, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=0, var_1_15=127, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L80] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=0, var_1_15=127, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L93] RET updateVariables() [L94] CALL step() [L38] var_1_11 = (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) - var_1_8) [L39] var_1_12 = ((var_1_13 + var_1_14) + var_1_15) [L40] var_1_16 = var_1_13 [L41] var_1_1 = ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))) [L42] unsigned char stepLocal_2 = var_1_12; [L43] signed long int stepLocal_1 = -128; [L44] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, stepLocal_0=191, stepLocal_1=-128, stepLocal_2=191, var_1_12=191, var_1_13=64, var_1_14=0, var_1_15=127, var_1_16=64, var_1_1=191, var_1_3=9/5] [L45] COND FALSE !((var_1_11 / ((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) <= var_1_11) VAL [isInitial=1, stepLocal_0=191, stepLocal_1=-128, stepLocal_2=191, var_1_12=191, var_1_13=64, var_1_14=0, var_1_15=127, var_1_16=64, var_1_1=191, var_1_3=9/5] [L94] RET step() [L95] CALL, EXPR property() [L85-L86] return ((((var_1_1 == ((signed long int) ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))))) && (((var_1_11 / ((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) <= var_1_11) ? ((var_1_12 == var_1_16) ? ((var_1_12 >= var_1_16) ? (var_1_3 == ((float) ((9.3f - var_1_8) + (var_1_9 + var_1_10)))) : 1) : ((var_1_12 < -128) ? (var_1_3 == ((float) var_1_8)) : (var_1_3 == ((float) var_1_10)))) : 1)) && (var_1_11 == ((double) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) - var_1_8)))) && (var_1_12 == ((unsigned char) ((var_1_13 + var_1_14) + var_1_15)))) && (var_1_16 == ((signed short int) var_1_13)) ; VAL [\result=0, isInitial=1, var_1_12=191, var_1_13=64, var_1_14=0, var_1_15=127, var_1_16=64, var_1_1=191, var_1_3=9/5] [L95] RET, EXPR property() [L95] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=191, var_1_13=64, var_1_14=0, var_1_15=127, var_1_16=64, var_1_1=191, var_1_3=9/5] [L19] reach_error() VAL [isInitial=1, var_1_12=191, var_1_13=64, var_1_14=0, var_1_15=127, var_1_16=64, var_1_1=191, var_1_3=9/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 56 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, 56 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 82 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 312/312 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 05:37:13,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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-95.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 53f30ab10a4288d06e689397b8d255251f9aba86c268e0c63f767760f0335ff0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:37:15,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:37:15,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:37:15,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:37:15,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:37:15,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:37:15,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:37:15,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:37:15,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:37:15,638 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:37:15,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:37:15,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:37:15,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:37:15,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:37:15,641 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:37:15,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:37:15,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:37:15,642 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:37:15,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:37:15,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:37:15,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:37:15,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:37:15,646 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:37:15,646 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:37:15,646 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:37:15,647 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:37:15,647 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:37:15,647 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:37:15,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:37:15,648 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:37:15,648 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:37:15,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:37:15,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:37:15,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:37:15,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:37:15,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:37:15,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:37:15,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:37:15,654 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:37:15,654 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:37:15,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:37:15,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:37:15,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:37:15,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:37:15,656 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 53f30ab10a4288d06e689397b8d255251f9aba86c268e0c63f767760f0335ff0 [2024-11-12 05:37:15,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:37:15,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:37:15,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:37:15,990 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:37:15,990 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:37:15,992 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-95.i [2024-11-12 05:37:17,623 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:37:17,848 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:37:17,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-95.i [2024-11-12 05:37:17,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a5f760c/06c1ca91c2984d2f901eee51124a957f/FLAGaccd3558c [2024-11-12 05:37:18,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a5f760c/06c1ca91c2984d2f901eee51124a957f [2024-11-12 05:37:18,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:37:18,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:37:18,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:37:18,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:37:18,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:37:18,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:37:18" (1/1) ... [2024-11-12 05:37:18,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22a7a0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:18, skipping insertion in model container [2024-11-12 05:37:18,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:37:18" (1/1) ... [2024-11-12 05:37:18,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:37:18,442 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-95.i[915,928] [2024-11-12 05:37:18,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:37:18,512 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:37:18,527 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-95.i[915,928] [2024-11-12 05:37:18,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:37:18,578 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:37:18,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:18 WrapperNode [2024-11-12 05:37:18,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:37:18,580 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:37:18,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:37:18,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:37:18,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:18" (1/1) ... [2024-11-12 05:37:18,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:18" (1/1) ... [2024-11-12 05:37:18,635 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2024-11-12 05:37:18,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:37:18,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:37:18,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:37:18,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:37:18,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:18" (1/1) ... [2024-11-12 05:37:18,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:18" (1/1) ... [2024-11-12 05:37:18,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:18" (1/1) ... [2024-11-12 05:37:18,668 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]. [2024-11-12 05:37:18,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:18" (1/1) ... [2024-11-12 05:37:18,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:18" (1/1) ... [2024-11-12 05:37:18,681 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:18" (1/1) ... [2024-11-12 05:37:18,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:18" (1/1) ... [2024-11-12 05:37:18,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:18" (1/1) ... [2024-11-12 05:37:18,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:18" (1/1) ... [2024-11-12 05:37:18,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:37:18,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:37:18,701 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:37:18,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:37:18,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:18" (1/1) ... [2024-11-12 05:37:18,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:37:18,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:37:18,736 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) [2024-11-12 05:37:18,739 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 [2024-11-12 05:37:18,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:37:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:37:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:37:18,784 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:37:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:37:18,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:37:18,875 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:37:18,879 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:37:31,941 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 05:37:31,941 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:37:31,954 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:37:31,956 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:37:31,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:37:31 BoogieIcfgContainer [2024-11-12 05:37:31,956 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:37:31,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:37:31,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:37:31,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:37:31,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:37:18" (1/3) ... [2024-11-12 05:37:31,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@feb336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:37:31, skipping insertion in model container [2024-11-12 05:37:31,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:18" (2/3) ... [2024-11-12 05:37:31,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@feb336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:37:31, skipping insertion in model container [2024-11-12 05:37:31,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:37:31" (3/3) ... [2024-11-12 05:37:31,968 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-95.i [2024-11-12 05:37:31,985 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:37:31,985 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:37:32,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:37:32,055 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;@53cdb133, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:37:32,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:37:32,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 05:37:32,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-12 05:37:32,067 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:37:32,068 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:37:32,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:37:32,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:37:32,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1667905273, now seen corresponding path program 1 times [2024-11-12 05:37:32,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:37:32,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539177574] [2024-11-12 05:37:32,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:37:32,087 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 [2024-11-12 05:37:32,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:37:32,091 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) [2024-11-12 05:37:32,092 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 [2024-11-12 05:37:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:32,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:37:32,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:37:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-12 05:37:33,040 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:37:33,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:37:33,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539177574] [2024-11-12 05:37:33,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539177574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:37:33,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:37:33,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:37:33,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191676787] [2024-11-12 05:37:33,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:37:33,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:37:33,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:37:33,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:37:33,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:37:33,078 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 05:37:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:37:33,103 INFO L93 Difference]: Finished difference Result 81 states and 133 transitions. [2024-11-12 05:37:33,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:37:33,105 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 83 [2024-11-12 05:37:33,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:37:33,114 INFO L225 Difference]: With dead ends: 81 [2024-11-12 05:37:33,114 INFO L226 Difference]: Without dead ends: 40 [2024-11-12 05:37:33,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:37:33,121 INFO L435 NwaCegarLoop]: 56 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, 56 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 [2024-11-12 05:37:33,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:37:33,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-12 05:37:33,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-12 05:37:33,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 05:37:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2024-11-12 05:37:33,154 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 83 [2024-11-12 05:37:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:37:33,155 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2024-11-12 05:37:33,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 05:37:33,155 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2024-11-12 05:37:33,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-12 05:37:33,158 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:37:33,158 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:37:33,182 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 [2024-11-12 05:37:33,359 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 [2024-11-12 05:37:33,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:37:33,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:37:33,361 INFO L85 PathProgramCache]: Analyzing trace with hash -498736269, now seen corresponding path program 1 times [2024-11-12 05:37:33,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:37:33,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685846517] [2024-11-12 05:37:33,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:37:33,362 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 [2024-11-12 05:37:33,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:37:33,364 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) [2024-11-12 05:37:33,365 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 [2024-11-12 05:37:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:34,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 05:37:34,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:38:16,866 WARN L286 SmtUtils]: Spent 11.18s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-12 05:38:25,682 WARN L286 SmtUtils]: Spent 8.80s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 05:38:34,280 WARN L286 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 05:38:42,833 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)