./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-61.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-61.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 5d36c740de441534d386d096ea681ce3661c00ad30f9b23294cc7086c26f7103 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:20:25,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:20:25,662 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:25,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:20:25,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:20:25,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:20:25,696 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:20:25,696 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:20:25,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:20:25,698 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:20:25,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:20:25,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:20:25,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:20:25,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:20:25,700 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:20:25,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:20:25,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:20:25,701 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:20:25,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:20:25,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:20:25,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:20:25,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:20:25,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:20:25,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:20:25,704 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:20:25,705 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:20:25,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:20:25,705 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:20:25,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:20:25,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:20:25,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:20:25,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:20:25,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:20:25,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:20:25,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:20:25,708 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:20:25,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:20:25,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:20:25,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:20:25,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:20:25,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:20:25,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:20:25,710 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 -> 5d36c740de441534d386d096ea681ce3661c00ad30f9b23294cc7086c26f7103 [2024-10-11 12:20:26,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:20:26,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:20:26,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:20:26,067 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:20:26,067 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:20:26,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-61.i [2024-10-11 12:20:27,572 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:20:27,751 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:20:27,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-61.i [2024-10-11 12:20:27,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fb0e5801c/0732e4d3e5234f30bdd949239072bfac/FLAG060d66803 [2024-10-11 12:20:28,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fb0e5801c/0732e4d3e5234f30bdd949239072bfac [2024-10-11 12:20:28,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:20:28,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:20:28,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:20:28,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:20:28,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:20:28,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:28" (1/1) ... [2024-10-11 12:20:28,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c2017d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:28, skipping insertion in model container [2024-10-11 12:20:28,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:28" (1/1) ... [2024-10-11 12:20:28,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:20:28,314 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-61.i[915,928] [2024-10-11 12:20:28,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:20:28,365 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:20:28,376 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-61.i[915,928] [2024-10-11 12:20:28,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:20:28,406 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:20:28,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:28 WrapperNode [2024-10-11 12:20:28,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:20:28,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:20:28,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:20:28,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:20:28,415 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:28" (1/1) ... [2024-10-11 12:20:28,427 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:28" (1/1) ... [2024-10-11 12:20:28,454 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 79 [2024-10-11 12:20:28,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:20:28,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:20:28,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:20:28,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:20:28,473 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:28" (1/1) ... [2024-10-11 12:20:28,473 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:28" (1/1) ... [2024-10-11 12:20:28,475 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:28" (1/1) ... [2024-10-11 12:20:28,496 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:28,496 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:28" (1/1) ... [2024-10-11 12:20:28,497 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:28" (1/1) ... [2024-10-11 12:20:28,501 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:28" (1/1) ... [2024-10-11 12:20:28,505 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:28" (1/1) ... [2024-10-11 12:20:28,506 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:28" (1/1) ... [2024-10-11 12:20:28,507 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:28" (1/1) ... [2024-10-11 12:20:28,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:20:28,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:20:28,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:20:28,526 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:20:28,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:28" (1/1) ... [2024-10-11 12:20:28,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:20:28,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:20:28,558 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:28,563 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:28,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:20:28,601 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:20:28,601 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:20:28,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:20:28,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:20:28,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:20:28,658 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:20:28,660 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:20:28,829 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:20:28,829 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:20:28,875 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:20:28,875 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:20:28,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:28 BoogieIcfgContainer [2024-10-11 12:20:28,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:20:28,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:20:28,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:20:28,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:20:28,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:20:28" (1/3) ... [2024-10-11 12:20:28,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4212a490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:28, skipping insertion in model container [2024-10-11 12:20:28,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:28" (2/3) ... [2024-10-11 12:20:28,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4212a490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:28, skipping insertion in model container [2024-10-11 12:20:28,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:28" (3/3) ... [2024-10-11 12:20:28,884 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-61.i [2024-10-11 12:20:28,901 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:20:28,901 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:20:28,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:20:28,960 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;@44625b80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:20:28,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:20:28,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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:28,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 12:20:28,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:28,978 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] [2024-10-11 12:20:28,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:28,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:28,984 INFO L85 PathProgramCache]: Analyzing trace with hash 722344402, now seen corresponding path program 1 times [2024-10-11 12:20:29,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:20:29,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961913751] [2024-10-11 12:20:29,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:29,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:20:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:20:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:20:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:20:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:20:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:20:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:20:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:20:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:20:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:20:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:20:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:20:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,283 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:29,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:20:29,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961913751] [2024-10-11 12:20:29,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961913751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:29,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:29,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:20:29,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697775161] [2024-10-11 12:20:29,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:29,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:20:29,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:20:29,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:20:29,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:20:29,315 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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:29,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:29,355 INFO L93 Difference]: Finished difference Result 59 states and 99 transitions. [2024-10-11 12:20:29,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:20:29,357 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 67 [2024-10-11 12:20:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:29,363 INFO L225 Difference]: With dead ends: 59 [2024-10-11 12:20:29,363 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 12:20:29,366 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:29,371 INFO L432 NwaCegarLoop]: 37 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, 37 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:29,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 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:29,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 12:20:29,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-11 12:20:29,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2024-10-11 12:20:29,410 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 67 [2024-10-11 12:20:29,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:29,411 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2024-10-11 12:20:29,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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:29,412 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2024-10-11 12:20:29,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 12:20:29,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:29,416 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] [2024-10-11 12:20:29,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:20:29,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:29,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:29,421 INFO L85 PathProgramCache]: Analyzing trace with hash 588453200, now seen corresponding path program 1 times [2024-10-11 12:20:29,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:20:29,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613745264] [2024-10-11 12:20:29,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:29,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:20:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:20:29,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:20:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:20:29,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:20:29,618 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:20:29,633 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:20:29,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:20:29,641 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 12:20:29,706 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:20:29,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:20:29 BoogieIcfgContainer [2024-10-11 12:20:29,713 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:20:29,715 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:20:29,715 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:20:29,715 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:20:29,715 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:28" (3/4) ... [2024-10-11 12:20:29,717 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:20:29,718 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:20:29,720 INFO L158 Benchmark]: Toolchain (without parser) took 1581.90ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 73.3MB in the beginning and 230.3MB in the end (delta: -157.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:20:29,720 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 142.6MB. Free memory is still 110.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:20:29,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.66ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 59.3MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 12:20:29,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.68ms. Allocated memory is still 142.6MB. Free memory was 59.3MB in the beginning and 57.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:20:29,722 INFO L158 Benchmark]: Boogie Preprocessor took 53.73ms. Allocated memory is still 142.6MB. Free memory was 57.4MB in the beginning and 55.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:20:29,723 INFO L158 Benchmark]: RCFGBuilder took 352.92ms. Allocated memory is still 268.4MB. Free memory was 238.2MB in the beginning and 227.8MB in the end (delta: 10.4MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-10-11 12:20:29,723 INFO L158 Benchmark]: TraceAbstraction took 836.20ms. Allocated memory is still 268.4MB. Free memory was 227.8MB in the beginning and 230.3MB in the end (delta: -2.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-11 12:20:29,723 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 268.4MB. Free memory is still 230.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:20:29,726 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.10ms. Allocated memory is still 142.6MB. Free memory is still 110.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.66ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 59.3MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.68ms. Allocated memory is still 142.6MB. Free memory was 59.3MB in the beginning and 57.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.73ms. Allocated memory is still 142.6MB. Free memory was 57.4MB in the beginning and 55.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 352.92ms. Allocated memory is still 268.4MB. Free memory was 238.2MB in the beginning and 227.8MB in the end (delta: 10.4MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * TraceAbstraction took 836.20ms. Allocated memory is still 268.4MB. Free memory was 227.8MB in the beginning and 230.3MB in the end (delta: -2.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 268.4MB. Free memory is still 230.3MB. 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 someBinaryDOUBLEComparisonOperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 0; [L23] double var_1_2 = 199.5; [L24] double var_1_3 = 10.25; [L25] signed char var_1_4 = 5; [L26] signed char var_1_5 = 64; [L27] signed char var_1_6 = 8; [L28] signed char var_1_7 = 5; [L29] unsigned long int var_1_8 = 8; [L66] isInitial = 1 [L67] FCALL initially() [L68] COND TRUE 1 [L69] FCALL updateLastVariables() [L70] CALL updateVariables() [L41] var_1_2 = __VERIFIER_nondet_double() [L42] 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=0, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L42] 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=0, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L43] CALL assume_abort_if_not(var_1_2 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L43] RET assume_abort_if_not(var_1_2 != 0.0F) VAL [isInitial=1, var_1_1=0, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L44] var_1_3 = __VERIFIER_nondet_double() [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=0, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [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=0, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L46] var_1_4 = __VERIFIER_nondet_char() [L47] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L47] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L48] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L48] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L49] var_1_5 = __VERIFIER_nondet_char() [L50] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=-1, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=-1, var_1_6=8, var_1_7=5, var_1_8=8] [L50] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=-1, var_1_6=8, var_1_7=5, var_1_8=8] [L51] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=-1, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=-1, var_1_6=8, var_1_7=5, var_1_8=8] [L51] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=-1, var_1_6=8, var_1_7=5, var_1_8=8] [L52] var_1_6 = __VERIFIER_nondet_char() [L53] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=-1, var_1_6=126, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=-1, var_1_6=126, var_1_7=5, var_1_8=8] [L53] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=-1, var_1_6=126, var_1_7=5, var_1_8=8] [L54] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=-1, var_1_6=126, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=-1, var_1_6=126, var_1_7=5, var_1_8=8] [L54] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=-1, var_1_6=126, var_1_7=5, var_1_8=8] [L55] var_1_7 = __VERIFIER_nondet_char() [L56] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=-1, var_1_6=126, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=-1, var_1_6=126, var_1_7=0, var_1_8=8] [L56] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=-1, var_1_6=126, var_1_7=0, var_1_8=8] [L57] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=-1, var_1_6=126, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=-1, var_1_6=126, var_1_7=0, var_1_8=8] [L57] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=-1, var_1_6=126, var_1_7=0, var_1_8=8] [L70] RET updateVariables() [L71] CALL step() [L33] COND TRUE (999.375 / ((((var_1_2) > (-0.19)) ? (var_1_2) : (-0.19)))) >= var_1_3 [L34] var_1_1 = (var_1_4 + -32) VAL [isInitial=1, var_1_1=-32, var_1_4=0, var_1_5=-1, var_1_6=126, var_1_7=0, var_1_8=8] [L38] var_1_8 = var_1_7 [L71] RET step() [L72] CALL, EXPR property() [L62-L63] return (((999.375 / ((((var_1_2) > (-0.19)) ? (var_1_2) : (-0.19)))) >= var_1_3) ? (var_1_1 == ((signed char) (var_1_4 + -32))) : (var_1_1 == ((signed char) (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))) - var_1_7)))) && (var_1_8 == ((unsigned long int) var_1_7)) ; [L72] RET, EXPR property() [L72] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=-32, var_1_4=0, var_1_5=-1, var_1_6=126, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_1=-32, var_1_4=0, var_1_5=-1, var_1_6=126, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 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, 37 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, 37 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=31occurred 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, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 66 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:29,763 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-61.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 5d36c740de441534d386d096ea681ce3661c00ad30f9b23294cc7086c26f7103 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:20:31,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:20:31,937 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:31,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:20:31,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:20:31,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:20:31,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:20:31,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:20:31,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:20:31,979 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:20:31,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:20:31,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:20:31,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:20:31,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:20:31,980 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:20:31,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:20:31,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:20:31,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:20:31,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:20:31,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:20:31,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:20:31,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:20:31,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:20:31,985 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:20:31,985 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:20:31,986 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:20:31,986 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:20:31,986 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:20:31,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:20:31,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:20:31,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:20:31,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:20:31,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:20:31,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:20:31,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:20:31,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:20:31,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:20:31,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:20:31,988 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:20:31,988 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:20:31,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:20:31,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:20:31,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:20:31,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:20:31,990 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:20:31,990 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 -> 5d36c740de441534d386d096ea681ce3661c00ad30f9b23294cc7086c26f7103 [2024-10-11 12:20:32,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:20:32,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:20:32,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:20:32,294 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:20:32,294 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:20:32,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-61.i [2024-10-11 12:20:34,096 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:20:34,318 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:20:34,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-61.i [2024-10-11 12:20:34,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ef00b9c66/b4fcbc5212be4e8d8b8ba7efca2933f8/FLAG92fef71d3 [2024-10-11 12:20:34,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ef00b9c66/b4fcbc5212be4e8d8b8ba7efca2933f8 [2024-10-11 12:20:34,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:20:34,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:20:34,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:20:34,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:20:34,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:20:34,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:34" (1/1) ... [2024-10-11 12:20:34,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b24698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:34, skipping insertion in model container [2024-10-11 12:20:34,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:34" (1/1) ... [2024-10-11 12:20:34,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:20:34,523 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-61.i[915,928] [2024-10-11 12:20:34,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:20:34,571 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:20:34,582 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-61.i[915,928] [2024-10-11 12:20:34,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:20:34,617 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:20:34,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:34 WrapperNode [2024-10-11 12:20:34,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:20:34,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:20:34,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:20:34,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:20:34,625 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:34" (1/1) ... [2024-10-11 12:20:34,635 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:34" (1/1) ... [2024-10-11 12:20:34,654 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 75 [2024-10-11 12:20:34,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:20:34,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:20:34,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:20:34,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:20:34,664 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:34" (1/1) ... [2024-10-11 12:20:34,664 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:34" (1/1) ... [2024-10-11 12:20:34,669 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:34" (1/1) ... [2024-10-11 12:20:34,686 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:34,690 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:34" (1/1) ... [2024-10-11 12:20:34,690 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:34" (1/1) ... [2024-10-11 12:20:34,698 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:34" (1/1) ... [2024-10-11 12:20:34,705 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:34" (1/1) ... [2024-10-11 12:20:34,708 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:34" (1/1) ... [2024-10-11 12:20:34,709 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:34" (1/1) ... [2024-10-11 12:20:34,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:20:34,715 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:20:34,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:20:34,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:20:34,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:34" (1/1) ... [2024-10-11 12:20:34,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:20:34,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:20:34,751 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:34,753 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:34,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:20:34,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:20:34,794 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:20:34,794 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:20:34,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:20:34,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:20:34,871 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:20:34,873 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:20:45,716 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:20:45,717 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:20:45,774 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:20:45,775 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:20:45,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:45 BoogieIcfgContainer [2024-10-11 12:20:45,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:20:45,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:20:45,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:20:45,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:20:45,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:20:34" (1/3) ... [2024-10-11 12:20:45,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e348c26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:45, skipping insertion in model container [2024-10-11 12:20:45,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:34" (2/3) ... [2024-10-11 12:20:45,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e348c26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:45, skipping insertion in model container [2024-10-11 12:20:45,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:45" (3/3) ... [2024-10-11 12:20:45,784 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-61.i [2024-10-11 12:20:45,799 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:20:45,800 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:20:45,854 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:20:45,860 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;@385903ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:20:45,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:20:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 12:20:45,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:45,873 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] [2024-10-11 12:20:45,873 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:45,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:45,879 INFO L85 PathProgramCache]: Analyzing trace with hash 722344402, now seen corresponding path program 1 times [2024-10-11 12:20:45,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:20:45,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144298912] [2024-10-11 12:20:45,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:45,892 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:45,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:20:45,895 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:45,896 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:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:46,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:20:46,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:20:46,636 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:46,636 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:20:46,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:20:46,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144298912] [2024-10-11 12:20:46,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144298912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:46,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:46,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:20:46,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243044477] [2024-10-11 12:20:46,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:46,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:20:46,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:20:46,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:20:46,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:20:46,686 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 12:20:51,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:20:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:51,006 INFO L93 Difference]: Finished difference Result 59 states and 99 transitions. [2024-10-11 12:20:51,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:20:51,094 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 67 [2024-10-11 12:20:51,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:51,099 INFO L225 Difference]: With dead ends: 59 [2024-10-11 12:20:51,099 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 12:20:51,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 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:51,103 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:20:51,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 12:20:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 12:20:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-11 12:20:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2024-10-11 12:20:51,132 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 67 [2024-10-11 12:20:51,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:51,132 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2024-10-11 12:20:51,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 12:20:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2024-10-11 12:20:51,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 12:20:51,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:51,134 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] [2024-10-11 12:20:51,156 INFO L552 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)] Ended with exit code 0 [2024-10-11 12:20:51,335 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:51,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:51,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:51,336 INFO L85 PathProgramCache]: Analyzing trace with hash 588453200, now seen corresponding path program 1 times [2024-10-11 12:20:51,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:20:51,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97869389] [2024-10-11 12:20:51,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:51,337 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:51,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:20:51,340 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:51,341 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:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:52,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 12:20:52,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:21:00,652 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 12:21:11,047 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 12:21:19,103 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 12:21:27,602 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 12:21:31,773 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 19.0 100.0))))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 7995.0 8.0))) (.cse2 (fp.gt c_~var_1_2~0 .cse1))) (or (and (fp.geq (fp.div c_currentRoundingMode .cse0 .cse1) c_~var_1_3~0) (not .cse2)) (and (fp.geq (fp.div c_currentRoundingMode .cse0 c_~var_1_2~0) c_~var_1_3~0) .cse2)))) (= ((_ extract 7 0) (bvadd (_ bv4294967264 32) ((_ sign_extend 24) c_~var_1_4~0))) c_~var_1_1~0)) is different from false [2024-10-11 12:21:35,923 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 19.0 100.0))))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 7995.0 8.0))) (.cse2 (fp.gt c_~var_1_2~0 .cse1))) (or (and (fp.geq (fp.div c_currentRoundingMode .cse0 .cse1) c_~var_1_3~0) (not .cse2)) (and (fp.geq (fp.div c_currentRoundingMode .cse0 c_~var_1_2~0) c_~var_1_3~0) .cse2)))) (= ((_ extract 7 0) (bvadd (_ bv4294967264 32) ((_ sign_extend 24) c_~var_1_4~0))) c_~var_1_1~0)) is different from true [2024-10-11 12:22:04,876 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)