./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:24:54,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:24:55,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:24:55,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:24:55,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:24:55,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:24:55,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:24:55,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:24:55,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:24:55,096 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:24:55,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:24:55,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:24:55,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:24:55,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:24:55,099 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:24:55,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:24:55,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:24:55,100 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:24:55,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:24:55,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:24:55,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:24:55,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:24:55,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:24:55,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:24:55,105 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:24:55,105 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:24:55,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:24:55,105 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:24:55,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:24:55,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:24:55,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:24:55,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:24:55,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:24:55,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:24:55,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:24:55,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:24:55,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:24:55,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:24:55,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:24:55,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:24:55,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:24:55,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:24:55,110 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-10-13 04:24:55,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:24:55,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:24:55,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:24:55,398 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:24:55,398 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:24:55,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-95.i [2024-10-13 04:24:56,937 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:24:57,176 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:24:57,176 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-95.i [2024-10-13 04:24:57,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7340ebf5c/62001d4939de4170aad67b3a51ad2345/FLAGfab0f8c91 [2024-10-13 04:24:57,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7340ebf5c/62001d4939de4170aad67b3a51ad2345 [2024-10-13 04:24:57,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:24:57,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:24:57,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:24:57,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:24:57,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:24:57,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:24:57" (1/1) ... [2024-10-13 04:24:57,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@770c1dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:57, skipping insertion in model container [2024-10-13 04:24:57,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:24:57" (1/1) ... [2024-10-13 04:24:57,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:24:57,410 WARN L248 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-10-13 04:24:57,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:24:57,457 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:24:57,469 WARN L248 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-10-13 04:24:57,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:24:57,508 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:24:57,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:57 WrapperNode [2024-10-13 04:24:57,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:24:57,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:24:57,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:24:57,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:24:57,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:57" (1/1) ... [2024-10-13 04:24:57,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:57" (1/1) ... [2024-10-13 04:24:57,551 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2024-10-13 04:24:57,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:24:57,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:24:57,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:24:57,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:24:57,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:57" (1/1) ... [2024-10-13 04:24:57,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:57" (1/1) ... [2024-10-13 04:24:57,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:57" (1/1) ... [2024-10-13 04:24:57,589 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-10-13 04:24:57,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:57" (1/1) ... [2024-10-13 04:24:57,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:57" (1/1) ... [2024-10-13 04:24:57,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:57" (1/1) ... [2024-10-13 04:24:57,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:57" (1/1) ... [2024-10-13 04:24:57,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:57" (1/1) ... [2024-10-13 04:24:57,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:57" (1/1) ... [2024-10-13 04:24:57,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:24:57,610 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:24:57,610 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:24:57,610 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:24:57,611 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:57" (1/1) ... [2024-10-13 04:24:57,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:24:57,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:24:57,657 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-10-13 04:24:57,660 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-10-13 04:24:57,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:24:57,709 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:24:57,711 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:24:57,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:24:57,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:24:57,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:24:57,792 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:24:57,798 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:24:58,065 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 04:24:58,065 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:24:58,129 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:24:58,130 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:24:58,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:24:58 BoogieIcfgContainer [2024-10-13 04:24:58,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:24:58,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:24:58,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:24:58,140 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:24:58,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:24:57" (1/3) ... [2024-10-13 04:24:58,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f11b0dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:24:58, skipping insertion in model container [2024-10-13 04:24:58,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:57" (2/3) ... [2024-10-13 04:24:58,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f11b0dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:24:58, skipping insertion in model container [2024-10-13 04:24:58,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:24:58" (3/3) ... [2024-10-13 04:24:58,144 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-95.i [2024-10-13 04:24:58,160 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:24:58,161 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:24:58,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:24:58,238 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;@3b370f16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:24:58,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:24:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 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-10-13 04:24:58,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-13 04:24:58,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:24:58,257 INFO L215 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] [2024-10-13 04:24:58,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:24:58,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:24:58,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2125831895, now seen corresponding path program 1 times [2024-10-13 04:24:58,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:24:58,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954898611] [2024-10-13 04:24:58,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:24:58,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:24:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:58,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:24:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:58,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:24:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:58,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:24:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:58,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:24:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:58,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:24:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:58,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 04:24:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:58,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 04:24:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:58,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 04:24:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:58,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 04:24:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:58,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 04:24:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:58,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:24:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:58,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:24:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:58,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 04:24:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 04:24:58,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:24:58,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954898611] [2024-10-13 04:24:58,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954898611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:24:58,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:24:58,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:24:58,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817263980] [2024-10-13 04:24:58,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:24:58,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:24:58,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:24:58,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:24:58,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:24:58,669 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-10-13 04:24:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:24:58,716 INFO L93 Difference]: Finished difference Result 73 states and 125 transitions. [2024-10-13 04:24:58,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:24:58,719 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 79 [2024-10-13 04:24:58,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:24:58,730 INFO L225 Difference]: With dead ends: 73 [2024-10-13 04:24:58,731 INFO L226 Difference]: Without dead ends: 36 [2024-10-13 04:24:58,736 INFO L431 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-10-13 04:24:58,742 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:24:58,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:24:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-13 04:24:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-13 04:24:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-10-13 04:24:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2024-10-13 04:24:58,795 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 79 [2024-10-13 04:24:58,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:24:58,796 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2024-10-13 04:24:58,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-10-13 04:24:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2024-10-13 04:24:58,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-13 04:24:58,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:24:58,800 INFO L215 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] [2024-10-13 04:24:58,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:24:58,800 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:24:58,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:24:58,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1502986897, now seen corresponding path program 1 times [2024-10-13 04:24:58,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:24:58,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437202525] [2024-10-13 04:24:58,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:24:58,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:24:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:24:58,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:24:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:24:59,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:24:59,007 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:24:59,009 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:24:59,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:24:59,015 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 04:24:59,094 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:24:59,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:24:59 BoogieIcfgContainer [2024-10-13 04:24:59,101 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:24:59,101 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:24:59,102 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:24:59,102 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:24:59,102 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:24:58" (3/4) ... [2024-10-13 04:24:59,107 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:24:59,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:24:59,109 INFO L158 Benchmark]: Toolchain (without parser) took 1902.19ms. Allocated memory is still 176.2MB. Free memory was 142.1MB in the beginning and 58.2MB in the end (delta: 83.9MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2024-10-13 04:24:59,110 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:24:59,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.33ms. Allocated memory is still 176.2MB. Free memory was 142.1MB in the beginning and 128.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 04:24:59,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.79ms. Allocated memory is still 176.2MB. Free memory was 128.1MB in the beginning and 126.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:24:59,112 INFO L158 Benchmark]: Boogie Preprocessor took 55.50ms. Allocated memory is still 176.2MB. Free memory was 126.0MB in the beginning and 123.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:24:59,113 INFO L158 Benchmark]: RCFGBuilder took 522.51ms. Allocated memory is still 176.2MB. Free memory was 123.2MB in the beginning and 105.7MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 04:24:59,113 INFO L158 Benchmark]: TraceAbstraction took 966.33ms. Allocated memory is still 176.2MB. Free memory was 105.1MB in the beginning and 58.2MB in the end (delta: 46.8MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-13 04:24:59,116 INFO L158 Benchmark]: Witness Printer took 6.66ms. Allocated memory is still 176.2MB. Free memory is still 58.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:24:59,118 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.17ms. Allocated memory is still 176.2MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.33ms. Allocated memory is still 176.2MB. Free memory was 142.1MB in the beginning and 128.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.79ms. Allocated memory is still 176.2MB. Free memory was 128.1MB in the beginning and 126.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.50ms. Allocated memory is still 176.2MB. Free memory was 126.0MB in the beginning and 123.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 522.51ms. Allocated memory is still 176.2MB. Free memory was 123.2MB in the beginning and 105.7MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 966.33ms. Allocated memory is still 176.2MB. Free memory was 105.1MB in the beginning and 58.2MB in the end (delta: 46.8MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Witness Printer took 6.66ms. Allocated memory is still 176.2MB. Free memory is still 58.2MB. 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; [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)) ; [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, 38 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, 49 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 49 mSDtfsCounter, 3 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=38occurred 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, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 78 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-10-13 04:24:59,156 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/current/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 /storage/repos/ultimate/releaseScripts/default/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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:25:01,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:25:01,508 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:25:01,513 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:25:01,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:25:01,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:25:01,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:25:01,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:25:01,548 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:25:01,552 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:25:01,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:25:01,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:25:01,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:25:01,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:25:01,554 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:25:01,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:25:01,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:25:01,555 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:25:01,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:25:01,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:25:01,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:25:01,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:25:01,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:25:01,561 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:25:01,561 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:25:01,561 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:25:01,563 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:25:01,563 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:25:01,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:25:01,564 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:25:01,564 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:25:01,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:25:01,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:25:01,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:25:01,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:25:01,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:25:01,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:25:01,567 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:25:01,567 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:25:01,568 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:25:01,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:25:01,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:25:01,568 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:25:01,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:25:01,569 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:25:01,569 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-10-13 04:25:01,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:25:01,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:25:01,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:25:01,961 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:25:01,962 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:25:01,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-95.i [2024-10-13 04:25:03,613 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:25:03,887 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:25:03,888 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-95.i [2024-10-13 04:25:03,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/765fe2344/beb96acf7d9b47fc936ee0e46acadc8d/FLAG32aac88a8 [2024-10-13 04:25:04,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/765fe2344/beb96acf7d9b47fc936ee0e46acadc8d [2024-10-13 04:25:04,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:25:04,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:25:04,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:25:04,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:25:04,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:25:04,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:25:04" (1/1) ... [2024-10-13 04:25:04,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ccf3d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:25:04, skipping insertion in model container [2024-10-13 04:25:04,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:25:04" (1/1) ... [2024-10-13 04:25:04,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:25:04,437 WARN L248 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-10-13 04:25:04,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:25:04,529 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:25:04,547 WARN L248 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-10-13 04:25:04,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:25:04,601 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:25:04,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:25:04 WrapperNode [2024-10-13 04:25:04,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:25:04,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:25:04,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:25:04,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:25:04,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:25:04" (1/1) ... [2024-10-13 04:25:04,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:25:04" (1/1) ... [2024-10-13 04:25:04,663 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2024-10-13 04:25:04,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:25:04,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:25:04,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:25:04,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:25:04,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:25:04" (1/1) ... [2024-10-13 04:25:04,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:25:04" (1/1) ... [2024-10-13 04:25:04,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:25:04" (1/1) ... [2024-10-13 04:25:04,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-10-13 04:25:04,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:25:04" (1/1) ... [2024-10-13 04:25:04,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:25:04" (1/1) ... [2024-10-13 04:25:04,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:25:04" (1/1) ... [2024-10-13 04:25:04,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:25:04" (1/1) ... [2024-10-13 04:25:04,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:25:04" (1/1) ... [2024-10-13 04:25:04,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:25:04" (1/1) ... [2024-10-13 04:25:04,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:25:04,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:25:04,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:25:04,732 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:25:04,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:25:04" (1/1) ... [2024-10-13 04:25:04,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:25:04,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:25:04,766 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-10-13 04:25:04,769 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-10-13 04:25:04,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:25:04,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:25:04,811 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:25:04,811 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:25:04,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:25:04,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:25:04,896 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:25:04,899 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:25:18,592 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 04:25:18,593 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:25:18,635 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:25:18,635 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:25:18,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:25:18 BoogieIcfgContainer [2024-10-13 04:25:18,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:25:18,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:25:18,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:25:18,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:25:18,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:25:04" (1/3) ... [2024-10-13 04:25:18,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ba1735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:25:18, skipping insertion in model container [2024-10-13 04:25:18,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:25:04" (2/3) ... [2024-10-13 04:25:18,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ba1735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:25:18, skipping insertion in model container [2024-10-13 04:25:18,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:25:18" (3/3) ... [2024-10-13 04:25:18,646 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-95.i [2024-10-13 04:25:18,663 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:25:18,663 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:25:18,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:25:18,734 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;@23d4af51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:25:18,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:25:18,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 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-10-13 04:25:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-13 04:25:18,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:25:18,752 INFO L215 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] [2024-10-13 04:25:18,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:25:18,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:25:18,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2125831895, now seen corresponding path program 1 times [2024-10-13 04:25:18,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:25:18,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229905808] [2024-10-13 04:25:18,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:25:18,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 [2024-10-13 04:25:18,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:25:18,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) [2024-10-13 04:25:18,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 [2024-10-13 04:25:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:25:19,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:25:19,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:25:19,747 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-13 04:25:19,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:25:19,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:25:19,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229905808] [2024-10-13 04:25:19,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229905808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:25:19,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:25:19,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:25:19,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777517121] [2024-10-13 04:25:19,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:25:19,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:25:19,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:25:19,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:25:19,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:25:19,788 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-13 04:25:24,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:25:24,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:25:24,098 INFO L93 Difference]: Finished difference Result 73 states and 125 transitions. [2024-10-13 04:25:24,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:25:24,212 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (13), 2 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 79 [2024-10-13 04:25:24,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:25:24,218 INFO L225 Difference]: With dead ends: 73 [2024-10-13 04:25:24,218 INFO L226 Difference]: Without dead ends: 36 [2024-10-13 04:25:24,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:25:24,224 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:25:24,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-13 04:25:24,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-13 04:25:24,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-13 04:25:24,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-10-13 04:25:24,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2024-10-13 04:25:24,260 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 79 [2024-10-13 04:25:24,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:25:24,260 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2024-10-13 04:25:24,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-13 04:25:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2024-10-13 04:25:24,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-13 04:25:24,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:25:24,264 INFO L215 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] [2024-10-13 04:25:24,292 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-10-13 04:25:24,464 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-10-13 04:25:24,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:25:24,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:25:24,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1502986897, now seen corresponding path program 1 times [2024-10-13 04:25:24,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:25:24,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311336594] [2024-10-13 04:25:24,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:25:24,467 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-10-13 04:25:24,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:25:24,469 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-10-13 04:25:24,471 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-10-13 04:25:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:25:25,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 04:25:25,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:26:17,261 WARN L286 SmtUtils]: Spent 15.54s 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-10-13 04:26:26,097 WARN L286 SmtUtils]: Spent 8.82s 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)