./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 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9892fa4411afdcbbbffaaa3a5f66b66df3561d966071f6e07747bea9e43a53de --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:01:03,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:01:03,240 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:01:03,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:01:03,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:01:03,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:01:03,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:01:03,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:01:03,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:01:03,267 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:01:03,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:01:03,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:01:03,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:01:03,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:01:03,269 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:01:03,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:01:03,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:01:03,270 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:01:03,271 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:01:03,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:01:03,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:01:03,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:01:03,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:01:03,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:01:03,273 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:01:03,273 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:01:03,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:01:03,274 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:01:03,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:01:03,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:01:03,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:01:03,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:01:03,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:01:03,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:01:03,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:01:03,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:01:03,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:01:03,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:01:03,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:01:03,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:01:03,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:01:03,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:01:03,281 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9892fa4411afdcbbbffaaa3a5f66b66df3561d966071f6e07747bea9e43a53de [2024-10-24 09:01:03,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:01:03,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:01:03,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:01:03,541 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:01:03,541 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:01:03,542 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-24 09:01:05,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:01:05,185 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:01:05,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i [2024-10-24 09:01:05,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d153ee88/36cc76e08c554e18b87b039cec30f32f/FLAG609b3641f [2024-10-24 09:01:05,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d153ee88/36cc76e08c554e18b87b039cec30f32f [2024-10-24 09:01:05,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:01:05,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:01:05,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:01:05,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:01:05,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:01:05,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:01:05" (1/1) ... [2024-10-24 09:01:05,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61c10c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:05, skipping insertion in model container [2024-10-24 09:01:05,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:01:05" (1/1) ... [2024-10-24 09:01:05,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:01:05,426 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-24 09:01:05,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:01:05,494 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:01:05,506 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-24 09:01:05,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:01:05,563 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:01:05,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:05 WrapperNode [2024-10-24 09:01:05,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:01:05,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:01:05,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:01:05,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:01:05,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:05" (1/1) ... [2024-10-24 09:01:05,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:05" (1/1) ... [2024-10-24 09:01:05,624 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-10-24 09:01:05,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:01:05,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:01:05,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:01:05,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:01:05,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:05" (1/1) ... [2024-10-24 09:01:05,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:05" (1/1) ... [2024-10-24 09:01:05,653 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:05" (1/1) ... [2024-10-24 09:01:05,683 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-24 09:01:05,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:05" (1/1) ... [2024-10-24 09:01:05,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:05" (1/1) ... [2024-10-24 09:01:05,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:05" (1/1) ... [2024-10-24 09:01:05,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:05" (1/1) ... [2024-10-24 09:01:05,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:05" (1/1) ... [2024-10-24 09:01:05,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:05" (1/1) ... [2024-10-24 09:01:05,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:01:05,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:01:05,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:01:05,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:01:05,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:05" (1/1) ... [2024-10-24 09:01:05,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:01:05,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:01:05,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:01:05,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:01:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:01:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:01:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:01:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:01:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:01:05,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:01:05,861 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:01:05,863 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:01:06,140 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 09:01:06,140 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:01:06,189 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:01:06,193 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:01:06,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:01:06 BoogieIcfgContainer [2024-10-24 09:01:06,194 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:01:06,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:01:06,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:01:06,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:01:06,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:01:05" (1/3) ... [2024-10-24 09:01:06,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dff58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:01:06, skipping insertion in model container [2024-10-24 09:01:06,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:05" (2/3) ... [2024-10-24 09:01:06,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dff58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:01:06, skipping insertion in model container [2024-10-24 09:01:06,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:01:06" (3/3) ... [2024-10-24 09:01:06,205 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-98.i [2024-10-24 09:01:06,222 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:01:06,223 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:01:06,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:01:06,337 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;@4b34c4d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:01:06,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:01:06,346 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-24 09:01:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 09:01:06,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:01:06,362 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-24 09:01:06,364 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:01:06,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:01:06,371 INFO L85 PathProgramCache]: Analyzing trace with hash -812829571, now seen corresponding path program 1 times [2024-10-24 09:01:06,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:01:06,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810954414] [2024-10-24 09:01:06,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:01:06,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:01:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:01:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:01:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:01:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:01:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:01:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:01:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:01:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:01:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:01:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:01:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 09:01:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:01:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:01:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:01:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:01:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:01:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 09:01:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 09:01:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 09:01:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 09:01:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 09:01:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 09:01:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 09:01:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:06,895 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-24 09:01:06,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:01:06,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810954414] [2024-10-24 09:01:06,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810954414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:01:06,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:01:06,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:01:06,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931616323] [2024-10-24 09:01:06,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:01:06,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:01:06,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:01:06,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:01:06,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:01:06,938 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-24 09:01:06,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:01:06,986 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2024-10-24 09:01:06,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:01:06,989 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-24 09:01:06,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:01:06,995 INFO L225 Difference]: With dead ends: 117 [2024-10-24 09:01:06,995 INFO L226 Difference]: Without dead ends: 58 [2024-10-24 09:01:06,998 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-24 09:01:07,001 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-24 09:01:07,005 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-24 09:01:07,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-24 09:01:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-24 09:01:07,044 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-24 09:01:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 88 transitions. [2024-10-24 09:01:07,050 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 88 transitions. Word has length 138 [2024-10-24 09:01:07,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:01:07,051 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 88 transitions. [2024-10-24 09:01:07,051 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-24 09:01:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 88 transitions. [2024-10-24 09:01:07,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 09:01:07,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:01:07,056 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-24 09:01:07,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:01:07,057 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:01:07,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:01:07,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1921428289, now seen corresponding path program 1 times [2024-10-24 09:01:07,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:01:07,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522998127] [2024-10-24 09:01:07,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:01:07,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:01:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:01:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:01:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:01:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:01:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:01:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:01:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:01:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:01:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:01:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:01:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 09:01:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:01:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:01:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:01:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:01:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:01:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 09:01:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 09:01:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 09:01:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 09:01:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 09:01:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 09:01:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 09:01:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:07,477 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-24 09:01:07,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:01:07,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522998127] [2024-10-24 09:01:07,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522998127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:01:07,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:01:07,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:01:07,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974141272] [2024-10-24 09:01:07,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:01:07,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:01:07,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:01:07,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:01:07,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:01:07,484 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-24 09:01:07,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:01:07,560 INFO L93 Difference]: Finished difference Result 116 states and 176 transitions. [2024-10-24 09:01:07,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:01:07,561 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-24 09:01:07,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:01:07,563 INFO L225 Difference]: With dead ends: 116 [2024-10-24 09:01:07,563 INFO L226 Difference]: Without dead ends: 59 [2024-10-24 09:01:07,564 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-24 09:01:07,567 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-24 09:01:07,568 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-24 09:01:07,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-24 09:01:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2024-10-24 09:01:07,582 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-24 09:01:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2024-10-24 09:01:07,585 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 138 [2024-10-24 09:01:07,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:01:07,587 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2024-10-24 09:01:07,587 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-24 09:01:07,587 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2024-10-24 09:01:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 09:01:07,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:01:07,592 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-24 09:01:07,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:01:07,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:01:07,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:01:07,593 INFO L85 PathProgramCache]: Analyzing trace with hash -24405244, now seen corresponding path program 1 times [2024-10-24 09:01:07,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:01:07,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846982807] [2024-10-24 09:01:07,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:01:07,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:01:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:01:07,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [7261341] [2024-10-24 09:01:07,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:01:07,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:01:07,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:01:07,839 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:01:07,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 09:01:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:01:08,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:01:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:01:08,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:01:08,270 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:01:08,271 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:01:08,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 09:01:08,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:01:08,480 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 09:01:08,582 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:01:08,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:01:08 BoogieIcfgContainer [2024-10-24 09:01:08,589 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:01:08,589 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:01:08,590 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:01:08,590 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:01:08,591 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:01:06" (3/4) ... [2024-10-24 09:01:08,593 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:01:08,594 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:01:08,595 INFO L158 Benchmark]: Toolchain (without parser) took 3381.76ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 102.7MB in the beginning and 149.6MB in the end (delta: -46.9MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-10-24 09:01:08,596 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory was 119.3MB in the beginning and 119.1MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:01:08,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.49ms. Allocated memory is still 159.4MB. Free memory was 102.7MB in the beginning and 88.4MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 09:01:08,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.37ms. Allocated memory is still 159.4MB. Free memory was 88.4MB in the beginning and 86.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:01:08,597 INFO L158 Benchmark]: Boogie Preprocessor took 67.94ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:01:08,597 INFO L158 Benchmark]: RCFGBuilder took 498.00ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 64.6MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 09:01:08,598 INFO L158 Benchmark]: TraceAbstraction took 2392.34ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 64.2MB in the beginning and 150.6MB in the end (delta: -86.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:01:08,598 INFO L158 Benchmark]: Witness Printer took 5.40ms. Allocated memory is still 226.5MB. Free memory was 150.6MB in the beginning and 149.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:01:08,600 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory was 119.3MB in the beginning and 119.1MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.49ms. Allocated memory is still 159.4MB. Free memory was 102.7MB in the beginning and 88.4MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.37ms. Allocated memory is still 159.4MB. Free memory was 88.4MB in the beginning and 86.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.94ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 498.00ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 64.6MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2392.34ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 64.2MB in the beginning and 150.6MB in the end (delta: -86.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.40ms. Allocated memory is still 226.5MB. Free memory was 150.6MB in the beginning and 149.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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.2s, 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.1s 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.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s 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-24 09:01:08,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9892fa4411afdcbbbffaaa3a5f66b66df3561d966071f6e07747bea9e43a53de --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:01:10,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:01:10,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:01:10,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:01:10,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:01:10,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:01:10,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:01:10,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:01:10,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:01:10,933 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:01:10,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:01:10,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:01:10,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:01:10,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:01:10,936 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:01:10,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:01:10,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:01:10,937 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:01:10,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:01:10,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:01:10,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:01:10,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:01:10,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:01:10,942 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:01:10,942 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:01:10,943 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:01:10,943 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:01:10,943 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:01:10,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:01:10,943 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:01:10,944 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:01:10,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:01:10,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:01:10,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:01:10,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:01:10,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:01:10,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:01:10,945 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:01:10,946 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:01:10,946 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:01:10,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:01:10,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:01:10,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:01:10,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:01:10,949 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:01:10,949 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9892fa4411afdcbbbffaaa3a5f66b66df3561d966071f6e07747bea9e43a53de [2024-10-24 09:01:11,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:01:11,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:01:11,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:01:11,312 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:01:11,313 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:01:11,314 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-24 09:01:12,977 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:01:13,184 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:01:13,185 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i [2024-10-24 09:01:13,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b4adc335/3a4f8c99590b4f7fb899e49f77c3c2b0/FLAG7a114f615 [2024-10-24 09:01:13,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b4adc335/3a4f8c99590b4f7fb899e49f77c3c2b0 [2024-10-24 09:01:13,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:01:13,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:01:13,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:01:13,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:01:13,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:01:13,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:01:13" (1/1) ... [2024-10-24 09:01:13,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d928d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:13, skipping insertion in model container [2024-10-24 09:01:13,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:01:13" (1/1) ... [2024-10-24 09:01:13,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:01:13,772 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-24 09:01:13,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:01:13,824 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:01:13,837 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-24 09:01:13,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:01:13,877 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:01:13,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:13 WrapperNode [2024-10-24 09:01:13,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:01:13,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:01:13,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:01:13,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:01:13,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:13" (1/1) ... [2024-10-24 09:01:13,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:13" (1/1) ... [2024-10-24 09:01:13,923 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-10-24 09:01:13,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:01:13,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:01:13,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:01:13,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:01:13,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:13" (1/1) ... [2024-10-24 09:01:13,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:13" (1/1) ... [2024-10-24 09:01:13,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:13" (1/1) ... [2024-10-24 09:01:13,961 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-24 09:01:13,961 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:13" (1/1) ... [2024-10-24 09:01:13,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:13" (1/1) ... [2024-10-24 09:01:13,971 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:13" (1/1) ... [2024-10-24 09:01:13,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:13" (1/1) ... [2024-10-24 09:01:13,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:13" (1/1) ... [2024-10-24 09:01:13,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:13" (1/1) ... [2024-10-24 09:01:13,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:01:13,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:01:13,987 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:01:13,987 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:01:13,988 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:13" (1/1) ... [2024-10-24 09:01:13,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:01:14,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:01:14,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:01:14,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:01:14,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:01:14,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:01:14,066 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:01:14,066 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:01:14,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:01:14,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:01:14,147 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:01:14,149 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:01:22,586 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 09:01:22,587 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:01:22,643 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:01:22,643 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:01:22,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:01:22 BoogieIcfgContainer [2024-10-24 09:01:22,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:01:22,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:01:22,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:01:22,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:01:22,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:01:13" (1/3) ... [2024-10-24 09:01:22,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a70d0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:01:22, skipping insertion in model container [2024-10-24 09:01:22,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:13" (2/3) ... [2024-10-24 09:01:22,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a70d0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:01:22, skipping insertion in model container [2024-10-24 09:01:22,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:01:22" (3/3) ... [2024-10-24 09:01:22,653 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-98.i [2024-10-24 09:01:22,677 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:01:22,678 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:01:22,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:01:22,749 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;@718171a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:01:22,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:01:22,753 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-24 09:01:22,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 09:01:22,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:01:22,765 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-24 09:01:22,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:01:22,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:01:22,771 INFO L85 PathProgramCache]: Analyzing trace with hash -757946518, now seen corresponding path program 1 times [2024-10-24 09:01:22,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:01:22,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439949512] [2024-10-24 09:01:22,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:01:22,784 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-24 09:01:22,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:01:22,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:01:22,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 09:01:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:23,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:01:23,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:01:23,246 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-24 09:01:23,246 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:01:23,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:01:23,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439949512] [2024-10-24 09:01:23,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439949512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:01:23,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:01:23,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:01:23,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065502214] [2024-10-24 09:01:23,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:01:23,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:01:23,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:01:23,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:01:23,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:01:23,286 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-24 09:01:27,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:01:27,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:01:27,482 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2024-10-24 09:01:27,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:01:27,527 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-24 09:01:27,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:01:27,532 INFO L225 Difference]: With dead ends: 103 [2024-10-24 09:01:27,533 INFO L226 Difference]: Without dead ends: 51 [2024-10-24 09:01:27,535 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-24 09:01:27,539 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-24 09:01:27,540 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-24 09:01:27,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-24 09:01:27,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-24 09:01:27,572 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-24 09:01:27,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 78 transitions. [2024-10-24 09:01:27,575 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 78 transitions. Word has length 135 [2024-10-24 09:01:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:01:27,575 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 78 transitions. [2024-10-24 09:01:27,576 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-24 09:01:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 78 transitions. [2024-10-24 09:01:27,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 09:01:27,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:01:27,579 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-24 09:01:27,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 09:01:27,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:01:27,780 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:01:27,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:01:27,781 INFO L85 PathProgramCache]: Analyzing trace with hash 103431784, now seen corresponding path program 1 times [2024-10-24 09:01:27,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:01:27,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063006632] [2024-10-24 09:01:27,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:01:27,782 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-24 09:01:27,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:01:27,785 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:01:27,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 09:01:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:01:28,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:01:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:01:28,594 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-10-24 09:01:28,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [215313144] [2024-10-24 09:01:28,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:01:28,595 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 09:01:28,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 09:01:28,597 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 09:01:28,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-24 09:01:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:29,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 09:01:29,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:01:37,734 WARN L286 SmtUtils]: Spent 8.28s 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-24 09:01:45,987 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-24 09:01:54,107 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-24 09:02:02,339 WARN L286 SmtUtils]: Spent 8.23s 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-24 09:02:10,602 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-24 09:02:18,721 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-24 09:02:26,984 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-24 09:02:35,253 WARN L286 SmtUtils]: Spent 8.27s 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-24 09:02:39,324 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-24 09:02:43,385 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