./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-80.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c51934b75642007b7e5ba630000c4f6d9fea2369763db606575965ad8705e431 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:37:04,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:37:04,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:37:04,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:37:04,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:37:04,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:37:04,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:37:04,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:37:04,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:37:04,305 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:37:04,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:37:04,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:37:04,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:37:04,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:37:04,307 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:37:04,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:37:04,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:37:04,308 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:37:04,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:37:04,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:37:04,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:37:04,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:37:04,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:37:04,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:37:04,311 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:37:04,311 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:37:04,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:37:04,312 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:37:04,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:37:04,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:37:04,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:37:04,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:37:04,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:37:04,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:37:04,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:37:04,314 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:37:04,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:37:04,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:37:04,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:37:04,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:37:04,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:37:04,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:37:04,316 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c51934b75642007b7e5ba630000c4f6d9fea2369763db606575965ad8705e431 [2024-10-11 07:37:04,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:37:04,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:37:04,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:37:04,636 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:37:04,636 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:37:04,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-80.i [2024-10-11 07:37:06,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:37:06,332 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:37:06,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-80.i [2024-10-11 07:37:06,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/58efd1d81/42d975f084964f60b572a8dd096094a0/FLAG7652040ce [2024-10-11 07:37:06,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/58efd1d81/42d975f084964f60b572a8dd096094a0 [2024-10-11 07:37:06,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:37:06,704 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:37:06,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:37:06,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:37:06,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:37:06,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:37:06" (1/1) ... [2024-10-11 07:37:06,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18392162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:06, skipping insertion in model container [2024-10-11 07:37:06,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:37:06" (1/1) ... [2024-10-11 07:37:06,745 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:37:06,917 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-80.i[917,930] [2024-10-11 07:37:06,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:37:06,980 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:37:06,995 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-80.i[917,930] [2024-10-11 07:37:07,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:37:07,045 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:37:07,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:07 WrapperNode [2024-10-11 07:37:07,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:37:07,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:37:07,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:37:07,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:37:07,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:07" (1/1) ... [2024-10-11 07:37:07,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:07" (1/1) ... [2024-10-11 07:37:07,097 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2024-10-11 07:37:07,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:37:07,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:37:07,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:37:07,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:37:07,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:07" (1/1) ... [2024-10-11 07:37:07,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:07" (1/1) ... [2024-10-11 07:37:07,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:07" (1/1) ... [2024-10-11 07:37:07,138 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:37:07,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:07" (1/1) ... [2024-10-11 07:37:07,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:07" (1/1) ... [2024-10-11 07:37:07,150 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:07" (1/1) ... [2024-10-11 07:37:07,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:07" (1/1) ... [2024-10-11 07:37:07,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:07" (1/1) ... [2024-10-11 07:37:07,157 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:07" (1/1) ... [2024-10-11 07:37:07,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:37:07,161 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:37:07,161 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:37:07,161 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:37:07,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:07" (1/1) ... [2024-10-11 07:37:07,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:37:07,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:37:07,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:37:07,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:37:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:37:07,258 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:37:07,259 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:37:07,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:37:07,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:37:07,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:37:07,348 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:37:07,349 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:37:07,679 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 07:37:07,679 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:37:07,731 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:37:07,731 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:37:07,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:37:07 BoogieIcfgContainer [2024-10-11 07:37:07,732 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:37:07,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:37:07,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:37:07,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:37:07,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:37:06" (1/3) ... [2024-10-11 07:37:07,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29973bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:37:07, skipping insertion in model container [2024-10-11 07:37:07,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:07" (2/3) ... [2024-10-11 07:37:07,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29973bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:37:07, skipping insertion in model container [2024-10-11 07:37:07,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:37:07" (3/3) ... [2024-10-11 07:37:07,740 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-80.i [2024-10-11 07:37:07,754 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:37:07,755 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:37:07,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:37:07,818 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;@5f272fb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:37:07,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:37:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 07:37:07,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 07:37:07,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:37:07,834 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:37:07,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:37:07,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:37:07,841 INFO L85 PathProgramCache]: Analyzing trace with hash -30641210, now seen corresponding path program 1 times [2024-10-11 07:37:07,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:37:07,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969862052] [2024-10-11 07:37:07,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:37:07,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:37:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:37:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 07:37:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 07:37:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 07:37:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 07:37:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 07:37:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 07:37:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 07:37:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 07:37:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:37:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:37:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 07:37:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 07:37:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 07:37:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 07:37:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 07:37:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 07:37:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 07:37:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 07:37:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 07:37:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 07:37:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 07:37:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 07:37:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 07:37:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 07:37:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 07:37:08,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:37:08,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969862052] [2024-10-11 07:37:08,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969862052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:37:08,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:37:08,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:37:08,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101432570] [2024-10-11 07:37:08,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:37:08,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:37:08,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:37:08,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:37:08,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:37:08,392 INFO L87 Difference]: Start difference. First operand has 65 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 07:37:08,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:37:08,442 INFO L93 Difference]: Finished difference Result 127 states and 225 transitions. [2024-10-11 07:37:08,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:37:08,445 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 155 [2024-10-11 07:37:08,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:37:08,457 INFO L225 Difference]: With dead ends: 127 [2024-10-11 07:37:08,458 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 07:37:08,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:37:08,467 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:37:08,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:37:08,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 07:37:08,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-11 07:37:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 07:37:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 96 transitions. [2024-10-11 07:37:08,512 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 96 transitions. Word has length 155 [2024-10-11 07:37:08,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:37:08,513 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 96 transitions. [2024-10-11 07:37:08,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 07:37:08,513 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 96 transitions. [2024-10-11 07:37:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 07:37:08,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:37:08,520 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:37:08,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:37:08,520 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:37:08,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:37:08,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1080171796, now seen corresponding path program 1 times [2024-10-11 07:37:08,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:37:08,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844373] [2024-10-11 07:37:08,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:37:08,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:37:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:37:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 07:37:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 07:37:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 07:37:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 07:37:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 07:37:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 07:37:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 07:37:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 07:37:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:37:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:37:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 07:37:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 07:37:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 07:37:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 07:37:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 07:37:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 07:37:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 07:37:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 07:37:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 07:37:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 07:37:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 07:37:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 07:37:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 07:37:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 07:37:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 66 proven. 6 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 07:37:09,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:37:09,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844373] [2024-10-11 07:37:09,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844373] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:37:09,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671290897] [2024-10-11 07:37:09,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:37:09,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:37:09,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:37:09,576 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:37:09,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 07:37:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:09,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 07:37:09,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:37:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 244 proven. 6 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-10-11 07:37:10,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:37:10,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 66 proven. 6 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 07:37:10,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671290897] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:37:10,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 07:37:10,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-11 07:37:10,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155774181] [2024-10-11 07:37:10,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 07:37:10,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 07:37:10,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:37:10,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 07:37:10,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:37:10,404 INFO L87 Difference]: Start difference. First operand 63 states and 96 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 07:37:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:37:10,747 INFO L93 Difference]: Finished difference Result 133 states and 198 transitions. [2024-10-11 07:37:10,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 07:37:10,748 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 155 [2024-10-11 07:37:10,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:37:10,752 INFO L225 Difference]: With dead ends: 133 [2024-10-11 07:37:10,753 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 07:37:10,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 355 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2024-10-11 07:37:10,755 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 131 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:37:10,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 140 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:37:10,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 07:37:10,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2024-10-11 07:37:10,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 07:37:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2024-10-11 07:37:10,779 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 155 [2024-10-11 07:37:10,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:37:10,780 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2024-10-11 07:37:10,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 07:37:10,780 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2024-10-11 07:37:10,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 07:37:10,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:37:10,784 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:37:10,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 07:37:10,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:37:10,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:37:10,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:37:10,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1080231378, now seen corresponding path program 1 times [2024-10-11 07:37:10,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:37:10,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358760531] [2024-10-11 07:37:10,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:37:10,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:37:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:37:11,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:37:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:37:11,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:37:11,294 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:37:11,297 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:37:11,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:37:11,302 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 07:37:11,402 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:37:11,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:37:11 BoogieIcfgContainer [2024-10-11 07:37:11,410 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:37:11,411 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:37:11,411 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:37:11,411 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:37:11,411 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:37:07" (3/4) ... [2024-10-11 07:37:11,414 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:37:11,415 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:37:11,417 INFO L158 Benchmark]: Toolchain (without parser) took 4711.96ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 121.8MB in the beginning and 130.6MB in the end (delta: -8.9MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-10-11 07:37:11,417 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:37:11,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.31ms. Allocated memory is still 165.7MB. Free memory was 121.3MB in the beginning and 106.0MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 07:37:11,418 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.29ms. Allocated memory is still 165.7MB. Free memory was 106.0MB in the beginning and 102.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:37:11,418 INFO L158 Benchmark]: Boogie Preprocessor took 61.72ms. Allocated memory is still 165.7MB. Free memory was 102.9MB in the beginning and 98.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:37:11,418 INFO L158 Benchmark]: RCFGBuilder took 571.06ms. Allocated memory is still 165.7MB. Free memory was 98.7MB in the beginning and 123.9MB in the end (delta: -25.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 07:37:11,419 INFO L158 Benchmark]: TraceAbstraction took 3676.44ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 122.9MB in the beginning and 131.7MB in the end (delta: -8.8MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2024-10-11 07:37:11,419 INFO L158 Benchmark]: Witness Printer took 4.83ms. Allocated memory is still 199.2MB. Free memory was 131.7MB in the beginning and 130.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 07:37:11,420 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.15ms. Allocated memory is still 109.1MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.31ms. Allocated memory is still 165.7MB. Free memory was 121.3MB in the beginning and 106.0MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.29ms. Allocated memory is still 165.7MB. Free memory was 106.0MB in the beginning and 102.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.72ms. Allocated memory is still 165.7MB. Free memory was 102.9MB in the beginning and 98.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 571.06ms. Allocated memory is still 165.7MB. Free memory was 98.7MB in the beginning and 123.9MB in the end (delta: -25.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3676.44ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 122.9MB in the beginning and 131.7MB in the end (delta: -8.8MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * Witness Printer took 4.83ms. Allocated memory is still 199.2MB. Free memory was 131.7MB in the beginning and 130.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 132, overapproximation of someBinaryFLOATComparisonOperation at line 132. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 128; [L23] double var_1_2 = 24.25; [L24] double var_1_3 = 128.5; [L25] double var_1_4 = 4.5; [L26] double var_1_5 = 49.5; [L27] signed short int var_1_6 = -16; [L28] signed short int var_1_7 = -2; [L29] signed short int var_1_8 = 5; [L30] signed short int var_1_9 = -25; [L31] unsigned char var_1_10 = 200; [L32] unsigned char var_1_11 = 1; [L33] unsigned char var_1_12 = 1; [L34] double var_1_13 = 128.375; [L35] unsigned short int var_1_14 = 0; [L36] float var_1_15 = 0.0; [L37] float var_1_16 = 4.87; [L38] float var_1_17 = 8.875; [L39] signed short int var_1_18 = -128; [L40] unsigned char var_1_19 = 0; [L41] unsigned char var_1_20 = 1; [L42] unsigned char var_1_21 = 0; [L43] unsigned long int var_1_22 = 16; [L44] unsigned long int var_1_23 = 4200661734; [L136] isInitial = 1 [L137] FCALL initially() [L138] COND TRUE 1 [L139] FCALL updateLastVariables() [L140] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_6=-16, var_1_7=-2, var_1_8=5, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_6=-16, var_1_7=-2, var_1_8=5, var_1_9=-25] [L88] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_6=-16, var_1_7=-2, var_1_8=5, var_1_9=-25] [L89] var_1_3 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_4=9/2, var_1_5=99/2, var_1_6=-16, var_1_7=-2, var_1_8=5, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_4=9/2, var_1_5=99/2, var_1_6=-16, var_1_7=-2, var_1_8=5, var_1_9=-25] [L90] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_4=9/2, var_1_5=99/2, var_1_6=-16, var_1_7=-2, var_1_8=5, var_1_9=-25] [L91] var_1_4 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_5=99/2, var_1_6=-16, var_1_7=-2, var_1_8=5, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_5=99/2, var_1_6=-16, var_1_7=-2, var_1_8=5, var_1_9=-25] [L92] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_5=99/2, var_1_6=-16, var_1_7=-2, var_1_8=5, var_1_9=-25] [L93] var_1_5 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=-16, var_1_7=-2, var_1_8=5, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=-16, var_1_7=-2, var_1_8=5, var_1_9=-25] [L94] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=-16, var_1_7=-2, var_1_8=5, var_1_9=-25] [L95] var_1_6 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_6 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-2, var_1_8=5, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-2, var_1_8=5, var_1_9=-25] [L96] RET assume_abort_if_not(var_1_6 >= -16383) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-2, var_1_8=5, var_1_9=-25] [L97] CALL assume_abort_if_not(var_1_6 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-2, var_1_8=5, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-2, var_1_8=5, var_1_9=-25] [L97] RET assume_abort_if_not(var_1_6 <= 16383) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-2, var_1_8=5, var_1_9=-25] [L98] var_1_7 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_7 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=5, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=5, var_1_9=-25] [L99] RET assume_abort_if_not(var_1_7 >= -16383) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=5, var_1_9=-25] [L100] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=5, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=5, var_1_9=-25] [L100] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=5, var_1_9=-25] [L101] var_1_8 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_8 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L102] RET assume_abort_if_not(var_1_8 >= -16383) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L103] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L103] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L104] var_1_11 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L105] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L106] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L106] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L107] var_1_12 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L108] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L109] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L109] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L110] var_1_13 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L111] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L112] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L112] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L113] var_1_15 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L114] RET assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L115] var_1_16 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L116] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L117] var_1_17 = __VERIFIER_nondet_float() [L118] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L118] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L119] var_1_20 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L120] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L121] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L121] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L122] var_1_21 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L123] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L124] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L124] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L125] var_1_23 = __VERIFIER_nondet_ulong() [L126] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=2147483647, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=2147483647, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L126] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=2147483647, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L127] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=2147483647, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=2147483647, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L127] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=2147483647, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L140] RET updateVariables() [L141] CALL step() [L48] COND TRUE ((var_1_2 - var_1_3) * var_1_4) < var_1_5 [L49] var_1_1 = ((((-8) < ((var_1_6 + ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))))) ? (-8) : ((var_1_6 + ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))))) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=2147483647, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L53] signed short int stepLocal_0 = var_1_8; VAL [isInitial=1, stepLocal_0=-16379, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=2147483647, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=-25] [L54] COND TRUE stepLocal_0 >= var_1_7 [L55] var_1_9 = (-256 + var_1_6) VAL [isInitial=1, var_1_10=200, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=2147483647, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=16127] [L59] COND TRUE \read(var_1_11) [L60] var_1_10 = ((((0) < (var_1_12)) ? (0) : (var_1_12))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=2147483647, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=16127] [L66] COND FALSE !(! var_1_11) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=2147483647, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=16127] [L73] COND TRUE (var_1_17 <= (- var_1_16)) && var_1_11 [L74] var_1_18 = var_1_6 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=16383, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=2147483647, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=16127] [L76] signed long int stepLocal_1 = 0; VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=16383, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=2147483647, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=16127] [L77] COND TRUE var_1_9 > stepLocal_1 [L78] var_1_19 = ((var_1_5 >= (- var_1_15)) && (var_1_11 && (var_1_20 && var_1_21))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=16383, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=2147483647, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=16127] [L80] COND FALSE !(\read(var_1_19)) [L83] var_1_22 = (((((var_1_23 - var_1_10)) < (var_1_14)) ? ((var_1_23 - var_1_10)) : (var_1_14))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=16383, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=2147483647, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=16127] [L141] RET step() [L142] CALL, EXPR property() [L132-L133] return (((((((((var_1_2 - var_1_3) * var_1_4) < var_1_5) ? (var_1_1 == ((signed short int) ((((-8) < ((var_1_6 + ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))))) ? (-8) : ((var_1_6 + ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))))))) : (var_1_1 == ((signed short int) var_1_6))) && ((var_1_8 >= var_1_7) ? (var_1_9 == ((signed short int) (-256 + var_1_6))) : (var_1_9 == ((signed short int) (var_1_7 + var_1_6))))) && (var_1_11 ? (var_1_10 == ((unsigned char) ((((0) < (var_1_12)) ? (0) : (var_1_12))))) : ((! (var_1_5 > (255.9 / var_1_13))) ? (var_1_10 == ((unsigned char) var_1_12)) : 1))) && ((! var_1_11) ? ((((var_1_15 - var_1_16) - var_1_17) <= var_1_13) ? (var_1_14 == ((unsigned short int) var_1_10)) : (var_1_14 == ((unsigned short int) var_1_10))) : 1)) && (((var_1_17 <= (- var_1_16)) && var_1_11) ? (var_1_18 == ((signed short int) var_1_6)) : 1)) && ((var_1_9 > 0) ? (var_1_19 == ((unsigned char) ((var_1_5 >= (- var_1_15)) && (var_1_11 && (var_1_20 && var_1_21))))) : 1)) && (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_10 + var_1_14))) : (var_1_22 == ((unsigned long int) (((((var_1_23 - var_1_10)) < (var_1_14)) ? ((var_1_23 - var_1_10)) : (var_1_14)))))) ; [L142] RET, EXPR property() [L142] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=16383, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=2147483647, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=16127] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=254, var_1_14=0, var_1_18=16383, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=2147483647, var_1_6=16383, var_1_7=-16379, var_1_8=-16379, var_1_9=16127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 3, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131 mSDsluCounter, 233 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 155 IncrementalHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 157 mSDtfsCounter, 155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 449 GetRequests, 432 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=2, InterpolantAutomatonStates: 12, 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 620 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 616 ConstructedInterpolants, 0 QuantifiedInterpolants, 950 SizeOfPredicates, 6 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 4782/4800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 07:37:11,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-80.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c51934b75642007b7e5ba630000c4f6d9fea2369763db606575965ad8705e431 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:37:13,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:37:13,806 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:37:13,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:37:13,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:37:13,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:37:13,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:37:13,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:37:13,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:37:13,848 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:37:13,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:37:13,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:37:13,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:37:13,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:37:13,850 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:37:13,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:37:13,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:37:13,851 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:37:13,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:37:13,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:37:13,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:37:13,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:37:13,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:37:13,853 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:37:13,853 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:37:13,853 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:37:13,854 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:37:13,854 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:37:13,854 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:37:13,855 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:37:13,855 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:37:13,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:37:13,855 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:37:13,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:37:13,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:37:13,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:37:13,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:37:13,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:37:13,859 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:37:13,859 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:37:13,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:37:13,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:37:13,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:37:13,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:37:13,861 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:37:13,861 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c51934b75642007b7e5ba630000c4f6d9fea2369763db606575965ad8705e431 [2024-10-11 07:37:14,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:37:14,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:37:14,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:37:14,247 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:37:14,248 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:37:14,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-80.i [2024-10-11 07:37:15,847 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:37:16,084 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:37:16,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-80.i [2024-10-11 07:37:16,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/34aa23e63/0a0bf9b8675f4369884e50bc2b0edeee/FLAG3ece34474 [2024-10-11 07:37:16,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/34aa23e63/0a0bf9b8675f4369884e50bc2b0edeee [2024-10-11 07:37:16,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:37:16,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:37:16,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:37:16,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:37:16,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:37:16,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:37:16" (1/1) ... [2024-10-11 07:37:16,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b7a45db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:16, skipping insertion in model container [2024-10-11 07:37:16,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:37:16" (1/1) ... [2024-10-11 07:37:16,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:37:16,655 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-80.i[917,930] [2024-10-11 07:37:16,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:37:16,752 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:37:16,767 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-80.i[917,930] [2024-10-11 07:37:16,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:37:16,833 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:37:16,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:16 WrapperNode [2024-10-11 07:37:16,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:37:16,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:37:16,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:37:16,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:37:16,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:16" (1/1) ... [2024-10-11 07:37:16,857 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:16" (1/1) ... [2024-10-11 07:37:16,898 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-10-11 07:37:16,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:37:16,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:37:16,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:37:16,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:37:16,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:16" (1/1) ... [2024-10-11 07:37:16,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:16" (1/1) ... [2024-10-11 07:37:16,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:16" (1/1) ... [2024-10-11 07:37:16,943 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:37:16,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:16" (1/1) ... [2024-10-11 07:37:16,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:16" (1/1) ... [2024-10-11 07:37:16,959 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:16" (1/1) ... [2024-10-11 07:37:16,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:16" (1/1) ... [2024-10-11 07:37:16,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:16" (1/1) ... [2024-10-11 07:37:16,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:16" (1/1) ... [2024-10-11 07:37:16,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:37:16,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:37:16,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:37:16,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:37:16,984 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:16" (1/1) ... [2024-10-11 07:37:16,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:37:17,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:37:17,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:37:17,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:37:17,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:37:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:37:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:37:17,082 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:37:17,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:37:17,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:37:17,169 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:37:17,171 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:37:36,478 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 07:37:36,478 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:37:36,535 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:37:36,535 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:37:36,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:37:36 BoogieIcfgContainer [2024-10-11 07:37:36,536 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:37:36,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:37:36,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:37:36,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:37:36,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:37:16" (1/3) ... [2024-10-11 07:37:36,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec489e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:37:36, skipping insertion in model container [2024-10-11 07:37:36,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:37:16" (2/3) ... [2024-10-11 07:37:36,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec489e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:37:36, skipping insertion in model container [2024-10-11 07:37:36,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:37:36" (3/3) ... [2024-10-11 07:37:36,548 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-80.i [2024-10-11 07:37:36,565 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:37:36,566 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:37:36,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:37:36,651 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;@42f0fc4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:37:36,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:37:36,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 07:37:36,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 07:37:36,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:37:36,670 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:37:36,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:37:36,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:37:36,675 INFO L85 PathProgramCache]: Analyzing trace with hash -30641210, now seen corresponding path program 1 times [2024-10-11 07:37:36,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:37:36,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297204205] [2024-10-11 07:37:36,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:37:36,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:37:36,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:37:36,692 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:37:36,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 07:37:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:37,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:37:37,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:37:37,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 07:37:37,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:37:37,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:37:37,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297204205] [2024-10-11 07:37:37,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297204205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:37:37,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:37:37,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:37:37,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630128885] [2024-10-11 07:37:37,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:37:37,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:37:37,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:37:37,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:37:37,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:37:37,875 INFO L87 Difference]: Start difference. First operand has 65 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 07:37:42,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:37:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:37:42,240 INFO L93 Difference]: Finished difference Result 127 states and 225 transitions. [2024-10-11 07:37:42,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:37:42,351 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 155 [2024-10-11 07:37:42,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:37:42,358 INFO L225 Difference]: With dead ends: 127 [2024-10-11 07:37:42,358 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 07:37:42,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:37:42,363 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:37:42,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 07:37:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 07:37:42,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-11 07:37:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 07:37:42,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 96 transitions. [2024-10-11 07:37:42,407 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 96 transitions. Word has length 155 [2024-10-11 07:37:42,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:37:42,407 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 96 transitions. [2024-10-11 07:37:42,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 07:37:42,408 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 96 transitions. [2024-10-11 07:37:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 07:37:42,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:37:42,414 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:37:42,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 07:37:42,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:37:42,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:37:42,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:37:42,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1080171796, now seen corresponding path program 1 times [2024-10-11 07:37:42,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:37:42,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608747721] [2024-10-11 07:37:42,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:37:42,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:37:42,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:37:42,621 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:37:42,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 07:37:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:37:43,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 07:37:43,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:37:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 244 proven. 6 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-10-11 07:37:45,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:37:47,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 66 proven. 6 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 07:37:47,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:37:47,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608747721] [2024-10-11 07:37:47,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608747721] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:37:47,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:37:47,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-11 07:37:47,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945364117] [2024-10-11 07:37:47,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:37:47,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:37:47,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:37:47,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:37:47,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:37:47,865 INFO L87 Difference]: Start difference. First operand 63 states and 96 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 07:37:55,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:37:59,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:38:03,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:38:03,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:38:03,728 INFO L93 Difference]: Finished difference Result 133 states and 198 transitions. [2024-10-11 07:38:03,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 07:38:03,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 155 [2024-10-11 07:38:03,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:38:03,854 INFO L225 Difference]: With dead ends: 133 [2024-10-11 07:38:03,855 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 07:38:03,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-10-11 07:38:03,857 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 84 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 95 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2024-10-11 07:38:03,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 139 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 150 Invalid, 3 Unknown, 0 Unchecked, 14.9s Time] [2024-10-11 07:38:03,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 07:38:03,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2024-10-11 07:38:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 07:38:03,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2024-10-11 07:38:03,875 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 155 [2024-10-11 07:38:03,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:38:03,876 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2024-10-11 07:38:03,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 07:38:03,877 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2024-10-11 07:38:03,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 07:38:03,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:38:03,879 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:38:03,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 07:38:04,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:38:04,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:38:04,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:38:04,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1080231378, now seen corresponding path program 1 times [2024-10-11 07:38:04,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:38:04,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252830851] [2024-10-11 07:38:04,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:38:04,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:38:04,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:38:04,086 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:38:04,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 07:38:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:38:05,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 07:38:05,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:38:32,805 WARN L286 SmtUtils]: Spent 8.14s 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)