./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-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-18.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 09678c77438823f5421658f269ea899b63adcdec9e9a366091e7381adf928989 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:59:26,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:59:26,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:59:26,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:59:26,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:59:26,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:59:26,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:59:26,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:59:26,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:59:26,279 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:59:26,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:59:26,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:59:26,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:59:26,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:59:26,281 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:59:26,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:59:26,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:59:26,282 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:59:26,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:59:26,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:59:26,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:59:26,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:59:26,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:59:26,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:59:26,286 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:59:26,286 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:59:26,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:59:26,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:59:26,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:59:26,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:59:26,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:59:26,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:59:26,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:59:26,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:59:26,288 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:59:26,288 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:59:26,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:59:26,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:59:26,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:59:26,289 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:59:26,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:59:26,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:59:26,291 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 09678c77438823f5421658f269ea899b63adcdec9e9a366091e7381adf928989 [2024-10-13 04:59:26,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:59:26,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:59:26,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:59:26,559 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:59:26,560 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:59:26,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-18.i [2024-10-13 04:59:28,036 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:59:28,237 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:59:28,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-18.i [2024-10-13 04:59:28,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c93f3e10e/abe28f4e3c4b445792e63d6aa6840870/FLAGf732b15e9 [2024-10-13 04:59:28,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c93f3e10e/abe28f4e3c4b445792e63d6aa6840870 [2024-10-13 04:59:28,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:59:28,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:59:28,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:59:28,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:59:28,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:59:28,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:59:28" (1/1) ... [2024-10-13 04:59:28,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12c930b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:28, skipping insertion in model container [2024-10-13 04:59:28,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:59:28" (1/1) ... [2024-10-13 04:59:28,291 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:59:28,470 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-18.i[915,928] [2024-10-13 04:59:28,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:59:28,505 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:59:28,515 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-18.i[915,928] [2024-10-13 04:59:28,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:59:28,542 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:59:28,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:28 WrapperNode [2024-10-13 04:59:28,543 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:59:28,544 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:59:28,544 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:59:28,544 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:59:28,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:28" (1/1) ... [2024-10-13 04:59:28,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:28" (1/1) ... [2024-10-13 04:59:28,583 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 76 [2024-10-13 04:59:28,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:59:28,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:59:28,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:59:28,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:59:28,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:28" (1/1) ... [2024-10-13 04:59:28,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:28" (1/1) ... [2024-10-13 04:59:28,595 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:28" (1/1) ... [2024-10-13 04:59:28,606 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:59:28,607 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:28" (1/1) ... [2024-10-13 04:59:28,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:28" (1/1) ... [2024-10-13 04:59:28,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:28" (1/1) ... [2024-10-13 04:59:28,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:28" (1/1) ... [2024-10-13 04:59:28,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:28" (1/1) ... [2024-10-13 04:59:28,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:28" (1/1) ... [2024-10-13 04:59:28,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:59:28,623 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:59:28,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:59:28,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:59:28,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:28" (1/1) ... [2024-10-13 04:59:28,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:59:28,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:59:28,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:59:28,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:59:28,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:59:28,709 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:59:28,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:59:28,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:59:28,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:59:28,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:59:28,788 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:59:28,790 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:59:28,919 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 04:59:28,919 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:59:28,968 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:59:28,968 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:59:28,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:59:28 BoogieIcfgContainer [2024-10-13 04:59:28,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:59:28,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:59:28,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:59:28,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:59:28,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:59:28" (1/3) ... [2024-10-13 04:59:28,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66393f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:59:28, skipping insertion in model container [2024-10-13 04:59:28,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:28" (2/3) ... [2024-10-13 04:59:28,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66393f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:59:28, skipping insertion in model container [2024-10-13 04:59:28,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:59:28" (3/3) ... [2024-10-13 04:59:28,977 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-18.i [2024-10-13 04:59:28,992 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:59:28,992 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:59:29,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:59:29,065 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;@17afe0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:59:29,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:59:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 04:59:29,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 04:59:29,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:59:29,083 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:59:29,084 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:59:29,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:59:29,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1766491661, now seen corresponding path program 1 times [2024-10-13 04:59:29,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:59:29,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500103666] [2024-10-13 04:59:29,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:59:29,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:59:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:29,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:59:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:29,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:59:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:29,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:59:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:29,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:59:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:29,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 04:59:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:29,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 04:59:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:29,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 04:59:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:29,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:59:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:29,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 04:59:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:29,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:59:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 04:59:29,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:59:29,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500103666] [2024-10-13 04:59:29,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500103666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:59:29,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:59:29,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:59:29,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509315029] [2024-10-13 04:59:29,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:59:29,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:59:29,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:59:29,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:59:29,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:59:29,459 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 04:59:29,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:59:29,488 INFO L93 Difference]: Finished difference Result 57 states and 94 transitions. [2024-10-13 04:59:29,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:59:29,492 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, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 62 [2024-10-13 04:59:29,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:59:29,498 INFO L225 Difference]: With dead ends: 57 [2024-10-13 04:59:29,499 INFO L226 Difference]: Without dead ends: 28 [2024-10-13 04:59:29,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:59:29,506 INFO L432 NwaCegarLoop]: 35 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, 35 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:59:29,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:59:29,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-13 04:59:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-13 04:59:29,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 04:59:29,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-10-13 04:59:29,563 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 62 [2024-10-13 04:59:29,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:59:29,564 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-10-13 04:59:29,564 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, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 04:59:29,564 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-10-13 04:59:29,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 04:59:29,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:59:29,569 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:59:29,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:59:29,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:59:29,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:59:29,572 INFO L85 PathProgramCache]: Analyzing trace with hash -231364019, now seen corresponding path program 1 times [2024-10-13 04:59:29,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:59:29,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237772072] [2024-10-13 04:59:29,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:59:29,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:59:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:59:29,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:59:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:59:29,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:59:29,853 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:59:29,856 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:59:29,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:59:29,863 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 04:59:29,928 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:59:29,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:59:29 BoogieIcfgContainer [2024-10-13 04:59:29,935 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:59:29,936 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:59:29,936 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:59:29,939 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:59:29,940 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:59:28" (3/4) ... [2024-10-13 04:59:29,942 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:59:29,944 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:59:29,946 INFO L158 Benchmark]: Toolchain (without parser) took 1678.48ms. Allocated memory is still 169.9MB. Free memory was 141.1MB in the beginning and 124.0MB in the end (delta: 17.1MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-10-13 04:59:29,946 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:59:29,948 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.70ms. Allocated memory is still 169.9MB. Free memory was 141.1MB in the beginning and 127.7MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 04:59:29,948 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.49ms. Allocated memory is still 169.9MB. Free memory was 127.7MB in the beginning and 126.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:59:29,949 INFO L158 Benchmark]: Boogie Preprocessor took 38.12ms. Allocated memory is still 169.9MB. Free memory was 126.4MB in the beginning and 124.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:59:29,951 INFO L158 Benchmark]: RCFGBuilder took 346.35ms. Allocated memory is still 169.9MB. Free memory was 124.3MB in the beginning and 109.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 04:59:29,952 INFO L158 Benchmark]: TraceAbstraction took 964.16ms. Allocated memory is still 169.9MB. Free memory was 108.9MB in the beginning and 124.0MB in the end (delta: -15.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:59:29,952 INFO L158 Benchmark]: Witness Printer took 8.63ms. Allocated memory is still 169.9MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:59:29,954 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.16ms. Allocated memory is still 121.6MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.70ms. Allocated memory is still 169.9MB. Free memory was 141.1MB in the beginning and 127.7MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.49ms. Allocated memory is still 169.9MB. Free memory was 127.7MB in the beginning and 126.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.12ms. Allocated memory is still 169.9MB. Free memory was 126.4MB in the beginning and 124.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 346.35ms. Allocated memory is still 169.9MB. Free memory was 124.3MB in the beginning and 109.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 964.16ms. Allocated memory is still 169.9MB. Free memory was 108.9MB in the beginning and 124.0MB in the end (delta: -15.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 8.63ms. Allocated memory is still 169.9MB. Free memory is still 124.0MB. 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 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -1; [L23] double var_1_2 = 24.75; [L24] double var_1_3 = 16.7; [L25] double var_1_4 = 0.8; [L26] signed short int var_1_5 = -1; [L27] signed short int var_1_6 = 4; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 1; [L65] isInitial = 1 [L66] FCALL initially() [L67] COND TRUE 1 [L68] FCALL updateLastVariables() [L69] 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=-1, var_1_3=167/10, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_3=167/10, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [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=-1, var_1_3=167/10, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L43] var_1_3 = __VERIFIER_nondet_double() [L44] 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=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L44] 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=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L45] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L45] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L46] var_1_4 = __VERIFIER_nondet_double() [L47] 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=-1, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L47] 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=-1, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L48] var_1_5 = __VERIFIER_nondet_short() [L49] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L49] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L50] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L50] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L51] var_1_6 = __VERIFIER_nondet_short() [L52] CALL assume_abort_if_not(var_1_6 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=1] [L52] RET assume_abort_if_not(var_1_6 >= -16383) VAL [isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=1] [L53] CALL assume_abort_if_not(var_1_6 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=1] [L53] RET assume_abort_if_not(var_1_6 <= 16383) VAL [isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=1] [L54] var_1_8 = __VERIFIER_nondet_uchar() [L55] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=-255] [L55] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=-255] [L56] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=-255] [L56] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=-255] [L69] RET updateVariables() [L70] CALL step() [L33] COND TRUE (var_1_2 + (15.3 / var_1_3)) > (- var_1_4) [L34] var_1_1 = (var_1_5 + var_1_6) VAL [isInitial=1, var_1_1=-2, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=-255] [L38] var_1_7 = var_1_8 [L70] RET step() [L71] CALL, EXPR property() [L61-L62] return (((var_1_2 + (15.3 / var_1_3)) > (- var_1_4)) ? (var_1_1 == ((signed short int) (var_1_5 + var_1_6))) : (var_1_1 == ((signed short int) ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5)))))) && (var_1_7 == ((unsigned char) var_1_8)) ; [L71] RET, EXPR property() [L71] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=-2, var_1_5=-1, var_1_6=-1, var_1_7=-255, var_1_8=-255] [L19] reach_error() VAL [isInitial=1, var_1_1=-2, var_1_5=-1, var_1_6=-1, var_1_7=-255, var_1_8=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 10, 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, 35 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, 35 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 61 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 180/180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 04:59:29,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-18.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 09678c77438823f5421658f269ea899b63adcdec9e9a366091e7381adf928989 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:59:32,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:59:32,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:59:32,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:59:32,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:59:32,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:59:32,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:59:32,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:59:32,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:59:32,386 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:59:32,387 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:59:32,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:59:32,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:59:32,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:59:32,389 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:59:32,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:59:32,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:59:32,390 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:59:32,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:59:32,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:59:32,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:59:32,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:59:32,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:59:32,394 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:59:32,394 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:59:32,395 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:59:32,395 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:59:32,395 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:59:32,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:59:32,396 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:59:32,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:59:32,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:59:32,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:59:32,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:59:32,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:59:32,401 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:59:32,401 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:59:32,401 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:59:32,402 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:59:32,402 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:59:32,402 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:59:32,403 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:59:32,403 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:59:32,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:59:32,404 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:59:32,404 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 09678c77438823f5421658f269ea899b63adcdec9e9a366091e7381adf928989 [2024-10-13 04:59:32,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:59:32,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:59:32,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:59:32,796 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:59:32,797 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:59:32,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-18.i [2024-10-13 04:59:34,469 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:59:34,677 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:59:34,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-18.i [2024-10-13 04:59:34,685 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2101a6ec/71ae2fd0d82d458681d150c14ff27da0/FLAGc5124239e [2024-10-13 04:59:34,699 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2101a6ec/71ae2fd0d82d458681d150c14ff27da0 [2024-10-13 04:59:34,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:59:34,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:59:34,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:59:34,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:59:34,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:59:34,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:59:34" (1/1) ... [2024-10-13 04:59:34,717 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5222defd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:34, skipping insertion in model container [2024-10-13 04:59:34,717 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:59:34" (1/1) ... [2024-10-13 04:59:34,757 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:59:34,940 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-18.i[915,928] [2024-10-13 04:59:34,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:59:34,993 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:59:35,007 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-18.i[915,928] [2024-10-13 04:59:35,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:59:35,050 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:59:35,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:35 WrapperNode [2024-10-13 04:59:35,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:59:35,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:59:35,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:59:35,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:59:35,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:35" (1/1) ... [2024-10-13 04:59:35,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:35" (1/1) ... [2024-10-13 04:59:35,094 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 74 [2024-10-13 04:59:35,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:59:35,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:59:35,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:59:35,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:59:35,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:35" (1/1) ... [2024-10-13 04:59:35,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:35" (1/1) ... [2024-10-13 04:59:35,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:35" (1/1) ... [2024-10-13 04:59:35,129 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:59:35,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:35" (1/1) ... [2024-10-13 04:59:35,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:35" (1/1) ... [2024-10-13 04:59:35,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:35" (1/1) ... [2024-10-13 04:59:35,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:35" (1/1) ... [2024-10-13 04:59:35,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:35" (1/1) ... [2024-10-13 04:59:35,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:35" (1/1) ... [2024-10-13 04:59:35,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:59:35,162 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:59:35,162 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:59:35,162 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:59:35,163 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:35" (1/1) ... [2024-10-13 04:59:35,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:59:35,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:59:35,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:59:35,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:59:35,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:59:35,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:59:35,245 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:59:35,245 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:59:35,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:59:35,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:59:35,327 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:59:35,328 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:59:44,462 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 04:59:44,463 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:59:44,509 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:59:44,509 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:59:44,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:59:44 BoogieIcfgContainer [2024-10-13 04:59:44,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:59:44,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:59:44,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:59:44,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:59:44,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:59:34" (1/3) ... [2024-10-13 04:59:44,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21383a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:59:44, skipping insertion in model container [2024-10-13 04:59:44,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:35" (2/3) ... [2024-10-13 04:59:44,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21383a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:59:44, skipping insertion in model container [2024-10-13 04:59:44,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:59:44" (3/3) ... [2024-10-13 04:59:44,523 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-18.i [2024-10-13 04:59:44,548 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:59:44,549 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:59:44,621 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:59:44,629 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;@3e9646ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:59:44,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:59:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 04:59:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 04:59:44,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:59:44,646 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:59:44,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:59:44,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:59:44,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1766491661, now seen corresponding path program 1 times [2024-10-13 04:59:44,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:59:44,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219741715] [2024-10-13 04:59:44,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:59:44,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:59:44,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:59:44,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:59:44,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 04:59:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:45,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:59:45,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:59:45,438 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-13 04:59:45,438 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:59:45,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:59:45,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219741715] [2024-10-13 04:59:45,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [219741715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:59:45,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:59:45,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:59:45,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352258778] [2024-10-13 04:59:45,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:59:45,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:59:45,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:59:45,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:59:45,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:59:45,475 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 04:59:49,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:59:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:59:49,727 INFO L93 Difference]: Finished difference Result 57 states and 94 transitions. [2024-10-13 04:59:49,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:59:49,823 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 62 [2024-10-13 04:59:49,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:59:49,828 INFO L225 Difference]: With dead ends: 57 [2024-10-13 04:59:49,828 INFO L226 Difference]: Without dead ends: 28 [2024-10-13 04:59:49,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:59:49,834 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:59:49,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 04:59:49,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-13 04:59:49,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-13 04:59:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 04:59:49,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-10-13 04:59:49,866 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 62 [2024-10-13 04:59:49,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:59:49,866 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-10-13 04:59:49,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 04:59:49,867 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-10-13 04:59:49,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 04:59:49,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:59:49,869 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:59:49,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 04:59:50,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:59:50,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:59:50,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:59:50,072 INFO L85 PathProgramCache]: Analyzing trace with hash -231364019, now seen corresponding path program 1 times [2024-10-13 04:59:50,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:59:50,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736676911] [2024-10-13 04:59:50,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:59:50,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:59:50,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:59:50,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:59:50,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 04:59:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:50,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 04:59:50,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:59:59,003 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 05:00:07,299 WARN L286 SmtUtils]: Spent 8.29s 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-13 05:00:11,397 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~var_1_1~0 ((_ extract 15 0) (bvadd ((_ sign_extend 16) c_~var_1_6~0) ((_ sign_extend 16) c_~var_1_5~0)))) (fp.gt (fp.add c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 153.0 10.0)) c_~var_1_3~0)) (fp.neg c_~var_1_4~0))) is different from false [2024-10-13 05:00:15,486 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~var_1_1~0 ((_ extract 15 0) (bvadd ((_ sign_extend 16) c_~var_1_6~0) ((_ sign_extend 16) c_~var_1_5~0)))) (fp.gt (fp.add c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 153.0 10.0)) c_~var_1_3~0)) (fp.neg c_~var_1_4~0))) is different from true [2024-10-13 05:00:28,527 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 05:00:32,610 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((~var_1_3~0 (_ FloatingPoint 11 53)) (~var_1_2~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (fp.gt (fp.add currentRoundingMode ~var_1_2~0 (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 153.0 10.0)) ~var_1_3~0)) (fp.neg ~var_1_4~0))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2024-10-13 05:00:32,623 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 05:00:32,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:00:32,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:00:32,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736676911] [2024-10-13 05:00:32,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736676911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:00:32,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:00:32,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:00:32,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858021327] [2024-10-13 05:00:32,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:00:32,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:00:32,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:00:32,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:00:32,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=2, Unknown=3, NotChecked=2, Total=12 [2024-10-13 05:00:32,628 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:00:36,962 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-13 05:00:36,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:00:36,963 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2024-10-13 05:00:37,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:00:37,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 62 [2024-10-13 05:00:37,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:00:37,051 INFO L225 Difference]: With dead ends: 32 [2024-10-13 05:00:37,051 INFO L226 Difference]: Without dead ends: 30 [2024-10-13 05:00:37,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=5, Invalid=2, Unknown=3, NotChecked=2, Total=12 [2024-10-13 05:00:37,052 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:00:37,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 48 Unchecked, 4.3s Time] [2024-10-13 05:00:37,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-13 05:00:37,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-13 05:00:37,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 05:00:37,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2024-10-13 05:00:37,060 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 62 [2024-10-13 05:00:37,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:00:37,061 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2024-10-13 05:00:37,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:00:37,062 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2024-10-13 05:00:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 05:00:37,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:00:37,064 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:00:37,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 05:00:37,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:00:37,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:00:37,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:00:37,266 INFO L85 PathProgramCache]: Analyzing trace with hash -231304437, now seen corresponding path program 1 times [2024-10-13 05:00:37,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:00:37,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751919455] [2024-10-13 05:00:37,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:00:37,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:00:37,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:00:37,268 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:00:37,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 05:00:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:00:37,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 05:00:37,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:00:44,285 WARN L286 SmtUtils]: Spent 6.31s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 05:00:52,578 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 05:01:00,855 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 05:01:09,178 WARN L286 SmtUtils]: Spent 8.32s 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)