./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_operatoramount_amount10_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 12:20:06,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:20:06,307 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:20:06,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:20:06,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:20:06,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:20:06,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:20:06,336 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:20:06,336 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:20:06,337 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:20:06,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:20:06,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:20:06,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:20:06,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:20:06,342 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:20:06,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:20:06,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:20:06,343 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:20:06,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:20:06,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:20:06,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:20:06,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:20:06,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:20:06,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:20:06,350 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:20:06,350 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:20:06,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:20:06,350 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:20:06,351 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:20:06,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:20:06,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:20:06,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:20:06,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:20:06,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:20:06,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:20:06,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:20:06,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:20:06,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:20:06,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:20:06,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:20:06,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:20:06,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:20:06,368 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-clean/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-clean/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-10-11 12:20:06,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:20:06,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:20:06,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:20:06,657 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:20:06,658 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:20:06,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.i [2024-10-11 12:20:08,186 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:20:08,413 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:20:08,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.i [2024-10-11 12:20:08,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ba47ce214/dd1eac2ac207478ea7c2e8e254bc71be/FLAGad8d24341 [2024-10-11 12:20:08,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ba47ce214/dd1eac2ac207478ea7c2e8e254bc71be [2024-10-11 12:20:08,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:20:08,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:20:08,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:20:08,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:20:08,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:20:08,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:08" (1/1) ... [2024-10-11 12:20:08,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@685d1a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:08, skipping insertion in model container [2024-10-11 12:20:08,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:08" (1/1) ... [2024-10-11 12:20:08,803 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:20:08,956 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_operatoramount_amount10_file-53.i[915,928] [2024-10-11 12:20:08,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:20:08,990 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:20:09,002 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_operatoramount_amount10_file-53.i[915,928] [2024-10-11 12:20:09,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:20:09,038 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:20:09,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:09 WrapperNode [2024-10-11 12:20:09,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:20:09,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:20:09,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:20:09,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:20:09,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:09" (1/1) ... [2024-10-11 12:20:09,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:09" (1/1) ... [2024-10-11 12:20:09,078 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 80 [2024-10-11 12:20:09,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:20:09,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:20:09,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:20:09,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:20:09,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:09" (1/1) ... [2024-10-11 12:20:09,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:09" (1/1) ... [2024-10-11 12:20:09,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:09" (1/1) ... [2024-10-11 12:20:09,120 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-11 12:20:09,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:09" (1/1) ... [2024-10-11 12:20:09,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:09" (1/1) ... [2024-10-11 12:20:09,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:09" (1/1) ... [2024-10-11 12:20:09,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:09" (1/1) ... [2024-10-11 12:20:09,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:09" (1/1) ... [2024-10-11 12:20:09,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:09" (1/1) ... [2024-10-11 12:20:09,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:20:09,135 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:20:09,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:20:09,136 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:20:09,137 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:09" (1/1) ... [2024-10-11 12:20:09,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:20:09,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:20:09,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:20:09,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:20:09,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:20:09,225 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:20:09,225 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:20:09,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:20:09,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:20:09,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:20:09,307 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:20:09,309 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:20:09,467 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:20:09,468 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:20:09,512 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:20:09,513 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:20:09,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:09 BoogieIcfgContainer [2024-10-11 12:20:09,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:20:09,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:20:09,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:20:09,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:20:09,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:20:08" (1/3) ... [2024-10-11 12:20:09,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43664d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:09, skipping insertion in model container [2024-10-11 12:20:09,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:09" (2/3) ... [2024-10-11 12:20:09,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43664d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:09, skipping insertion in model container [2024-10-11 12:20:09,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:09" (3/3) ... [2024-10-11 12:20:09,526 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-53.i [2024-10-11 12:20:09,543 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:20:09,544 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:20:09,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:20:09,636 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;@3af78b8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:20:09,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:20:09,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 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-10-11 12:20:09,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 12:20:09,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:09,653 INFO L215 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] [2024-10-11 12:20:09,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:09,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:09,660 INFO L85 PathProgramCache]: Analyzing trace with hash 285952230, now seen corresponding path program 1 times [2024-10-11 12:20:09,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:20:09,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856810563] [2024-10-11 12:20:09,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:09,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:20:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:09,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:20:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:09,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:20:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:09,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:20:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:09,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:20:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:09,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:20:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:09,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:20:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:09,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 12:20:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:09,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 12:20:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:09,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 12:20:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:09,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 12:20:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:09,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 12:20:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 12:20:10,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:20:10,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856810563] [2024-10-11 12:20:10,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856810563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:10,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:10,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:20:10,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943285685] [2024-10-11 12:20:10,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:10,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:20:10,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:20:10,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:20:10,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:20:10,036 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-10-11 12:20:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:10,078 INFO L93 Difference]: Finished difference Result 63 states and 105 transitions. [2024-10-11 12:20:10,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:20:10,087 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 68 [2024-10-11 12:20:10,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:10,094 INFO L225 Difference]: With dead ends: 63 [2024-10-11 12:20:10,095 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 12:20:10,099 INFO L431 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-10-11 12:20:10,104 INFO L432 NwaCegarLoop]: 40 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, 40 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-11 12:20:10,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:20:10,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 12:20:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-11 12:20:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-10-11 12:20:10,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2024-10-11 12:20:10,142 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 68 [2024-10-11 12:20:10,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:10,142 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2024-10-11 12:20:10,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-10-11 12:20:10,143 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2024-10-11 12:20:10,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 12:20:10,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:10,145 INFO L215 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] [2024-10-11 12:20:10,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:20:10,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:10,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:10,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1708370080, now seen corresponding path program 1 times [2024-10-11 12:20:10,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:20:10,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578897160] [2024-10-11 12:20:10,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:10,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:20:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:20:10,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:20:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:20:10,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:20:10,308 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:20:10,309 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:20:10,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:20:10,316 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 12:20:10,378 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:20:10,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:20:10 BoogieIcfgContainer [2024-10-11 12:20:10,384 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:20:10,384 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:20:10,385 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:20:10,385 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:20:10,386 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:09" (3/4) ... [2024-10-11 12:20:10,388 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:20:10,389 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:20:10,390 INFO L158 Benchmark]: Toolchain (without parser) took 1619.29ms. Allocated memory is still 184.5MB. Free memory was 125.2MB in the beginning and 53.5MB in the end (delta: 71.7MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2024-10-11 12:20:10,390 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:20:10,392 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.54ms. Allocated memory is still 184.5MB. Free memory was 124.8MB in the beginning and 112.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 12:20:10,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.58ms. Allocated memory is still 184.5MB. Free memory was 112.2MB in the beginning and 110.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:20:10,394 INFO L158 Benchmark]: Boogie Preprocessor took 54.73ms. Allocated memory is still 184.5MB. Free memory was 110.1MB in the beginning and 108.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:20:10,394 INFO L158 Benchmark]: RCFGBuilder took 378.03ms. Allocated memory is still 184.5MB. Free memory was 108.4MB in the beginning and 94.2MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 12:20:10,395 INFO L158 Benchmark]: TraceAbstraction took 865.85ms. Allocated memory is still 184.5MB. Free memory was 93.7MB in the beginning and 53.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-11 12:20:10,395 INFO L158 Benchmark]: Witness Printer took 4.87ms. Allocated memory is still 184.5MB. Free memory was 53.9MB in the beginning and 53.5MB in the end (delta: 419.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:20:10,400 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 184.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.54ms. Allocated memory is still 184.5MB. Free memory was 124.8MB in the beginning and 112.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.58ms. Allocated memory is still 184.5MB. Free memory was 112.2MB in the beginning and 110.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.73ms. Allocated memory is still 184.5MB. Free memory was 110.1MB in the beginning and 108.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 378.03ms. Allocated memory is still 184.5MB. Free memory was 108.4MB in the beginning and 94.2MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 865.85ms. Allocated memory is still 184.5MB. Free memory was 93.7MB in the beginning and 53.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 4.87ms. Allocated memory is still 184.5MB. Free memory was 53.9MB in the beginning and 53.5MB in the end (delta: 419.6kB). 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; [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 ; [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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, 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, 40 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, 40 mSDtfsCounter, 3 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=33occurred 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, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 67 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-10-11 12:20:10,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 12:20:12,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:20:12,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:20:12,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:20:12,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:20:12,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:20:12,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:20:12,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:20:12,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:20:12,872 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:20:12,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:20:12,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:20:12,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:20:12,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:20:12,877 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:20:12,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:20:12,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:20:12,878 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:20:12,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:20:12,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:20:12,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:20:12,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:20:12,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:20:12,884 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:20:12,885 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:20:12,885 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:20:12,885 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:20:12,885 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:20:12,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:20:12,886 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:20:12,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:20:12,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:20:12,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:20:12,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:20:12,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:20:12,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:20:12,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:20:12,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:20:12,888 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:20:12,888 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:20:12,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:20:12,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:20:12,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:20:12,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:20:12,890 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:20:12,891 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-clean/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-clean/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-10-11 12:20:13,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:20:13,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:20:13,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:20:13,254 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:20:13,255 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:20:13,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.i [2024-10-11 12:20:14,794 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:20:15,039 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:20:15,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.i [2024-10-11 12:20:15,057 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0c3e23b9a/db41c5af40534b68bef4d18d2687654d/FLAG703e4d6ff [2024-10-11 12:20:15,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0c3e23b9a/db41c5af40534b68bef4d18d2687654d [2024-10-11 12:20:15,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:20:15,085 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:20:15,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:20:15,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:20:15,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:20:15,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:15" (1/1) ... [2024-10-11 12:20:15,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41705d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:15, skipping insertion in model container [2024-10-11 12:20:15,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:15" (1/1) ... [2024-10-11 12:20:15,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:20:15,301 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_operatoramount_amount10_file-53.i[915,928] [2024-10-11 12:20:15,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:20:15,366 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:20:15,381 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_operatoramount_amount10_file-53.i[915,928] [2024-10-11 12:20:15,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:20:15,426 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:20:15,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:15 WrapperNode [2024-10-11 12:20:15,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:20:15,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:20:15,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:20:15,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:20:15,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:15" (1/1) ... [2024-10-11 12:20:15,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:15" (1/1) ... [2024-10-11 12:20:15,470 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78 [2024-10-11 12:20:15,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:20:15,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:20:15,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:20:15,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:20:15,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:15" (1/1) ... [2024-10-11 12:20:15,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:15" (1/1) ... [2024-10-11 12:20:15,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:15" (1/1) ... [2024-10-11 12:20:15,516 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-11 12:20:15,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:15" (1/1) ... [2024-10-11 12:20:15,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:15" (1/1) ... [2024-10-11 12:20:15,529 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:15" (1/1) ... [2024-10-11 12:20:15,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:15" (1/1) ... [2024-10-11 12:20:15,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:15" (1/1) ... [2024-10-11 12:20:15,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:15" (1/1) ... [2024-10-11 12:20:15,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:20:15,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:20:15,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:20:15,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:20:15,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:15" (1/1) ... [2024-10-11 12:20:15,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:20:15,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:20:15,591 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:20:15,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:20:15,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:20:15,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:20:15,637 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:20:15,638 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:20:15,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:20:15,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:20:15,707 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:20:15,709 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:20:22,548 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:20:22,550 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:20:22,615 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:20:22,615 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:20:22,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:22 BoogieIcfgContainer [2024-10-11 12:20:22,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:20:22,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:20:22,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:20:22,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:20:22,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:20:15" (1/3) ... [2024-10-11 12:20:22,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51190724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:22, skipping insertion in model container [2024-10-11 12:20:22,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:15" (2/3) ... [2024-10-11 12:20:22,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51190724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:22, skipping insertion in model container [2024-10-11 12:20:22,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:22" (3/3) ... [2024-10-11 12:20:22,629 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-53.i [2024-10-11 12:20:22,645 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:20:22,645 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:20:22,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:20:22,727 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;@2e2564d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:20:22,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:20:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 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-10-11 12:20:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 12:20:22,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:22,748 INFO L215 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] [2024-10-11 12:20:22,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:22,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:22,757 INFO L85 PathProgramCache]: Analyzing trace with hash 285952230, now seen corresponding path program 1 times [2024-10-11 12:20:22,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:20:22,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383226601] [2024-10-11 12:20:22,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:22,774 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-11 12:20:22,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:20:22,778 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 12:20:22,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 12:20:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:23,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:20:23,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:20:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-11 12:20:23,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:20:23,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:20:23,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383226601] [2024-10-11 12:20:23,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383226601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:23,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:23,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:20:23,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636935750] [2024-10-11 12:20:23,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:23,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:20:23,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:20:23,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:20:23,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:20:23,277 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 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 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 12:20:25,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:20:25,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:25,240 INFO L93 Difference]: Finished difference Result 63 states and 105 transitions. [2024-10-11 12:20:25,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:20:25,282 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (11), 2 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 68 [2024-10-11 12:20:25,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:25,289 INFO L225 Difference]: With dead ends: 63 [2024-10-11 12:20:25,289 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 12:20:25,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 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-11 12:20:25,298 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 12:20:25,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 12:20:25,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 12:20:25,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-11 12:20:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-10-11 12:20:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2024-10-11 12:20:25,342 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 68 [2024-10-11 12:20:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:25,342 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2024-10-11 12:20:25,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 12:20:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2024-10-11 12:20:25,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 12:20:25,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:25,346 INFO L215 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] [2024-10-11 12:20:25,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 12:20:25,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 12:20:25,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:25,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:25,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1708370080, now seen corresponding path program 1 times [2024-10-11 12:20:25,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:20:25,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715803975] [2024-10-11 12:20:25,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:25,553 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-11 12:20:25,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:20:25,555 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 12:20:25,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 12:20:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:25,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 12:20:25,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:20:36,638 WARN L286 SmtUtils]: Spent 6.48s 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-10-11 12:20:44,805 WARN L286 SmtUtils]: Spent 8.17s 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-10-11 12:20:50,556 WARN L286 SmtUtils]: Spent 5.75s 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-10-11 12:20:54,608 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-10-11 12:20:58,661 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-10-11 12:21:12,773 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-10-11 12:21:24,749 WARN L286 SmtUtils]: Spent 7.81s 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-10-11 12:21:33,138 WARN L286 SmtUtils]: Spent 8.17s 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-10-11 12:21:45,494 WARN L286 SmtUtils]: Spent 8.19s 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)