./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.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_operatoramount_amount10_file-53.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 8031214ed9c619943b4a735ea98fb6c6f1f9f3536470f440c97b936292613cf6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:13:14,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:13:14,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:13:14,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:13:14,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:13:14,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:13:14,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:13:14,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:13:14,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:13:14,355 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:13:14,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:13:14,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:13:14,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:13:14,356 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:13:14,358 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:13:14,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:13:14,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:13:14,359 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:13:14,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:13:14,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:13:14,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:13:14,363 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:13:14,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:13:14,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:13:14,364 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:13:14,364 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:13:14,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:13:14,365 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:13:14,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:13:14,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:13:14,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:13:14,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:13:14,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:13:14,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:13:14,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:13:14,368 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:13:14,368 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:13:14,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:13:14,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:13:14,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:13:14,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:13:14,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:13:14,369 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 -> 8031214ed9c619943b4a735ea98fb6c6f1f9f3536470f440c97b936292613cf6 [2024-11-12 06:13:14,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:13:14,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:13:14,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:13:14,686 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:13:14,687 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:13:14,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.i [2024-11-12 06:13:16,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:13:16,409 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:13:16,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.i [2024-11-12 06:13:16,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d5f29090/d2ea7ef5f19445c9b6794af09a2275fa/FLAG3ebf40dd7 [2024-11-12 06:13:16,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d5f29090/d2ea7ef5f19445c9b6794af09a2275fa [2024-11-12 06:13:16,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:13:16,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:13:16,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:13:16,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:13:16,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:13:16,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:13:16" (1/1) ... [2024-11-12 06:13:16,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b1835cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:16, skipping insertion in model container [2024-11-12 06:13:16,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:13:16" (1/1) ... [2024-11-12 06:13:16,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:13:17,013 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_operatoramount_amount10_file-53.i[915,928] [2024-11-12 06:13:17,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:13:17,053 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:13:17,065 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_operatoramount_amount10_file-53.i[915,928] [2024-11-12 06:13:17,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:13:17,133 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:13:17,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:17 WrapperNode [2024-11-12 06:13:17,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:13:17,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:13:17,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:13:17,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:13:17,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:17" (1/1) ... [2024-11-12 06:13:17,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:17" (1/1) ... [2024-11-12 06:13:17,198 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 80 [2024-11-12 06:13:17,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:13:17,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:13:17,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:13:17,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:13:17,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:17" (1/1) ... [2024-11-12 06:13:17,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:17" (1/1) ... [2024-11-12 06:13:17,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:17" (1/1) ... [2024-11-12 06:13:17,224 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 06:13:17,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:17" (1/1) ... [2024-11-12 06:13:17,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:17" (1/1) ... [2024-11-12 06:13:17,234 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:17" (1/1) ... [2024-11-12 06:13:17,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:17" (1/1) ... [2024-11-12 06:13:17,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:17" (1/1) ... [2024-11-12 06:13:17,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:17" (1/1) ... [2024-11-12 06:13:17,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:13:17,250 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:13:17,250 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:13:17,250 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:13:17,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:17" (1/1) ... [2024-11-12 06:13:17,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:13:17,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:13:17,298 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 06:13:17,301 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 06:13:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:13:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:13:17,348 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:13:17,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:13:17,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:13:17,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:13:17,413 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:13:17,420 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:13:17,624 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 06:13:17,628 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:13:17,642 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:13:17,642 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:13:17,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:17 BoogieIcfgContainer [2024-11-12 06:13:17,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:13:17,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:13:17,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:13:17,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:13:17,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:13:16" (1/3) ... [2024-11-12 06:13:17,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46383833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:13:17, skipping insertion in model container [2024-11-12 06:13:17,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:17" (2/3) ... [2024-11-12 06:13:17,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46383833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:13:17, skipping insertion in model container [2024-11-12 06:13:17,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:17" (3/3) ... [2024-11-12 06:13:17,655 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-53.i [2024-11-12 06:13:17,672 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:13:17,673 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:13:17,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:13:17,753 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;@2b0bc0e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:13:17,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:13:17,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 06:13:17,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 06:13:17,770 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:17,771 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:13:17,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:17,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:17,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2129135455, now seen corresponding path program 1 times [2024-11-12 06:13:17,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:13:17,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895268990] [2024-11-12 06:13:17,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:17,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:13:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:17,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:13:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:18,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 06:13:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:18,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:13:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:18,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 06:13:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:18,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:13:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:18,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:13:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:18,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:13:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:18,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 06:13:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:18,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:13:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:18,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 06:13:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:18,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:13:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 06:13:18,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:13:18,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895268990] [2024-11-12 06:13:18,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895268990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:18,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:18,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:13:18,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107684045] [2024-11-12 06:13:18,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:18,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:13:18,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:13:18,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:13:18,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:13:18,173 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 06:13:18,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:18,199 INFO L93 Difference]: Finished difference Result 71 states and 113 transitions. [2024-11-12 06:13:18,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:13:18,202 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 72 [2024-11-12 06:13:18,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:18,210 INFO L225 Difference]: With dead ends: 71 [2024-11-12 06:13:18,211 INFO L226 Difference]: Without dead ends: 35 [2024-11-12 06:13:18,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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 06:13:18,222 INFO L435 NwaCegarLoop]: 47 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, 47 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 06:13:18,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:13:18,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-12 06:13:18,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-12 06:13:18,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 06:13:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2024-11-12 06:13:18,275 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 72 [2024-11-12 06:13:18,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:18,276 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2024-11-12 06:13:18,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 06:13:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2024-11-12 06:13:18,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 06:13:18,279 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:18,280 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:13:18,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:13:18,281 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:18,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:18,282 INFO L85 PathProgramCache]: Analyzing trace with hash -983855065, now seen corresponding path program 1 times [2024-11-12 06:13:18,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:13:18,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107065224] [2024-11-12 06:13:18,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:18,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:13:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:13:18,388 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:13:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:13:18,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:13:18,470 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:13:18,472 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:13:18,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:13:18,477 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 06:13:18,530 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:13:18,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:13:18 BoogieIcfgContainer [2024-11-12 06:13:18,534 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:13:18,535 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:13:18,539 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:13:18,540 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:13:18,540 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:17" (3/4) ... [2024-11-12 06:13:18,543 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:13:18,546 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:13:18,547 INFO L158 Benchmark]: Toolchain (without parser) took 1750.54ms. Allocated memory is still 169.9MB. Free memory was 114.1MB in the beginning and 84.8MB in the end (delta: 29.3MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-11-12 06:13:18,548 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:13:18,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.28ms. Allocated memory is still 169.9MB. Free memory was 114.1MB in the beginning and 143.2MB in the end (delta: -29.1MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-11-12 06:13:18,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.45ms. Allocated memory is still 169.9MB. Free memory was 143.2MB in the beginning and 141.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:13:18,550 INFO L158 Benchmark]: Boogie Preprocessor took 49.73ms. Allocated memory is still 169.9MB. Free memory was 141.3MB in the beginning and 139.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:13:18,550 INFO L158 Benchmark]: RCFGBuilder took 393.07ms. Allocated memory is still 169.9MB. Free memory was 139.3MB in the beginning and 126.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 06:13:18,550 INFO L158 Benchmark]: TraceAbstraction took 887.34ms. Allocated memory is still 169.9MB. Free memory was 126.4MB in the beginning and 84.8MB in the end (delta: 41.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-12 06:13:18,551 INFO L158 Benchmark]: Witness Printer took 10.78ms. Allocated memory is still 169.9MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:13:18,557 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 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.28ms. Allocated memory is still 169.9MB. Free memory was 114.1MB in the beginning and 143.2MB in the end (delta: -29.1MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.45ms. Allocated memory is still 169.9MB. Free memory was 143.2MB in the beginning and 141.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.73ms. Allocated memory is still 169.9MB. Free memory was 141.3MB in the beginning and 139.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 393.07ms. Allocated memory is still 169.9MB. Free memory was 139.3MB in the beginning and 126.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 887.34ms. Allocated memory is still 169.9MB. Free memory was 126.4MB in the beginning and 84.8MB in the end (delta: 41.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 10.78ms. Allocated memory is still 169.9MB. Free memory is still 84.8MB. 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 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 8; [L23] float var_1_2 = 1.25; [L24] float var_1_3 = 1.375; [L25] float var_1_4 = 1.6; [L26] float var_1_5 = 256.25; [L27] float var_1_6 = 1.9; [L28] signed long int var_1_7 = -32; [L29] signed long int var_1_8 = -10000000; VAL [isInitial=0, var_1_1=8, var_1_2=5/4, var_1_3=11/8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L68] isInitial = 1 [L69] FCALL initially() [L70] COND TRUE 1 [L71] FCALL updateLastVariables() [L72] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_float() [L43] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_3=11/8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_3=11/8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L43] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=8, var_1_3=11/8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L44] var_1_3 = __VERIFIER_nondet_float() [L45] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L45] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L46] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L46] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, var_1_1=8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L47] var_1_4 = __VERIFIER_nondet_float() [L48] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L48] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=8, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L49] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L49] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, var_1_1=8, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L50] var_1_5 = __VERIFIER_nondet_float() [L51] 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_1=8, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L51] 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_1=8, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L52] var_1_6 = __VERIFIER_nondet_float() [L53] 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_1=8, var_1_7=-32, var_1_8=-10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_7=-32, var_1_8=-10000000] [L53] 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_1=8, var_1_7=-32, var_1_8=-10000000] [L54] var_1_7 = __VERIFIER_nondet_long() [L55] CALL assume_abort_if_not(var_1_7 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_7=-1073741823, var_1_8=-10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_7=-1073741823, var_1_8=-10000000] [L55] RET assume_abort_if_not(var_1_7 >= -1073741823) VAL [isInitial=1, var_1_1=8, var_1_7=-1073741823, var_1_8=-10000000] [L56] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_7=-1073741823, var_1_8=-10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_7=-1073741823, var_1_8=-10000000] [L56] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_1=8, var_1_7=-1073741823, var_1_8=-10000000] [L57] var_1_8 = __VERIFIER_nondet_long() [L58] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_7=-1073741823, var_1_8=-1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_7=-1073741823, var_1_8=-1073741823] [L58] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, var_1_1=8, var_1_7=-1073741823, var_1_8=-1073741823] [L59] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_7=-1073741823, var_1_8=-1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_7=-1073741823, var_1_8=-1073741823] [L59] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, var_1_1=8, var_1_7=-1073741823, var_1_8=-1073741823] [L72] RET updateVariables() [L73] CALL step() [L33] COND FALSE !((var_1_2 / ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_5 * var_1_6)) VAL [isInitial=1, var_1_1=8, var_1_7=-1073741823, var_1_8=-1073741823] [L73] RET step() [L74] CALL, EXPR property() [L64-L65] return ((var_1_2 / ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_5 * var_1_6)) ? ((var_1_3 == var_1_6) ? (var_1_1 == ((signed long int) (var_1_7 + var_1_8))) : (var_1_1 == ((signed long int) var_1_8))) : 1 ; VAL [\result=0, isInitial=1, var_1_1=8, var_1_7=-1073741823, var_1_8=-1073741823] [L74] RET, EXPR property() [L74] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=8, var_1_7=-1073741823, var_1_8=-1073741823] [L19] reach_error() VAL [isInitial=1, var_1_1=8, var_1_7=-1073741823, var_1_8=-1073741823] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 11, 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, 47 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, 47 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred 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, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 71 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 220/220 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 06:13:18,605 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_operatoramount_amount10_file-53.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 8031214ed9c619943b4a735ea98fb6c6f1f9f3536470f440c97b936292613cf6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:13:20,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:13:21,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:13:21,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:13:21,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:13:21,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:13:21,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:13:21,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:13:21,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:13:21,113 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:13:21,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:13:21,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:13:21,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:13:21,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:13:21,119 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:13:21,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:13:21,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:13:21,120 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:13:21,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:13:21,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:13:21,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:13:21,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:13:21,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:13:21,124 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:13:21,124 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:13:21,125 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:13:21,125 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:13:21,125 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:13:21,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:13:21,126 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:13:21,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:13:21,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:13:21,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:13:21,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:13:21,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:13:21,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:13:21,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:13:21,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:13:21,132 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:13:21,133 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:13:21,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:13:21,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:13:21,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:13:21,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:13:21,134 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 -> 8031214ed9c619943b4a735ea98fb6c6f1f9f3536470f440c97b936292613cf6 [2024-11-12 06:13:21,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:13:21,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:13:21,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:13:21,516 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:13:21,516 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:13:21,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.i [2024-11-12 06:13:23,066 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:13:23,325 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:13:23,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.i [2024-11-12 06:13:23,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1cbadb3f/2bd4fece30c84398a42b5704f112fd7f/FLAG8f3bc0340 [2024-11-12 06:13:23,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1cbadb3f/2bd4fece30c84398a42b5704f112fd7f [2024-11-12 06:13:23,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:13:23,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:13:23,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:13:23,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:13:23,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:13:23,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:13:23" (1/1) ... [2024-11-12 06:13:23,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dbdaa78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:23, skipping insertion in model container [2024-11-12 06:13:23,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:13:23" (1/1) ... [2024-11-12 06:13:23,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:13:23,580 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_operatoramount_amount10_file-53.i[915,928] [2024-11-12 06:13:23,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:13:23,653 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:13:23,667 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_operatoramount_amount10_file-53.i[915,928] [2024-11-12 06:13:23,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:13:23,711 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:13:23,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:23 WrapperNode [2024-11-12 06:13:23,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:13:23,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:13:23,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:13:23,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:13:23,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:23" (1/1) ... [2024-11-12 06:13:23,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:23" (1/1) ... [2024-11-12 06:13:23,763 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78 [2024-11-12 06:13:23,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:13:23,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:13:23,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:13:23,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:13:23,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:23" (1/1) ... [2024-11-12 06:13:23,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:23" (1/1) ... [2024-11-12 06:13:23,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:23" (1/1) ... [2024-11-12 06:13:23,797 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 06:13:23,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:23" (1/1) ... [2024-11-12 06:13:23,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:23" (1/1) ... [2024-11-12 06:13:23,806 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:23" (1/1) ... [2024-11-12 06:13:23,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:23" (1/1) ... [2024-11-12 06:13:23,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:23" (1/1) ... [2024-11-12 06:13:23,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:23" (1/1) ... [2024-11-12 06:13:23,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:13:23,825 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:13:23,828 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:13:23,828 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:13:23,829 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:23" (1/1) ... [2024-11-12 06:13:23,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:13:23,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:13:23,868 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 06:13:23,875 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 06:13:23,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:13:23,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:13:23,928 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:13:23,928 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:13:23,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:13:23,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:13:24,023 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:13:24,026 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:13:31,639 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 06:13:31,639 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:13:31,653 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:13:31,654 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:13:31,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:31 BoogieIcfgContainer [2024-11-12 06:13:31,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:13:31,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:13:31,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:13:31,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:13:31,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:13:23" (1/3) ... [2024-11-12 06:13:31,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125b1c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:13:31, skipping insertion in model container [2024-11-12 06:13:31,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:23" (2/3) ... [2024-11-12 06:13:31,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125b1c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:13:31, skipping insertion in model container [2024-11-12 06:13:31,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:31" (3/3) ... [2024-11-12 06:13:31,664 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-53.i [2024-11-12 06:13:31,681 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:13:31,682 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:13:31,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:13:31,750 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;@4a18ecf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:13:31,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:13:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 06:13:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 06:13:31,765 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:31,766 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:13:31,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:31,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:31,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2129135455, now seen corresponding path program 1 times [2024-11-12 06:13:31,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:13:31,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781715503] [2024-11-12 06:13:31,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:31,792 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 06:13:31,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:13:31,795 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 06:13:31,818 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 06:13:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:32,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:13:32,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:13:32,212 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-12 06:13:32,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:13:32,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:13:32,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781715503] [2024-11-12 06:13:32,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781715503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:32,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:32,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:13:32,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272090017] [2024-11-12 06:13:32,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:32,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:13:32,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:13:32,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:13:32,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:13:32,251 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 06:13:32,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:32,274 INFO L93 Difference]: Finished difference Result 71 states and 113 transitions. [2024-11-12 06:13:32,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:13:32,277 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 72 [2024-11-12 06:13:32,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:32,291 INFO L225 Difference]: With dead ends: 71 [2024-11-12 06:13:32,292 INFO L226 Difference]: Without dead ends: 35 [2024-11-12 06:13:32,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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 06:13:32,298 INFO L435 NwaCegarLoop]: 47 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, 47 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 06:13:32,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:13:32,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-12 06:13:32,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-12 06:13:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 06:13:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2024-11-12 06:13:32,331 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 72 [2024-11-12 06:13:32,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:32,331 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2024-11-12 06:13:32,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 06:13:32,332 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2024-11-12 06:13:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 06:13:32,334 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:32,334 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:13:32,347 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 06:13:32,535 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 06:13:32,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:32,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:32,537 INFO L85 PathProgramCache]: Analyzing trace with hash -983855065, now seen corresponding path program 1 times [2024-11-12 06:13:32,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:13:32,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498841914] [2024-11-12 06:13:32,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:32,538 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 06:13:32,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:13:32,560 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 06:13:32,562 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 06:13:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:32,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 06:13:32,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:13:45,857 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 06:13:52,199 WARN L286 SmtUtils]: Spent 6.34s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 06:13:59,942 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul c_currentRoundingMode c_~var_1_5~0 c_~var_1_6~0)) (.cse1 (fp.lt c_~var_1_3~0 c_~var_1_4~0))) (and (or (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_2~0 c_~var_1_4~0) .cse0)) .cse1) (or (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) .cse0)) (not .cse1)))) is different from false [2024-11-12 06:14:03,982 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul c_currentRoundingMode c_~var_1_5~0 c_~var_1_6~0)) (.cse1 (fp.lt c_~var_1_3~0 c_~var_1_4~0))) (and (or (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_2~0 c_~var_1_4~0) .cse0)) .cse1) (or (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) .cse0)) (not .cse1)))) is different from true [2024-11-12 06:14:22,245 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 06:14:28,107 WARN L286 SmtUtils]: Spent 5.83s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 06:14:36,305 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 06:14:44,541 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)