./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_floatingpointinfluence_no-floats_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9892fa4411afdcbbbffaaa3a5f66b66df3561d966071f6e07747bea9e43a53de --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:01:41,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:01:41,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:01:41,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:01:41,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:01:41,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:01:41,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:01:41,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:01:41,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:01:41,899 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:01:41,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:01:41,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:01:41,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:01:41,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:01:41,903 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:01:41,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:01:41,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:01:41,909 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:01:41,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:01:41,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:01:41,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:01:41,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:01:41,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:01:41,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:01:41,911 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:01:41,911 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:01:41,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:01:41,912 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:01:41,912 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:01:41,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:01:41,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:01:41,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:01:41,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:01:41,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:01:41,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:01:41,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:01:41,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:01:41,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:01:41,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:01:41,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:01:41,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:01:41,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:01:41,918 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9892fa4411afdcbbbffaaa3a5f66b66df3561d966071f6e07747bea9e43a53de [2024-10-11 11:01:42,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:01:42,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:01:42,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:01:42,226 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:01:42,227 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:01:42,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i [2024-10-11 11:01:43,678 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:01:43,891 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:01:43,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i [2024-10-11 11:01:43,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/be62a406d/ebcb1feb334640239bf65ff571640658/FLAGa406ad605 [2024-10-11 11:01:44,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/be62a406d/ebcb1feb334640239bf65ff571640658 [2024-10-11 11:01:44,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:01:44,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:01:44,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:01:44,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:01:44,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:01:44,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:01:44" (1/1) ... [2024-10-11 11:01:44,270 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 11.10 11:01:44, skipping insertion in model container [2024-10-11 11:01:44,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:01:44" (1/1) ... [2024-10-11 11:01:44,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:01:44,487 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_floatingpointinfluence_no-floats_file-98.i[916,929] [2024-10-11 11:01:44,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:01:44,554 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:01:44,566 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_floatingpointinfluence_no-floats_file-98.i[916,929] [2024-10-11 11:01:44,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:01:44,597 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:01:44,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:44 WrapperNode [2024-10-11 11:01:44,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:01:44,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:01:44,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:01:44,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:01:44,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:44" (1/1) ... [2024-10-11 11:01:44,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:44" (1/1) ... [2024-10-11 11:01:44,633 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-10-11 11:01:44,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:01:44,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:01:44,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:01:44,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:01:44,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:44" (1/1) ... [2024-10-11 11:01:44,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:44" (1/1) ... [2024-10-11 11:01:44,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:44" (1/1) ... [2024-10-11 11:01:44,671 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:01:44,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:44" (1/1) ... [2024-10-11 11:01:44,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:44" (1/1) ... [2024-10-11 11:01:44,681 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:44" (1/1) ... [2024-10-11 11:01:44,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:44" (1/1) ... [2024-10-11 11:01:44,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:44" (1/1) ... [2024-10-11 11:01:44,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:44" (1/1) ... [2024-10-11 11:01:44,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:01:44,693 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:01:44,693 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:01:44,693 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:01:44,694 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:44" (1/1) ... [2024-10-11 11:01:44,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:01:44,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:01:44,725 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:01:44,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:01:44,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:01:44,772 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:01:44,772 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:01:44,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:01:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:01:44,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:01:44,841 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:01:44,842 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:01:45,148 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 11:01:45,149 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:01:45,189 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:01:45,189 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:01:45,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:01:45 BoogieIcfgContainer [2024-10-11 11:01:45,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:01:45,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:01:45,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:01:45,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:01:45,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:01:44" (1/3) ... [2024-10-11 11:01:45,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401f6bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:01:45, skipping insertion in model container [2024-10-11 11:01:45,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:44" (2/3) ... [2024-10-11 11:01:45,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401f6bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:01:45, skipping insertion in model container [2024-10-11 11:01:45,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:01:45" (3/3) ... [2024-10-11 11:01:45,199 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-98.i [2024-10-11 11:01:45,213 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:01:45,213 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:01:45,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:01:45,277 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;@71fe9d0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:01:45,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:01:45,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 11:01:45,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 11:01:45,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:01:45,293 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:01:45,293 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:01:45,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:01:45,298 INFO L85 PathProgramCache]: Analyzing trace with hash -812829571, now seen corresponding path program 1 times [2024-10-11 11:01:45,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:01:45,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175448689] [2024-10-11 11:01:45,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:01:45,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:01:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:01:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:01:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:01:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:01:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:01:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:01:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:01:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:01:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:01:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:01:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:01:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:01:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:01:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:01:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:01:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:01:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:01:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:01:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:01:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:01:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 11:01:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 11:01:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 11:01:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 11:01:45,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:01:45,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175448689] [2024-10-11 11:01:45,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175448689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:01:45,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:01:45,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:01:45,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847006371] [2024-10-11 11:01:45,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:01:45,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:01:45,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:01:45,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:01:45,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:01:45,779 INFO L87 Difference]: Start difference. First operand has 60 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 11:01:45,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:01:45,819 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2024-10-11 11:01:45,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:01:45,823 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 138 [2024-10-11 11:01:45,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:01:45,832 INFO L225 Difference]: With dead ends: 117 [2024-10-11 11:01:45,832 INFO L226 Difference]: Without dead ends: 58 [2024-10-11 11:01:45,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:01:45,842 INFO L432 NwaCegarLoop]: 85 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, 85 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:01:45,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:01:45,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-11 11:01:45,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-11 11:01:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 11:01:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 88 transitions. [2024-10-11 11:01:45,896 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 88 transitions. Word has length 138 [2024-10-11 11:01:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:01:45,897 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 88 transitions. [2024-10-11 11:01:45,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 11:01:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 88 transitions. [2024-10-11 11:01:45,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 11:01:45,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:01:45,903 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:01:45,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:01:45,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:01:45,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:01:45,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1921428289, now seen corresponding path program 1 times [2024-10-11 11:01:45,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:01:45,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227129474] [2024-10-11 11:01:45,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:01:45,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:01:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:01:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:01:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:01:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:01:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:01:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:01:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:01:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:01:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:01:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:01:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:01:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:01:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:01:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:01:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:01:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:01:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:01:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:01:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:01:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:01:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 11:01:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 11:01:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 11:01:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 11:01:46,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:01:46,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227129474] [2024-10-11 11:01:46,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227129474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:01:46,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:01:46,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:01:46,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923122840] [2024-10-11 11:01:46,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:01:46,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:01:46,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:01:46,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:01:46,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:01:46,403 INFO L87 Difference]: Start difference. First operand 58 states and 88 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 11:01:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:01:46,480 INFO L93 Difference]: Finished difference Result 116 states and 176 transitions. [2024-10-11 11:01:46,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:01:46,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 138 [2024-10-11 11:01:46,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:01:46,484 INFO L225 Difference]: With dead ends: 116 [2024-10-11 11:01:46,486 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 11:01:46,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:01:46,489 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 20 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:01:46,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 213 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:01:46,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 11:01:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2024-10-11 11:01:46,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 11:01:46,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2024-10-11 11:01:46,508 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 138 [2024-10-11 11:01:46,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:01:46,510 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2024-10-11 11:01:46,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 11:01:46,510 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2024-10-11 11:01:46,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 11:01:46,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:01:46,514 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:01:46,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:01:46,515 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:01:46,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:01:46,515 INFO L85 PathProgramCache]: Analyzing trace with hash -24405244, now seen corresponding path program 1 times [2024-10-11 11:01:46,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:01:46,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512804429] [2024-10-11 11:01:46,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:01:46,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:01:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:01:46,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [565252081] [2024-10-11 11:01:46,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:01:46,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:01:46,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:01:46,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:01:46,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:01:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:01:46,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:01:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:01:47,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:01:47,192 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:01:47,193 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:01:47,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:01:47,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:01:47,399 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 11:01:47,500 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:01:47,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:01:47 BoogieIcfgContainer [2024-10-11 11:01:47,505 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:01:47,506 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:01:47,506 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:01:47,506 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:01:47,507 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:01:45" (3/4) ... [2024-10-11 11:01:47,509 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:01:47,510 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:01:47,511 INFO L158 Benchmark]: Toolchain (without parser) took 3250.19ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 79.0MB in the end (delta: 21.0MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-10-11 11:01:47,511 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory was 73.4MB in the beginning and 73.3MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:01:47,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.50ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 85.6MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 11:01:47,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.55ms. Allocated memory is still 167.8MB. Free memory was 85.6MB in the beginning and 83.5MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:01:47,512 INFO L158 Benchmark]: Boogie Preprocessor took 57.14ms. Allocated memory is still 167.8MB. Free memory was 83.5MB in the beginning and 81.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:01:47,513 INFO L158 Benchmark]: RCFGBuilder took 497.59ms. Allocated memory is still 167.8MB. Free memory was 81.1MB in the beginning and 132.2MB in the end (delta: -51.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 11:01:47,513 INFO L158 Benchmark]: TraceAbstraction took 2312.35ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 79.0MB in the end (delta: 53.3MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2024-10-11 11:01:47,513 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 167.8MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:01:47,519 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.18ms. Allocated memory is still 113.2MB. Free memory was 73.4MB in the beginning and 73.3MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.50ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 85.6MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.55ms. Allocated memory is still 167.8MB. Free memory was 85.6MB in the beginning and 83.5MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.14ms. Allocated memory is still 167.8MB. Free memory was 83.5MB in the beginning and 81.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 497.59ms. Allocated memory is still 167.8MB. Free memory was 81.1MB in the beginning and 132.2MB in the end (delta: -51.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2312.35ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 79.0MB in the end (delta: 53.3MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 167.8MB. Free memory is still 79.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 to_int at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 4; [L23] signed long int var_1_2 = 63; [L24] signed long int var_1_3 = 9999999; [L25] signed long int var_1_4 = 0; [L26] signed short int var_1_6 = 10; [L27] signed long int var_1_7 = -1; [L28] signed long int var_1_8 = 4; [L29] signed long int var_1_9 = 7; [L30] signed long int var_1_10 = 7; [L31] signed long int var_1_11 = 2; [L32] unsigned long int var_1_12 = 128; [L33] unsigned long int var_1_13 = 0; [L34] unsigned long int var_1_14 = 4078799264; [L35] unsigned long int var_1_15 = 500; [L36] unsigned long int var_1_16 = 25; [L37] unsigned long int last_1_var_1_15 = 500; [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] last_1_var_1_15 = var_1_15 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_long() [L65] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=9999999, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=9999999, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L65] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=9999999, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L66] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=9999999, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=9999999, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L66] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=9999999, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L67] var_1_3 = __VERIFIER_nondet_long() [L68] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L68] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L69] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L69] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L70] var_1_6 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=-1, var_1_8=4, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=-1, var_1_8=4, var_1_9=7] [L71] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=-1, var_1_8=4, var_1_9=7] [L72] CALL assume_abort_if_not(var_1_6 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=-1, var_1_8=4, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=-1, var_1_8=4, var_1_9=7] [L72] RET assume_abort_if_not(var_1_6 <= 32) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=-1, var_1_8=4, var_1_9=7] [L73] var_1_7 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=4, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=4, var_1_9=7] [L74] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=4, var_1_9=7] [L75] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=4, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=4, var_1_9=7] [L75] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=4, var_1_9=7] [L76] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=4, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=4, var_1_9=7] [L76] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=4, var_1_9=7] [L77] var_1_8 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=7] [L78] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=7] [L79] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=7] [L79] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=7] [L80] var_1_9 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L81] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L82] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L82] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L83] var_1_10 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L84] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L85] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L85] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L86] var_1_11 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L87] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L88] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L88] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L89] var_1_13 = __VERIFIER_nondet_ulong() [L90] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L90] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L91] CALL assume_abort_if_not(var_1_13 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L91] RET assume_abort_if_not(var_1_13 <= 4294967294) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L92] var_1_14 = __VERIFIER_nondet_ulong() [L93] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L93] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L94] CALL assume_abort_if_not(var_1_14 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L94] RET assume_abort_if_not(var_1_14 <= 4294967294) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L95] var_1_16 = __VERIFIER_nondet_ulong() [L96] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=500, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=500, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L96] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=500, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L97] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=4294967305, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=4294967305, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L97] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=4294967305, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L111] RET updateVariables() [L112] CALL step() [L41] var_1_1 = (var_1_2 - var_1_3) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=4294967305, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L42] COND FALSE !(((((-128) < (last_1_var_1_15)) ? (-128) : (last_1_var_1_15))) < var_1_13) [L49] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=4294967305, var_1_16=4294967305, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L51] EXPR var_1_15 >> var_1_6 VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=4294967305, var_1_16=4294967305, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L51] unsigned long int stepLocal_0 = (var_1_15 >> var_1_6) / var_1_7; [L52] COND TRUE 8 < stepLocal_0 [L53] var_1_4 = (((var_1_8 + var_1_9) + ((((var_1_10) < (1.9)) ? (var_1_10) : (1.9)))) + (99.125 + var_1_11)) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=4294967305, var_1_16=4294967305, var_1_1=0, var_1_2=0, var_1_3=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L55] COND FALSE !(var_1_2 < var_1_8) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=4294967305, var_1_16=4294967305, var_1_1=0, var_1_2=0, var_1_3=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR (var_1_1 == ((signed long int) (var_1_2 - var_1_3))) && ((8 < ((var_1_15 >> var_1_6) / var_1_7)) ? (var_1_4 == ((signed long int) (((var_1_8 + var_1_9) + ((((var_1_10) < (1.9)) ? (var_1_10) : (1.9)))) + (99.125 + var_1_11)))) : 1) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=4294967305, var_1_16=4294967305, var_1_1=0, var_1_2=0, var_1_3=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L103] EXPR var_1_15 >> var_1_6 VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=4294967305, var_1_16=4294967305, var_1_1=0, var_1_2=0, var_1_3=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L103] EXPR (var_1_1 == ((signed long int) (var_1_2 - var_1_3))) && ((8 < ((var_1_15 >> var_1_6) / var_1_7)) ? (var_1_4 == ((signed long int) (((var_1_8 + var_1_9) + ((((var_1_10) < (1.9)) ? (var_1_10) : (1.9)))) + (99.125 + var_1_11)))) : 1) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=4294967305, var_1_16=4294967305, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L103-L104] return (((var_1_1 == ((signed long int) (var_1_2 - var_1_3))) && ((8 < ((var_1_15 >> var_1_6) / var_1_7)) ? (var_1_4 == ((signed long int) (((var_1_8 + var_1_9) + ((((var_1_10) < (1.9)) ? (var_1_10) : (1.9)))) + (99.125 + var_1_11)))) : 1)) && ((var_1_2 < var_1_8) ? ((((- var_1_15) <= var_1_6) || (var_1_4 < var_1_10)) ? (var_1_12 == ((unsigned long int) ((((var_1_6) < (var_1_13)) ? (var_1_6) : (var_1_13))))) : (var_1_12 == ((unsigned long int) (var_1_14 - var_1_6)))) : 1)) && ((((((-128) < (last_1_var_1_15)) ? (-128) : (last_1_var_1_15))) < var_1_13) ? ((last_1_var_1_15 > var_1_7) ? (var_1_15 == ((unsigned long int) (var_1_6 + var_1_16))) : (var_1_15 == ((unsigned long int) var_1_14))) : (var_1_15 == ((unsigned long int) var_1_16))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=4294967305, var_1_16=4294967305, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=4294967296, var_1_14=2147483647, var_1_15=4294967305, var_1_16=4294967305, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 298 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 165 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2024/2024 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:01:47,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9892fa4411afdcbbbffaaa3a5f66b66df3561d966071f6e07747bea9e43a53de --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:01:49,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:01:49,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:01:49,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:01:49,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:01:49,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:01:49,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:01:49,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:01:49,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:01:49,990 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:01:49,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:01:49,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:01:49,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:01:49,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:01:49,993 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:01:49,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:01:49,995 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:01:49,995 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:01:49,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:01:49,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:01:49,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:01:50,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:01:50,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:01:50,000 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:01:50,000 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:01:50,000 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:01:50,001 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:01:50,001 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:01:50,001 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:01:50,001 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:01:50,002 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:01:50,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:01:50,002 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:01:50,002 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:01:50,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:01:50,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:01:50,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:01:50,003 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:01:50,005 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:01:50,005 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:01:50,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:01:50,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:01:50,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:01:50,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:01:50,006 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:01:50,007 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9892fa4411afdcbbbffaaa3a5f66b66df3561d966071f6e07747bea9e43a53de [2024-10-11 11:01:50,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:01:50,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:01:50,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:01:50,400 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:01:50,401 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:01:50,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i [2024-10-11 11:01:52,124 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:01:52,368 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:01:52,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i [2024-10-11 11:01:52,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6cdff64be/a7dd07f3864540d6aa087f3bd8e405c4/FLAGec73086f9 [2024-10-11 11:01:52,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6cdff64be/a7dd07f3864540d6aa087f3bd8e405c4 [2024-10-11 11:01:52,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:01:52,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:01:52,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:01:52,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:01:52,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:01:52,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:01:52" (1/1) ... [2024-10-11 11:01:52,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79a2a464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:52, skipping insertion in model container [2024-10-11 11:01:52,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:01:52" (1/1) ... [2024-10-11 11:01:52,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:01:52,630 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_floatingpointinfluence_no-floats_file-98.i[916,929] [2024-10-11 11:01:52,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:01:52,714 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:01:52,730 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_floatingpointinfluence_no-floats_file-98.i[916,929] [2024-10-11 11:01:52,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:01:52,777 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:01:52,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:52 WrapperNode [2024-10-11 11:01:52,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:01:52,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:01:52,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:01:52,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:01:52,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:52" (1/1) ... [2024-10-11 11:01:52,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:52" (1/1) ... [2024-10-11 11:01:52,829 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-10-11 11:01:52,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:01:52,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:01:52,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:01:52,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:01:52,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:52" (1/1) ... [2024-10-11 11:01:52,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:52" (1/1) ... [2024-10-11 11:01:52,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:52" (1/1) ... [2024-10-11 11:01:52,878 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:01:52,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:52" (1/1) ... [2024-10-11 11:01:52,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:52" (1/1) ... [2024-10-11 11:01:52,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:52" (1/1) ... [2024-10-11 11:01:52,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:52" (1/1) ... [2024-10-11 11:01:52,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:52" (1/1) ... [2024-10-11 11:01:52,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:52" (1/1) ... [2024-10-11 11:01:52,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:01:52,913 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:01:52,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:01:52,914 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:01:52,915 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:52" (1/1) ... [2024-10-11 11:01:52,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:01:52,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:01:52,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:01:52,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:01:53,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:01:53,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:01:53,001 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:01:53,001 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:01:53,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:01:53,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:01:53,091 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:01:53,093 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:02:01,624 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 11:02:01,624 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:02:01,696 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:02:01,696 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:02:01,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:02:01 BoogieIcfgContainer [2024-10-11 11:02:01,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:02:01,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:02:01,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:02:01,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:02:01,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:01:52" (1/3) ... [2024-10-11 11:02:01,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d5379c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:02:01, skipping insertion in model container [2024-10-11 11:02:01,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:52" (2/3) ... [2024-10-11 11:02:01,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d5379c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:02:01, skipping insertion in model container [2024-10-11 11:02:01,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:02:01" (3/3) ... [2024-10-11 11:02:01,711 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-98.i [2024-10-11 11:02:01,727 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:02:01,727 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:02:01,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:02:01,797 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;@16abf594, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:02:01,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:02:01,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 11:02:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 11:02:01,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:02:01,816 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:02:01,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:02:01,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:02:01,822 INFO L85 PathProgramCache]: Analyzing trace with hash -757946518, now seen corresponding path program 1 times [2024-10-11 11:02:01,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:02:01,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330336434] [2024-10-11 11:02:01,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:02:01,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:02:01,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:02:01,839 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:02:01,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:02:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:02,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:02:02,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:02:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2024-10-11 11:02:02,322 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:02:02,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:02:02,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330336434] [2024-10-11 11:02:02,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330336434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:02:02,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:02:02,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:02:02,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828421470] [2024-10-11 11:02:02,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:02:02,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:02:02,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:02:02,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:02:02,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:02:02,371 INFO L87 Difference]: Start difference. First operand has 53 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 11:02:06,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:02:06,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:02:06,560 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2024-10-11 11:02:06,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:02:06,605 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 135 [2024-10-11 11:02:06,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:02:06,610 INFO L225 Difference]: With dead ends: 103 [2024-10-11 11:02:06,611 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 11:02:06,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:02:06,616 INFO L432 NwaCegarLoop]: 75 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, 75 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-11 11:02:06,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 11:02:06,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 11:02:06,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-11 11:02:06,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 11:02:06,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 78 transitions. [2024-10-11 11:02:06,654 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 78 transitions. Word has length 135 [2024-10-11 11:02:06,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:02:06,655 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 78 transitions. [2024-10-11 11:02:06,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 11:02:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 78 transitions. [2024-10-11 11:02:06,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 11:02:06,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:02:06,658 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:02:06,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 11:02:06,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:02:06,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:02:06,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:02:06,860 INFO L85 PathProgramCache]: Analyzing trace with hash 103431784, now seen corresponding path program 1 times [2024-10-11 11:02:06,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:02:06,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256436433] [2024-10-11 11:02:06,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:02:06,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:02:06,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:02:06,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:02:06,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:02:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:02:07,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:02:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:02:07,746 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-10-11 11:02:07,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [970891509] [2024-10-11 11:02:07,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:02:07,747 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 11:02:07,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 11:02:07,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 11:02:07,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-11 11:02:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:08,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 11:02:08,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:02:17,023 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 11:02:25,273 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 11:02:33,395 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 11:02:41,657 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 11:02:49,920 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 11:02:58,042 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 11:03:06,290 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 11:03:14,549 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 11:03:18,622 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_10~0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 19.0 10.0)))) (let ((.cse0 (fp.lt .cse4 .cse2)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd c_~var_1_9~0 c_~var_1_8~0))) (.cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 793.0 8.0)) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_11~0)))) (or (and (not .cse0) (= c_~var_1_4~0 ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3)))) (and .cse0 (= c_~var_1_4~0 ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse4) .cse3))))))) (= c_~var_1_15~0 c_~var_1_16~0) (= (bvadd c_~var_1_2~0 (bvneg c_~var_1_3~0)) c_~var_1_1~0) (not (bvult (_ bv4294967168 32) c_~var_1_13~0)) (not (bvult c_~last_1_var_1_15~0 c_~var_1_13~0))) is different from false [2024-10-11 11:03:22,689 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_10~0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 19.0 10.0)))) (let ((.cse0 (fp.lt .cse4 .cse2)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd c_~var_1_9~0 c_~var_1_8~0))) (.cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 793.0 8.0)) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_11~0)))) (or (and (not .cse0) (= c_~var_1_4~0 ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3)))) (and .cse0 (= c_~var_1_4~0 ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse4) .cse3))))))) (= c_~var_1_15~0 c_~var_1_16~0) (= (bvadd c_~var_1_2~0 (bvneg c_~var_1_3~0)) c_~var_1_1~0) (not (bvult (_ bv4294967168 32) c_~var_1_13~0)) (not (bvult c_~last_1_var_1_15~0 c_~var_1_13~0))) is different from true