./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_loopvsstraightlinecode_25-1loop_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-89.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3047be65ea0fc5640e4cd865efbd9906b9eaeb4a8d01185b0a8bdb2377eb8eb2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:32:06,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:32:06,243 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:32:06,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:32:06,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:32:06,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:32:06,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:32:06,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:32:06,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:32:06,283 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:32:06,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:32:06,283 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:32:06,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:32:06,284 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:32:06,285 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:32:06,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:32:06,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:32:06,287 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:32:06,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:32:06,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:32:06,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:32:06,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:32:06,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:32:06,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:32:06,293 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:32:06,293 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:32:06,294 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:32:06,294 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:32:06,294 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:32:06,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:32:06,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:32:06,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:32:06,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:32:06,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:32:06,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:32:06,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:32:06,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:32:06,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:32:06,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:32:06,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:32:06,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:32:06,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:32:06,299 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3047be65ea0fc5640e4cd865efbd9906b9eaeb4a8d01185b0a8bdb2377eb8eb2 [2024-10-24 09:32:06,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:32:06,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:32:06,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:32:06,597 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:32:06,597 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:32:06,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-89.i [2024-10-24 09:32:08,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:32:08,355 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:32:08,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-89.i [2024-10-24 09:32:08,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2e627831/3e3ac5923c4945f7b896ab4f2c125189/FLAGbf0604042 [2024-10-24 09:32:08,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2e627831/3e3ac5923c4945f7b896ab4f2c125189 [2024-10-24 09:32:08,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:32:08,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:32:08,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:32:08,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:32:08,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:32:08,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:32:08" (1/1) ... [2024-10-24 09:32:08,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54208d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:08, skipping insertion in model container [2024-10-24 09:32:08,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:32:08" (1/1) ... [2024-10-24 09:32:08,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:32:08,648 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_loopvsstraightlinecode_25-1loop_file-89.i[915,928] [2024-10-24 09:32:08,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:32:08,699 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:32:08,710 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_loopvsstraightlinecode_25-1loop_file-89.i[915,928] [2024-10-24 09:32:08,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:32:08,752 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:32:08,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:08 WrapperNode [2024-10-24 09:32:08,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:32:08,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:32:08,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:32:08,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:32:08,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:08" (1/1) ... [2024-10-24 09:32:08,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:08" (1/1) ... [2024-10-24 09:32:08,808 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-10-24 09:32:08,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:32:08,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:32:08,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:32:08,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:32:08,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:08" (1/1) ... [2024-10-24 09:32:08,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:08" (1/1) ... [2024-10-24 09:32:08,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:08" (1/1) ... [2024-10-24 09:32:08,839 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:32:08,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:08" (1/1) ... [2024-10-24 09:32:08,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:08" (1/1) ... [2024-10-24 09:32:08,854 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:08" (1/1) ... [2024-10-24 09:32:08,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:08" (1/1) ... [2024-10-24 09:32:08,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:08" (1/1) ... [2024-10-24 09:32:08,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:08" (1/1) ... [2024-10-24 09:32:08,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:32:08,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:32:08,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:32:08,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:32:08,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:08" (1/1) ... [2024-10-24 09:32:08,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:32:08,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:32:08,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:32:08,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:32:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:32:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:32:08,970 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:32:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:32:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:32:08,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:32:09,054 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:32:09,058 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:32:09,344 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-24 09:32:09,344 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:32:09,387 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:32:09,387 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:32:09,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:32:09 BoogieIcfgContainer [2024-10-24 09:32:09,387 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:32:09,390 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:32:09,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:32:09,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:32:09,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:32:08" (1/3) ... [2024-10-24 09:32:09,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4422330f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:32:09, skipping insertion in model container [2024-10-24 09:32:09,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:08" (2/3) ... [2024-10-24 09:32:09,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4422330f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:32:09, skipping insertion in model container [2024-10-24 09:32:09,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:32:09" (3/3) ... [2024-10-24 09:32:09,398 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-89.i [2024-10-24 09:32:09,412 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:32:09,412 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:32:09,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:32:09,472 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;@3cf9b7ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:32:09,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:32:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:32:09,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 09:32:09,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:32:09,489 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:32:09,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:32:09,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:32:09,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1048650967, now seen corresponding path program 1 times [2024-10-24 09:32:09,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:32:09,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355222329] [2024-10-24 09:32:09,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:32:09,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:32:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:32:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:32:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:32:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:32:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:32:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:32:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:32:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:32:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:32:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:32:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 09:32:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:32:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:32:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:32:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:32:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:32:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:32:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:32:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:32:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 09:32:09,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:32:09,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355222329] [2024-10-24 09:32:09,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355222329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:32:09,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:32:09,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:32:09,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454731016] [2024-10-24 09:32:09,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:32:09,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:32:09,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:32:09,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:32:09,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:32:09,950 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 09:32:10,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:32:10,008 INFO L93 Difference]: Finished difference Result 95 states and 162 transitions. [2024-10-24 09:32:10,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:32:10,011 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2024-10-24 09:32:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:32:10,019 INFO L225 Difference]: With dead ends: 95 [2024-10-24 09:32:10,020 INFO L226 Difference]: Without dead ends: 46 [2024-10-24 09:32:10,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:32:10,029 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:32:10,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:32:10,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-24 09:32:10,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-24 09:32:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:32:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2024-10-24 09:32:10,083 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 116 [2024-10-24 09:32:10,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:32:10,083 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2024-10-24 09:32:10,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 09:32:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2024-10-24 09:32:10,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 09:32:10,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:32:10,090 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:32:10,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:32:10,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:32:10,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:32:10,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2078404451, now seen corresponding path program 1 times [2024-10-24 09:32:10,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:32:10,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113782304] [2024-10-24 09:32:10,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:32:10,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:32:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:32:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:32:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:32:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:32:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:32:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:32:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:32:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:32:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:32:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:32:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 09:32:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:32:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:32:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:32:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:32:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:32:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:32:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:32:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:32:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-24 09:32:10,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:32:10,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113782304] [2024-10-24 09:32:10,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113782304] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:32:10,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606970319] [2024-10-24 09:32:10,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:32:10,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:32:10,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:32:10,976 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:32:10,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 09:32:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:11,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 09:32:11,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:32:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 371 proven. 48 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-24 09:32:11,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:32:11,655 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-24 09:32:11,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606970319] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:32:11,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 09:32:11,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-10-24 09:32:11,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742672057] [2024-10-24 09:32:11,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 09:32:11,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 09:32:11,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:32:11,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 09:32:11,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-24 09:32:11,666 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-24 09:32:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:32:11,958 INFO L93 Difference]: Finished difference Result 101 states and 141 transitions. [2024-10-24 09:32:11,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 09:32:11,960 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 116 [2024-10-24 09:32:11,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:32:11,963 INFO L225 Difference]: With dead ends: 101 [2024-10-24 09:32:11,963 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 09:32:11,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-24 09:32:11,965 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 49 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:32:11,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 126 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:32:11,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 09:32:11,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-10-24 09:32:11,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:32:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2024-10-24 09:32:11,986 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 116 [2024-10-24 09:32:11,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:32:11,988 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2024-10-24 09:32:11,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-24 09:32:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2024-10-24 09:32:11,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 09:32:11,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:32:11,991 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:32:12,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 09:32:12,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:32:12,193 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:32:12,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:32:12,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2078344869, now seen corresponding path program 1 times [2024-10-24 09:32:12,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:32:12,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140810518] [2024-10-24 09:32:12,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:32:12,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:32:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:32:12,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [987375856] [2024-10-24 09:32:12,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:32:12,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:32:12,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:32:12,300 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:32:12,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 09:32:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:32:12,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:32:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:32:12,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:32:12,529 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:32:12,530 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:32:12,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 09:32:12,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-24 09:32:12,736 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 09:32:12,812 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:32:12,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:32:12 BoogieIcfgContainer [2024-10-24 09:32:12,816 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:32:12,817 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:32:12,817 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:32:12,817 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:32:12,818 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:32:09" (3/4) ... [2024-10-24 09:32:12,820 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:32:12,821 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:32:12,822 INFO L158 Benchmark]: Toolchain (without parser) took 4432.45ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 49.2MB in the end (delta: 53.0MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2024-10-24 09:32:12,822 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:32:12,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.16ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 132.8MB in the end (delta: -30.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 09:32:12,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.33ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 129.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:32:12,824 INFO L158 Benchmark]: Boogie Preprocessor took 55.51ms. Allocated memory is still 167.8MB. Free memory was 129.8MB in the beginning and 126.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:32:12,827 INFO L158 Benchmark]: RCFGBuilder took 521.41ms. Allocated memory is still 167.8MB. Free memory was 126.5MB in the beginning and 105.9MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 09:32:12,828 INFO L158 Benchmark]: TraceAbstraction took 3426.54ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 50.3MB in the end (delta: 55.6MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2024-10-24 09:32:12,828 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 167.8MB. Free memory was 50.3MB in the beginning and 49.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:32:12,830 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.16ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 132.8MB in the end (delta: -30.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.33ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 129.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.51ms. Allocated memory is still 167.8MB. Free memory was 129.8MB in the beginning and 126.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 521.41ms. Allocated memory is still 167.8MB. Free memory was 126.5MB in the beginning and 105.9MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3426.54ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 50.3MB in the end (delta: 55.6MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 167.8MB. Free memory was 50.3MB in the beginning and 49.2MB 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 90, overapproximation of someUnaryDOUBLEoperation at line 31, overapproximation of someBinaryArithmeticDOUBLEoperation at line 52. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 5; [L24] unsigned char var_1_3 = 4; [L25] signed long int var_1_4 = -256; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 1; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 0; [L30] double var_1_9 = 9.5; [L31] double var_1_10 = -0.4; [L32] double var_1_11 = 31.5; [L33] double var_1_12 = 16.25; [L34] double var_1_13 = 127.5; [L35] double var_1_14 = 100000.5; [L94] isInitial = 1 [L95] FCALL initially() [L96] int k_loop; [L97] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_2=5, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L97] COND TRUE k_loop < 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L56] var_1_2 = __VERIFIER_nondet_uchar() [L57] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L57] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L58] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L58] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L59] var_1_3 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L60] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L61] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L61] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L62] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L62] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L63] var_1_4 = __VERIFIER_nondet_long() [L64] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L64] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L65] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L65] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L66] var_1_5 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L67] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L68] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L68] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L70] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=19/2] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=19/2] [L74] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L74] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L75] var_1_8 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=19/2] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=19/2] [L77] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L77] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L78] var_1_10 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L79] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L80] var_1_12 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L81] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L82] var_1_13 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L83] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L84] var_1_14 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L85] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L99] RET updateVariables() [L100] CALL step() [L39] COND TRUE (var_1_2 / var_1_3) >= var_1_4 [L40] var_1_1 = (var_1_5 && var_1_6) VAL [isInitial=1, var_1_11=63/2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L44] unsigned char stepLocal_0 = (var_1_6 && var_1_8) || (var_1_2 >= 5); VAL [isInitial=1, stepLocal_0=1, var_1_11=63/2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L45] COND TRUE stepLocal_0 && (var_1_3 < var_1_4) [L46] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=2, var_1_11=63/2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L50] unsigned char stepLocal_1 = var_1_6; VAL [isInitial=1, stepLocal_1=1, var_1_10=2, var_1_11=63/2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L51] COND TRUE (((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) > ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))) || stepLocal_1 [L52] var_1_11 = (((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))) + var_1_14) VAL [isInitial=1, var_1_10=2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L100] RET step() [L101] CALL, EXPR property() [L90-L91] return ((((var_1_2 / var_1_3) >= var_1_4) ? (var_1_1 == ((unsigned char) (var_1_5 && var_1_6))) : (var_1_1 == ((unsigned char) ((var_1_3 >= var_1_2) && (var_1_7 || var_1_8))))) && ((((var_1_6 && var_1_8) || (var_1_2 >= 5)) && (var_1_3 < var_1_4)) ? (var_1_9 == ((double) var_1_10)) : (var_1_9 == ((double) var_1_10)))) && (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) > ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))) || var_1_6) ? (var_1_11 == ((double) (((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))) + var_1_14))) : 1) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 190 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 201 IncrementalHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 101 mSDtfsCounter, 201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 337 GetRequests, 321 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 580 NumberOfCodeBlocks, 580 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 460 ConstructedInterpolants, 0 QuantifiedInterpolants, 931 SizeOfPredicates, 1 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2634/2736 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 09:32:12,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-89.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3047be65ea0fc5640e4cd865efbd9906b9eaeb4a8d01185b0a8bdb2377eb8eb2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:32:15,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:32:15,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:32:15,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:32:15,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:32:15,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:32:15,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:32:15,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:32:15,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:32:15,230 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:32:15,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:32:15,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:32:15,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:32:15,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:32:15,232 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:32:15,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:32:15,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:32:15,233 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:32:15,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:32:15,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:32:15,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:32:15,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:32:15,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:32:15,236 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:32:15,236 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:32:15,237 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:32:15,237 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:32:15,237 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:32:15,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:32:15,238 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:32:15,238 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:32:15,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:32:15,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:32:15,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:32:15,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:32:15,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:32:15,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:32:15,241 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:32:15,241 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:32:15,241 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:32:15,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:32:15,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:32:15,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:32:15,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:32:15,243 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:32:15,243 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3047be65ea0fc5640e4cd865efbd9906b9eaeb4a8d01185b0a8bdb2377eb8eb2 [2024-10-24 09:32:15,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:32:15,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:32:15,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:32:15,579 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:32:15,579 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:32:15,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-89.i [2024-10-24 09:32:17,080 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:32:17,291 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:32:17,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-89.i [2024-10-24 09:32:17,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bedf60afd/8b2c795c618c4aa58a9349a129dbd708/FLAG1025a7e74 [2024-10-24 09:32:17,676 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bedf60afd/8b2c795c618c4aa58a9349a129dbd708 [2024-10-24 09:32:17,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:32:17,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:32:17,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:32:17,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:32:17,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:32:17,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:32:17" (1/1) ... [2024-10-24 09:32:17,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@afdeeb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:17, skipping insertion in model container [2024-10-24 09:32:17,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:32:17" (1/1) ... [2024-10-24 09:32:17,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:32:17,929 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_loopvsstraightlinecode_25-1loop_file-89.i[915,928] [2024-10-24 09:32:17,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:32:17,996 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:32:18,009 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_loopvsstraightlinecode_25-1loop_file-89.i[915,928] [2024-10-24 09:32:18,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:32:18,065 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:32:18,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:18 WrapperNode [2024-10-24 09:32:18,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:32:18,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:32:18,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:32:18,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:32:18,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:18" (1/1) ... [2024-10-24 09:32:18,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:18" (1/1) ... [2024-10-24 09:32:18,125 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2024-10-24 09:32:18,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:32:18,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:32:18,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:32:18,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:32:18,139 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:18" (1/1) ... [2024-10-24 09:32:18,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:18" (1/1) ... [2024-10-24 09:32:18,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:18" (1/1) ... [2024-10-24 09:32:18,160 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:32:18,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:18" (1/1) ... [2024-10-24 09:32:18,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:18" (1/1) ... [2024-10-24 09:32:18,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:18" (1/1) ... [2024-10-24 09:32:18,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:18" (1/1) ... [2024-10-24 09:32:18,188 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:18" (1/1) ... [2024-10-24 09:32:18,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:18" (1/1) ... [2024-10-24 09:32:18,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:32:18,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:32:18,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:32:18,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:32:18,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:18" (1/1) ... [2024-10-24 09:32:18,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:32:18,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:32:18,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:32:18,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:32:18,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:32:18,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:32:18,286 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:32:18,286 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:32:18,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:32:18,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:32:18,374 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:32:18,376 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:32:18,989 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-24 09:32:18,989 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:32:19,049 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:32:19,050 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:32:19,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:32:19 BoogieIcfgContainer [2024-10-24 09:32:19,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:32:19,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:32:19,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:32:19,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:32:19,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:32:17" (1/3) ... [2024-10-24 09:32:19,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a74b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:32:19, skipping insertion in model container [2024-10-24 09:32:19,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:18" (2/3) ... [2024-10-24 09:32:19,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a74b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:32:19, skipping insertion in model container [2024-10-24 09:32:19,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:32:19" (3/3) ... [2024-10-24 09:32:19,061 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-89.i [2024-10-24 09:32:19,078 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:32:19,079 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:32:19,140 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:32:19,146 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;@52f5192a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:32:19,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:32:19,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:32:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 09:32:19,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:32:19,163 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:32:19,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:32:19,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:32:19,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1048650967, now seen corresponding path program 1 times [2024-10-24 09:32:19,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:32:19,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132400399] [2024-10-24 09:32:19,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:32:19,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:32:19,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:32:19,188 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:32:19,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 09:32:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:19,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:32:19,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:32:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-10-24 09:32:19,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:32:19,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:32:19,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132400399] [2024-10-24 09:32:19,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132400399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:32:19,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:32:19,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:32:19,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941723879] [2024-10-24 09:32:19,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:32:19,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:32:19,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:32:19,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:32:19,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:32:19,598 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 09:32:19,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:32:19,803 INFO L93 Difference]: Finished difference Result 95 states and 162 transitions. [2024-10-24 09:32:19,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:32:19,806 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2024-10-24 09:32:19,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:32:19,813 INFO L225 Difference]: With dead ends: 95 [2024-10-24 09:32:19,813 INFO L226 Difference]: Without dead ends: 46 [2024-10-24 09:32:19,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:32:19,819 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:32:19,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:32:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-24 09:32:19,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-24 09:32:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:32:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2024-10-24 09:32:19,859 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 116 [2024-10-24 09:32:19,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:32:19,860 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2024-10-24 09:32:19,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 09:32:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2024-10-24 09:32:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 09:32:19,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:32:19,866 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:32:19,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 09:32:20,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:32:20,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:32:20,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:32:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2078404451, now seen corresponding path program 1 times [2024-10-24 09:32:20,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:32:20,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987414062] [2024-10-24 09:32:20,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:32:20,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:32:20,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:32:20,077 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:32:20,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 09:32:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:20,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 09:32:20,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:32:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 371 proven. 48 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-24 09:32:20,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:32:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-24 09:32:21,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:32:21,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987414062] [2024-10-24 09:32:21,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987414062] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:32:21,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 09:32:21,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-10-24 09:32:21,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375283968] [2024-10-24 09:32:21,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 09:32:21,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 09:32:21,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:32:21,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 09:32:21,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-24 09:32:21,064 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-24 09:32:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:32:22,209 INFO L93 Difference]: Finished difference Result 101 states and 141 transitions. [2024-10-24 09:32:22,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 09:32:22,210 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 116 [2024-10-24 09:32:22,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:32:22,213 INFO L225 Difference]: With dead ends: 101 [2024-10-24 09:32:22,213 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 09:32:22,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-10-24 09:32:22,215 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 49 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:32:22,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 179 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 09:32:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 09:32:22,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-10-24 09:32:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:32:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2024-10-24 09:32:22,235 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 116 [2024-10-24 09:32:22,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:32:22,236 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2024-10-24 09:32:22,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-24 09:32:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2024-10-24 09:32:22,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 09:32:22,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:32:22,242 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:32:22,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 09:32:22,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:32:22,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:32:22,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:32:22,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2078344869, now seen corresponding path program 1 times [2024-10-24 09:32:22,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:32:22,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296352799] [2024-10-24 09:32:22,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:32:22,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:32:22,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:32:22,450 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:32:22,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 09:32:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:22,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 09:32:22,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:33:07,457 WARN L286 SmtUtils]: Spent 18.91s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)