./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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-?-c7c6ca5-m [2024-11-08 23:15:35,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:15:35,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:15:35,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:15:35,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:15:35,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:15:35,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:15:35,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:15:35,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:15:35,206 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:15:35,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:15:35,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:15:35,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:15:35,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:15:35,210 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:15:35,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:15:35,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:15:35,211 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:15:35,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:15:35,214 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:15:35,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:15:35,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:15:35,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:15:35,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:15:35,215 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:15:35,216 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:15:35,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:15:35,216 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:15:35,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:15:35,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:15:35,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:15:35,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:15:35,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:15:35,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:15:35,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:15:35,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:15:35,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:15:35,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:15:35,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:15:35,220 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:15:35,220 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:15:35,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:15:35,221 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-11-08 23:15:35,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:15:35,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:15:35,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:15:35,486 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:15:35,486 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:15:35,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i [2024-11-08 23:15:36,929 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:15:37,159 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:15:37,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i [2024-11-08 23:15:37,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/206389152/f3bd123237a541dfbd9ab00d0c71d5c0/FLAG21b166af2 [2024-11-08 23:15:37,500 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/206389152/f3bd123237a541dfbd9ab00d0c71d5c0 [2024-11-08 23:15:37,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:15:37,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:15:37,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:15:37,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:15:37,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:15:37,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:15:37" (1/1) ... [2024-11-08 23:15:37,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f86636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:37, skipping insertion in model container [2024-11-08 23:15:37,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:15:37" (1/1) ... [2024-11-08 23:15:37,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:15:37,710 WARN L250 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-11-08 23:15:37,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:15:37,761 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:15:37,773 WARN L250 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-11-08 23:15:37,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:15:37,808 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:15:37,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:37 WrapperNode [2024-11-08 23:15:37,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:15:37,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:15:37,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:15:37,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:15:37,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:37" (1/1) ... [2024-11-08 23:15:37,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:37" (1/1) ... [2024-11-08 23:15:37,849 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-11-08 23:15:37,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:15:37,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:15:37,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:15:37,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:15:37,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:37" (1/1) ... [2024-11-08 23:15:37,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:37" (1/1) ... [2024-11-08 23:15:37,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:37" (1/1) ... [2024-11-08 23:15:37,877 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-11-08 23:15:37,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:37" (1/1) ... [2024-11-08 23:15:37,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:37" (1/1) ... [2024-11-08 23:15:37,884 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:37" (1/1) ... [2024-11-08 23:15:37,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:37" (1/1) ... [2024-11-08 23:15:37,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:37" (1/1) ... [2024-11-08 23:15:37,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:37" (1/1) ... [2024-11-08 23:15:37,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:15:37,894 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:15:37,894 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:15:37,894 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:15:37,895 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:37" (1/1) ... [2024-11-08 23:15:37,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:15:37,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:15:37,928 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-11-08 23:15:37,933 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-11-08 23:15:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:15:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:15:37,983 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:15:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:15:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:15:37,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:15:38,083 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:15:38,085 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:15:38,371 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 23:15:38,372 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:15:38,390 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:15:38,393 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:15:38,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:15:38 BoogieIcfgContainer [2024-11-08 23:15:38,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:15:38,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:15:38,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:15:38,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:15:38,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:15:37" (1/3) ... [2024-11-08 23:15:38,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5648a41d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:15:38, skipping insertion in model container [2024-11-08 23:15:38,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:37" (2/3) ... [2024-11-08 23:15:38,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5648a41d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:15:38, skipping insertion in model container [2024-11-08 23:15:38,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:15:38" (3/3) ... [2024-11-08 23:15:38,404 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-98.i [2024-11-08 23:15:38,423 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:15:38,423 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:15:38,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:15:38,508 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;@553e8351, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:15:38,508 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:15:38,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 40 states have (on average 1.325) internal successors, (53), 41 states have internal predecessors, (53), 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-11-08 23:15:38,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 23:15:38,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:38,526 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, 1, 1] [2024-11-08 23:15:38,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:38,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:38,533 INFO L85 PathProgramCache]: Analyzing trace with hash -59891904, now seen corresponding path program 1 times [2024-11-08 23:15:38,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:15:38,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066367772] [2024-11-08 23:15:38,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:38,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:15:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:15:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:15:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:15:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:15:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:15:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:15:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:15:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:15:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:15:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:15:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:15:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:15:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:15:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:15:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:15:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:15:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:15:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:15:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:15:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:15:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:15:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:15:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:38,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:15:38,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:15:38,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066367772] [2024-11-08 23:15:38,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066367772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:15:38,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:15:38,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:15:38,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068504137] [2024-11-08 23:15:38,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:15:39,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:15:39,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:15:39,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:15:39,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:15:39,034 INFO L87 Difference]: Start difference. First operand has 66 states, 40 states have (on average 1.325) internal successors, (53), 41 states have internal predecessors, (53), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-11-08 23:15:39,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:15:39,068 INFO L93 Difference]: Finished difference Result 125 states and 215 transitions. [2024-11-08 23:15:39,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:15:39,070 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 142 [2024-11-08 23:15:39,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:15:39,077 INFO L225 Difference]: With dead ends: 125 [2024-11-08 23:15:39,078 INFO L226 Difference]: Without dead ends: 62 [2024-11-08 23:15:39,081 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-11-08 23:15:39,084 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:15:39,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:15:39,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-08 23:15:39,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-08 23:15:39,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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-11-08 23:15:39,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 92 transitions. [2024-11-08 23:15:39,131 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 92 transitions. Word has length 142 [2024-11-08 23:15:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:15:39,131 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 92 transitions. [2024-11-08 23:15:39,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-11-08 23:15:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 92 transitions. [2024-11-08 23:15:39,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 23:15:39,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:39,140 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, 1, 1] [2024-11-08 23:15:39,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:15:39,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:39,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:39,142 INFO L85 PathProgramCache]: Analyzing trace with hash -66713794, now seen corresponding path program 1 times [2024-11-08 23:15:39,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:15:39,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497959310] [2024-11-08 23:15:39,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:39,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:15:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:15:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:15:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:15:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:15:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:15:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:15:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:15:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:15:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:15:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:15:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:15:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:15:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:15:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:15:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:15:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:15:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:15:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:15:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:15:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:15:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:15:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:15:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:15:39,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:15:39,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497959310] [2024-11-08 23:15:39,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497959310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:15:39,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:15:39,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:15:39,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24342048] [2024-11-08 23:15:39,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:15:39,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:15:39,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:15:39,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:15:39,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:15:39,608 INFO L87 Difference]: Start difference. First operand 62 states and 92 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-11-08 23:15:39,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:15:39,687 INFO L93 Difference]: Finished difference Result 123 states and 183 transitions. [2024-11-08 23:15:39,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:15:39,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 142 [2024-11-08 23:15:39,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:15:39,690 INFO L225 Difference]: With dead ends: 123 [2024-11-08 23:15:39,691 INFO L226 Difference]: Without dead ends: 64 [2024-11-08 23:15:39,692 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-11-08 23:15:39,695 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 22 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:15:39,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 231 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:15:39,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-08 23:15:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-11-08 23:15:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 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-11-08 23:15:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2024-11-08 23:15:39,719 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 142 [2024-11-08 23:15:39,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:15:39,722 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2024-11-08 23:15:39,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-11-08 23:15:39,723 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2024-11-08 23:15:39,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 23:15:39,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:39,726 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, 1, 1, 1, 1] [2024-11-08 23:15:39,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:15:39,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:39,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:39,727 INFO L85 PathProgramCache]: Analyzing trace with hash -235902567, now seen corresponding path program 1 times [2024-11-08 23:15:39,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:15:39,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82975400] [2024-11-08 23:15:39,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:39,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:15:39,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2024161556] [2024-11-08 23:15:39,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:39,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:15:39,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:15:39,957 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-11-08 23:15:39,959 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-11-08 23:15:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:15:40,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:15:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:15:40,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:15:40,278 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:15:40,279 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:15:40,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:15:40,481 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-11-08 23:15:40,485 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 23:15:40,593 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:15:40,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:15:40 BoogieIcfgContainer [2024-11-08 23:15:40,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:15:40,603 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:15:40,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:15:40,603 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:15:40,604 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:15:38" (3/4) ... [2024-11-08 23:15:40,606 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:15:40,607 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:15:40,608 INFO L158 Benchmark]: Toolchain (without parser) took 3103.15ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 81.3MB in the beginning and 131.0MB in the end (delta: -49.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:15:40,608 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 134.2MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:15:40,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.93ms. Allocated memory is still 134.2MB. Free memory was 81.0MB in the beginning and 66.6MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:15:40,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.15ms. Allocated memory is still 134.2MB. Free memory was 66.6MB in the beginning and 64.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:15:40,609 INFO L158 Benchmark]: Boogie Preprocessor took 42.91ms. Allocated memory is still 134.2MB. Free memory was 64.5MB in the beginning and 62.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:15:40,609 INFO L158 Benchmark]: RCFGBuilder took 499.91ms. Allocated memory is still 134.2MB. Free memory was 62.1MB in the beginning and 92.6MB in the end (delta: -30.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 23:15:40,609 INFO L158 Benchmark]: TraceAbstraction took 2206.20ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 92.0MB in the beginning and 131.0MB in the end (delta: -38.9MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-11-08 23:15:40,610 INFO L158 Benchmark]: Witness Printer took 4.55ms. Allocated memory is still 180.4MB. Free memory is still 131.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:15:40,616 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 134.2MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.93ms. Allocated memory is still 134.2MB. Free memory was 81.0MB in the beginning and 66.6MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.15ms. Allocated memory is still 134.2MB. Free memory was 66.6MB in the beginning and 64.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.91ms. Allocated memory is still 134.2MB. Free memory was 64.5MB in the beginning and 62.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 499.91ms. Allocated memory is still 134.2MB. Free memory was 62.1MB in the beginning and 92.6MB in the end (delta: -30.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2206.20ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 92.0MB in the beginning and 131.0MB in the end (delta: -38.9MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Witness Printer took 4.55ms. Allocated memory is still 180.4MB. Free memory is still 131.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 4; [L23] signed long int var_1_2 = 63; [L24] signed long int var_1_3 = 9999999; [L25] signed long int var_1_4 = 0; [L26] signed short int var_1_6 = 10; [L27] signed long int var_1_7 = -1; [L28] signed long int var_1_8 = 4; [L29] signed long int var_1_9 = 7; [L30] signed long int var_1_10 = 7; [L31] signed long int var_1_11 = 2; [L32] unsigned long int var_1_12 = 128; [L33] unsigned long int var_1_13 = 0; [L34] unsigned long int var_1_14 = 4078799264; [L35] unsigned long int var_1_15 = 500; [L36] unsigned long int var_1_16 = 25; [L37] unsigned long int last_1_var_1_15 = 500; VAL [isInitial=0, 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=63, var_1_3=9999999, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] last_1_var_1_15 = var_1_15 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=63, var_1_3=9999999, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [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=-4294967287, 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=-4294967287, 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=-4294967287, 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=-4294967287, 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=-4294967287, var_1_16=-4294967287, 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=-4294967287, var_1_16=-4294967287, 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=-4294967287, var_1_16=-4294967287, 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=-4294967287, var_1_16=-4294967287, 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=-4294967287, var_1_16=-4294967287, 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=-4294967287, var_1_16=-4294967287, 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=-4294967287, var_1_16=-4294967287, 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=-4294967287, var_1_16=-4294967287, 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=-4294967287, var_1_16=-4294967287, 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, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 323 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 180 mSDtfsCounter, 19 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=66occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 572 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 306 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-11-08 23:15:40,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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-?-c7c6ca5-m [2024-11-08 23:15:42,890 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:15:42,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:15:42,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:15:42,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:15:43,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:15:43,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:15:43,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:15:43,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:15:43,033 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:15:43,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:15:43,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:15:43,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:15:43,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:15:43,036 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:15:43,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:15:43,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:15:43,037 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:15:43,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:15:43,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:15:43,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:15:43,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:15:43,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:15:43,039 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:15:43,040 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:15:43,040 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:15:43,041 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:15:43,041 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:15:43,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:15:43,041 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:15:43,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:15:43,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:15:43,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:15:43,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:15:43,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:15:43,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:15:43,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:15:43,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:15:43,044 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:15:43,044 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:15:43,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:15:43,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:15:43,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:15:43,046 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:15:43,046 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-11-08 23:15:43,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:15:43,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:15:43,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:15:43,430 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:15:43,431 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:15:43,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i [2024-11-08 23:15:45,067 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:15:45,305 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:15:45,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i [2024-11-08 23:15:45,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2145401/f72d70e5eac64e10885a3b8e39c833b0/FLAGbc823e7dc [2024-11-08 23:15:45,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2145401/f72d70e5eac64e10885a3b8e39c833b0 [2024-11-08 23:15:45,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:15:45,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:15:45,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:15:45,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:15:45,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:15:45,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:15:45" (1/1) ... [2024-11-08 23:15:45,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e7d04c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:45, skipping insertion in model container [2024-11-08 23:15:45,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:15:45" (1/1) ... [2024-11-08 23:15:45,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:15:45,602 WARN L250 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-11-08 23:15:45,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:15:45,686 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:15:45,698 WARN L250 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-11-08 23:15:45,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:15:45,733 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:15:45,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:45 WrapperNode [2024-11-08 23:15:45,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:15:45,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:15:45,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:15:45,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:15:45,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:45" (1/1) ... [2024-11-08 23:15:45,753 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:45" (1/1) ... [2024-11-08 23:15:45,785 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-08 23:15:45,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:15:45,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:15:45,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:15:45,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:15:45,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:45" (1/1) ... [2024-11-08 23:15:45,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:45" (1/1) ... [2024-11-08 23:15:45,804 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:45" (1/1) ... [2024-11-08 23:15:45,821 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-11-08 23:15:45,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:45" (1/1) ... [2024-11-08 23:15:45,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:45" (1/1) ... [2024-11-08 23:15:45,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:45" (1/1) ... [2024-11-08 23:15:45,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:45" (1/1) ... [2024-11-08 23:15:45,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:45" (1/1) ... [2024-11-08 23:15:45,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:45" (1/1) ... [2024-11-08 23:15:45,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:15:45,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:15:45,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:15:45,851 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:15:45,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:45" (1/1) ... [2024-11-08 23:15:45,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:15:45,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:15:45,884 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-11-08 23:15:45,890 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-11-08 23:15:45,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:15:45,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:15:45,932 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:15:45,932 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:15:45,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:15:45,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:15:46,003 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:15:46,005 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:15:54,447 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 23:15:54,448 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:15:54,464 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:15:54,464 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:15:54,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:15:54 BoogieIcfgContainer [2024-11-08 23:15:54,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:15:54,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:15:54,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:15:54,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:15:54,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:15:45" (1/3) ... [2024-11-08 23:15:54,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@701c8298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:15:54, skipping insertion in model container [2024-11-08 23:15:54,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:45" (2/3) ... [2024-11-08 23:15:54,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@701c8298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:15:54, skipping insertion in model container [2024-11-08 23:15:54,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:15:54" (3/3) ... [2024-11-08 23:15:54,475 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-98.i [2024-11-08 23:15:54,490 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:15:54,500 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:15:54,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:15:54,582 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;@1b352345, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:15:54,582 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:15:54,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 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-11-08 23:15:54,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 23:15:54,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:54,601 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] [2024-11-08 23:15:54,602 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:54,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:54,606 INFO L85 PathProgramCache]: Analyzing trace with hash 332693887, now seen corresponding path program 1 times [2024-11-08 23:15:54,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:15:54,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442562820] [2024-11-08 23:15:54,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:54,618 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-11-08 23:15:54,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:15:54,621 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-11-08 23:15:54,622 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-11-08 23:15:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:54,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:15:55,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:15:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2024-11-08 23:15:55,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:15:55,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:15:55,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442562820] [2024-11-08 23:15:55,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442562820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:15:55,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:15:55,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:15:55,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500860078] [2024-11-08 23:15:55,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:15:55,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:15:55,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:15:55,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:15:55,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:15:55,084 INFO L87 Difference]: Start difference. First operand has 59 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 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 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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-11-08 23:15:55,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:15:55,122 INFO L93 Difference]: Finished difference Result 111 states and 195 transitions. [2024-11-08 23:15:55,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:15:55,124 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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 139 [2024-11-08 23:15:55,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:15:55,132 INFO L225 Difference]: With dead ends: 111 [2024-11-08 23:15:55,133 INFO L226 Difference]: Without dead ends: 55 [2024-11-08 23:15:55,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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-11-08 23:15:55,141 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:15:55,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:15:55,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-08 23:15:55,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-08 23:15:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 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-11-08 23:15:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2024-11-08 23:15:55,192 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 139 [2024-11-08 23:15:55,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:15:55,192 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2024-11-08 23:15:55,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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-11-08 23:15:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2024-11-08 23:15:55,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 23:15:55,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:55,200 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] [2024-11-08 23:15:55,218 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-11-08 23:15:55,401 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-11-08 23:15:55,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:55,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1265617473, now seen corresponding path program 1 times [2024-11-08 23:15:55,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:15:55,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391717445] [2024-11-08 23:15:55,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:55,404 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-11-08 23:15:55,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:15:55,406 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-11-08 23:15:55,417 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-11-08 23:15:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:15:55,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:15:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:15:56,215 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-08 23:15:56,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [430542664] [2024-11-08 23:15:56,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:56,215 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 23:15:56,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 23:15:56,217 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-11-08 23:15:56,220 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-11-08 23:15:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:56,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 23:15:56,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:16:05,383 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:16:13,640 WARN L286 SmtUtils]: Spent 8.26s 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-11-08 23:16:21,760 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-11-08 23:16:30,018 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-11-08 23:16:38,283 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-11-08 23:16:46,406 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-11-08 23:16:54,641 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-11-08 23:17:02,920 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-11-08 23:17:06,983 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-11-08 23:17:11,058 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