./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.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 8e493bb9dfb1e4026bad014b506150c14522bad4ce88bea6356ffab3296ecf60 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:45:12,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:45:12,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:45:12,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:45:12,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:45:12,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:45:12,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:45:12,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:45:12,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:45:12,607 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:45:12,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:45:12,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:45:12,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:45:12,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:45:12,612 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:45:12,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:45:12,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:45:12,613 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:45:12,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:45:12,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:45:12,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:45:12,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:45:12,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:45:12,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:45:12,615 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:45:12,616 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:45:12,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:45:12,616 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:45:12,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:45:12,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:45:12,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:45:12,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:45:12,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:45:12,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:45:12,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:45:12,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:45:12,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:45:12,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:45:12,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:45:12,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:45:12,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:45:12,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:45:12,621 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 -> 8e493bb9dfb1e4026bad014b506150c14522bad4ce88bea6356ffab3296ecf60 [2024-11-08 23:45:12,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:45:12,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:45:12,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:45:12,908 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:45:12,908 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:45:12,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.i [2024-11-08 23:45:14,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:45:14,565 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:45:14,567 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.i [2024-11-08 23:45:14,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c8500f92/6ce974145e1e4115aabbbcc4f48778a1/FLAGdb80ddff7 [2024-11-08 23:45:14,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c8500f92/6ce974145e1e4115aabbbcc4f48778a1 [2024-11-08 23:45:14,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:45:14,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:45:14,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:45:14,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:45:14,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:45:14,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:45:14" (1/1) ... [2024-11-08 23:45:14,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26076613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:14, skipping insertion in model container [2024-11-08 23:45:14,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:45:14" (1/1) ... [2024-11-08 23:45:14,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:45:14,822 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.i[915,928] [2024-11-08 23:45:14,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:45:14,883 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:45:14,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.i[915,928] [2024-11-08 23:45:14,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:45:14,936 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:45:14,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:14 WrapperNode [2024-11-08 23:45:14,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:45:14,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:45:14,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:45:14,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:45:14,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:14" (1/1) ... [2024-11-08 23:45:14,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:14" (1/1) ... [2024-11-08 23:45:14,983 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-11-08 23:45:14,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:45:14,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:45:14,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:45:14,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:45:15,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:14" (1/1) ... [2024-11-08 23:45:15,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:14" (1/1) ... [2024-11-08 23:45:15,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:14" (1/1) ... [2024-11-08 23:45:15,027 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:45:15,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:14" (1/1) ... [2024-11-08 23:45:15,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:14" (1/1) ... [2024-11-08 23:45:15,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:14" (1/1) ... [2024-11-08 23:45:15,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:14" (1/1) ... [2024-11-08 23:45:15,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:14" (1/1) ... [2024-11-08 23:45:15,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:14" (1/1) ... [2024-11-08 23:45:15,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:45:15,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:45:15,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:45:15,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:45:15,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:14" (1/1) ... [2024-11-08 23:45:15,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:45:15,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:45:15,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:45:15,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:45:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:45:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:45:15,150 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:45:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:45:15,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:45:15,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:45:15,233 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:45:15,235 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:45:15,499 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-08 23:45:15,500 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:45:15,517 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:45:15,518 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:45:15,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:45:15 BoogieIcfgContainer [2024-11-08 23:45:15,519 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:45:15,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:45:15,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:45:15,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:45:15,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:45:14" (1/3) ... [2024-11-08 23:45:15,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c26db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:45:15, skipping insertion in model container [2024-11-08 23:45:15,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:14" (2/3) ... [2024-11-08 23:45:15,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c26db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:45:15, skipping insertion in model container [2024-11-08 23:45:15,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:45:15" (3/3) ... [2024-11-08 23:45:15,530 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-73.i [2024-11-08 23:45:15,547 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:45:15,547 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:45:15,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:45:15,620 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;@13d54334, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:45:15,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:45:15,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 23:45:15,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 23:45:15,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:45:15,637 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:45:15,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:45:15,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:45:15,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1864514382, now seen corresponding path program 1 times [2024-11-08 23:45:15,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:45:15,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958461380] [2024-11-08 23:45:15,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:45:15,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:15,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:45:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:15,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:45:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:15,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:45:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:15,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:45:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:15,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:45:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:15,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:45:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:15,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:45:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:15,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:45:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:15,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:45:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 23:45:16,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:45:16,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958461380] [2024-11-08 23:45:16,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958461380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:45:16,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:45:16,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:45:16,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296231670] [2024-11-08 23:45:16,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:45:16,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:45:16,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:45:16,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:45:16,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:45:16,077 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 23:45:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:45:16,121 INFO L93 Difference]: Finished difference Result 77 states and 118 transitions. [2024-11-08 23:45:16,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:45:16,126 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2024-11-08 23:45:16,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:45:16,134 INFO L225 Difference]: With dead ends: 77 [2024-11-08 23:45:16,134 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 23:45:16,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:45:16,143 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:45:16,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:45:16,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 23:45:16,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-08 23:45:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 23:45:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-08 23:45:16,188 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 63 [2024-11-08 23:45:16,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:45:16,188 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-08 23:45:16,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 23:45:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-08 23:45:16,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 23:45:16,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:45:16,193 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:45:16,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:45:16,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:45:16,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:45:16,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1625579600, now seen corresponding path program 1 times [2024-11-08 23:45:16,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:45:16,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547564316] [2024-11-08 23:45:16,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:45:16,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:16,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:45:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:16,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:45:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:16,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:45:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:16,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:45:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:16,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:45:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:16,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:45:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:16,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:45:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:16,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:45:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:16,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:45:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 23:45:16,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:45:16,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547564316] [2024-11-08 23:45:16,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547564316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:45:16,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:45:16,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:45:16,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885524214] [2024-11-08 23:45:16,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:45:16,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:45:16,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:45:16,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:45:16,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:45:16,755 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:45:16,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:45:16,920 INFO L93 Difference]: Finished difference Result 103 states and 142 transitions. [2024-11-08 23:45:16,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:45:16,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2024-11-08 23:45:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:45:16,923 INFO L225 Difference]: With dead ends: 103 [2024-11-08 23:45:16,923 INFO L226 Difference]: Without dead ends: 70 [2024-11-08 23:45:16,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:45:16,926 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 42 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:45:16,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 154 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:45:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-08 23:45:16,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 57. [2024-11-08 23:45:16,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:45:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2024-11-08 23:45:16,947 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 63 [2024-11-08 23:45:16,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:45:16,947 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2024-11-08 23:45:16,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:45:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2024-11-08 23:45:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 23:45:16,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:45:16,950 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:45:16,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:45:16,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:45:16,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:45:16,951 INFO L85 PathProgramCache]: Analyzing trace with hash 633638029, now seen corresponding path program 1 times [2024-11-08 23:45:16,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:45:16,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325590826] [2024-11-08 23:45:16,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:45:16,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:17,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:45:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:17,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:45:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:17,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:45:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:17,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:45:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:17,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:45:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:17,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:45:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:17,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:45:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:17,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:45:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:17,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:45:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 23:45:17,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:45:17,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325590826] [2024-11-08 23:45:17,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325590826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:45:17,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:45:17,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:45:17,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984852709] [2024-11-08 23:45:17,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:45:17,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:45:17,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:45:17,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:45:17,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:45:17,030 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:45:17,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:45:17,062 INFO L93 Difference]: Finished difference Result 102 states and 138 transitions. [2024-11-08 23:45:17,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:45:17,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2024-11-08 23:45:17,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:45:17,067 INFO L225 Difference]: With dead ends: 102 [2024-11-08 23:45:17,067 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 23:45:17,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:45:17,070 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 14 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:45:17,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 98 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:45:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 23:45:17,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2024-11-08 23:45:17,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:45:17,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 79 transitions. [2024-11-08 23:45:17,087 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 79 transitions. Word has length 64 [2024-11-08 23:45:17,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:45:17,087 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 79 transitions. [2024-11-08 23:45:17,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:45:17,088 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2024-11-08 23:45:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 23:45:17,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:45:17,092 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:45:17,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:45:17,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:45:17,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:45:17,093 INFO L85 PathProgramCache]: Analyzing trace with hash -175708597, now seen corresponding path program 1 times [2024-11-08 23:45:17,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:45:17,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553976702] [2024-11-08 23:45:17,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:45:17,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:45:17,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:45:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:45:17,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:45:17,228 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:45:17,228 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:45:17,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:45:17,232 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 23:45:17,278 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:45:17,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:45:17 BoogieIcfgContainer [2024-11-08 23:45:17,281 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:45:17,282 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:45:17,282 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:45:17,282 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:45:17,282 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:45:15" (3/4) ... [2024-11-08 23:45:17,284 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:45:17,285 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:45:17,286 INFO L158 Benchmark]: Toolchain (without parser) took 2683.47ms. Allocated memory was 167.8MB in the beginning and 232.8MB in the end (delta: 65.0MB). Free memory was 117.0MB in the beginning and 100.7MB in the end (delta: 16.4MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. [2024-11-08 23:45:17,286 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 167.8MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:45:17,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.40ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 102.9MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:45:17,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.66ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 100.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:45:17,287 INFO L158 Benchmark]: Boogie Preprocessor took 64.37ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 96.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:45:17,287 INFO L158 Benchmark]: RCFGBuilder took 466.23ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 80.8MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:45:17,288 INFO L158 Benchmark]: TraceAbstraction took 1759.19ms. Allocated memory was 167.8MB in the beginning and 232.8MB in the end (delta: 65.0MB). Free memory was 80.0MB in the beginning and 101.7MB in the end (delta: -21.8MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2024-11-08 23:45:17,288 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 232.8MB. Free memory was 101.7MB in the beginning and 100.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:45:17,290 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.12ms. Allocated memory is still 167.8MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.40ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 102.9MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.66ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 100.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.37ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 96.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 466.23ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 80.8MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1759.19ms. Allocated memory was 167.8MB in the beginning and 232.8MB in the end (delta: 65.0MB). Free memory was 80.0MB in the beginning and 101.7MB in the end (delta: -21.8MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 232.8MB. Free memory was 101.7MB in the beginning and 100.7MB 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 81, overapproximation of someUnaryDOUBLEoperation at line 24. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] unsigned char var_1_6 = 1; [L24] double var_1_7 = -0.41; [L25] unsigned char var_1_8 = 25; [L26] unsigned char var_1_9 = 100; [L27] unsigned char var_1_10 = 1; [L28] unsigned char var_1_12 = 10; [L29] signed short int var_1_13 = -64; [L30] signed long int var_1_14 = 10; [L31] signed short int var_1_15 = -1; [L32] unsigned char last_1_var_1_8 = 25; [L33] signed long int last_1_var_1_14 = 10; VAL [isInitial=0, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L85] isInitial = 1 [L86] FCALL initially() [L87] int k_loop; [L88] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L88] COND TRUE k_loop < 1 [L89] CALL updateLastVariables() [L77] last_1_var_1_8 = var_1_8 [L78] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L89] RET updateLastVariables() [L90] CALL updateVariables() [L61] var_1_6 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_8=25, var_1_9=100] [L62] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_8=25, var_1_9=100] [L63] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L63] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L64] var_1_7 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L65] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L66] var_1_9 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25] [L67] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25] [L68] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L68] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L69] var_1_10 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L70] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L71] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L71] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L72] var_1_12 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L73] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L74] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L74] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L90] RET updateVariables() [L91] CALL step() [L37] signed long int stepLocal_0 = (((last_1_var_1_8) > ((last_1_var_1_14 + last_1_var_1_14))) ? (last_1_var_1_8) : ((last_1_var_1_14 + last_1_var_1_14))); VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, stepLocal_0=25, var_1_10=2, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L38] COND TRUE last_1_var_1_14 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L39] COND FALSE !(! var_1_6) [L42] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=25, var_1_9=254] [L45] COND TRUE \read(var_1_6) [L46] var_1_8 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=254, var_1_9=254] [L52] COND TRUE (9.99999999999995E13f + var_1_1) >= var_1_1 [L53] var_1_13 = (-4 + var_1_10) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=254, var_1_13=-2, var_1_14=10, var_1_15=-1, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=254, var_1_9=254] [L57] var_1_15 = var_1_12 [L58] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=254, var_1_13=-2, var_1_14=254, var_1_15=254, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=254, var_1_9=254] [L91] RET step() [L92] CALL, EXPR property() [L81-L82] return (((((last_1_var_1_14 <= ((((last_1_var_1_8) > ((last_1_var_1_14 + last_1_var_1_14))) ? (last_1_var_1_8) : ((last_1_var_1_14 + last_1_var_1_14))))) ? ((! var_1_6) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) var_1_7))) : 1) && (var_1_6 ? (var_1_8 == ((unsigned char) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))))) : ((var_1_1 < (var_1_1 + var_1_7)) ? (var_1_8 == ((unsigned char) var_1_12)) : 1))) && (((9.99999999999995E13f + var_1_1) >= var_1_1) ? (var_1_13 == ((signed short int) (-4 + var_1_10))) : (var_1_13 == ((signed short int) (((((var_1_9) < (8)) ? (var_1_9) : (8))) - 32))))) && (var_1_14 == ((signed long int) var_1_15))) && (var_1_15 == ((signed short int) var_1_12)) ; VAL [\result=0, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=254, var_1_13=-2, var_1_14=254, var_1_15=254, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=254, var_1_9=254] [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=254, var_1_13=-2, var_1_14=254, var_1_15=254, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=254, var_1_9=254] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=254, var_1_13=-2, var_1_14=254, var_1_15=254, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=254, var_1_9=254] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 305 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 157 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=3, InterpolantAutomatonStates: 10, 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, 3 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 249 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 432/432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:45:17,323 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.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 8e493bb9dfb1e4026bad014b506150c14522bad4ce88bea6356ffab3296ecf60 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:45:19,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:45:19,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:45:19,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:45:19,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:45:19,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:45:19,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:45:19,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:45:19,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:45:19,624 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:45:19,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:45:19,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:45:19,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:45:19,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:45:19,627 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:45:19,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:45:19,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:45:19,628 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:45:19,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:45:19,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:45:19,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:45:19,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:45:19,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:45:19,634 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:45:19,634 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:45:19,634 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:45:19,634 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:45:19,635 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:45:19,635 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:45:19,635 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:45:19,635 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:45:19,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:45:19,636 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:45:19,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:45:19,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:45:19,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:45:19,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:45:19,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:45:19,639 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:45:19,639 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:45:19,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:45:19,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:45:19,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:45:19,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:45:19,641 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 -> 8e493bb9dfb1e4026bad014b506150c14522bad4ce88bea6356ffab3296ecf60 [2024-11-08 23:45:19,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:45:19,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:45:20,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:45:20,003 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:45:20,003 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:45:20,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.i [2024-11-08 23:45:21,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:45:21,804 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:45:21,805 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.i [2024-11-08 23:45:21,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e581b4e50/713521d006cd472187e39062a09fb1ee/FLAG4a4cbe8cc [2024-11-08 23:45:21,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e581b4e50/713521d006cd472187e39062a09fb1ee [2024-11-08 23:45:21,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:45:21,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:45:21,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:45:21,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:45:21,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:45:21,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:45:21" (1/1) ... [2024-11-08 23:45:21,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28b0711f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:21, skipping insertion in model container [2024-11-08 23:45:21,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:45:21" (1/1) ... [2024-11-08 23:45:21,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:45:22,059 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.i[915,928] [2024-11-08 23:45:22,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:45:22,129 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:45:22,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.i[915,928] [2024-11-08 23:45:22,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:45:22,191 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:45:22,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:22 WrapperNode [2024-11-08 23:45:22,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:45:22,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:45:22,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:45:22,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:45:22,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:22" (1/1) ... [2024-11-08 23:45:22,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:22" (1/1) ... [2024-11-08 23:45:22,240 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-11-08 23:45:22,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:45:22,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:45:22,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:45:22,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:45:22,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:22" (1/1) ... [2024-11-08 23:45:22,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:22" (1/1) ... [2024-11-08 23:45:22,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:22" (1/1) ... [2024-11-08 23:45:22,276 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:45:22,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:22" (1/1) ... [2024-11-08 23:45:22,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:22" (1/1) ... [2024-11-08 23:45:22,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:22" (1/1) ... [2024-11-08 23:45:22,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:22" (1/1) ... [2024-11-08 23:45:22,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:22" (1/1) ... [2024-11-08 23:45:22,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:22" (1/1) ... [2024-11-08 23:45:22,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:45:22,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:45:22,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:45:22,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:45:22,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:22" (1/1) ... [2024-11-08 23:45:22,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:45:22,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:45:22,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:45:22,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:45:22,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:45:22,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:45:22,388 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:45:22,388 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:45:22,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:45:22,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:45:22,476 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:45:22,478 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:45:23,330 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-08 23:45:23,331 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:45:23,341 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:45:23,342 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:45:23,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:45:23 BoogieIcfgContainer [2024-11-08 23:45:23,342 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:45:23,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:45:23,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:45:23,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:45:23,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:45:21" (1/3) ... [2024-11-08 23:45:23,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f778ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:45:23, skipping insertion in model container [2024-11-08 23:45:23,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:45:22" (2/3) ... [2024-11-08 23:45:23,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f778ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:45:23, skipping insertion in model container [2024-11-08 23:45:23,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:45:23" (3/3) ... [2024-11-08 23:45:23,349 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-73.i [2024-11-08 23:45:23,363 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:45:23,363 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:45:23,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:45:23,424 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;@2b3b18b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:45:23,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:45:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 23:45:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 23:45:23,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:45:23,437 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:45:23,438 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:45:23,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:45:23,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1864514382, now seen corresponding path program 1 times [2024-11-08 23:45:23,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:45:23,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098649508] [2024-11-08 23:45:23,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:45:23,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:45:23,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:45:23,465 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:45:23,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:45:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:23,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:45:23,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:45:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 23:45:23,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:45:23,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:45:23,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098649508] [2024-11-08 23:45:23,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098649508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:45:23,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:45:23,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:45:23,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397522541] [2024-11-08 23:45:23,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:45:23,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:45:23,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:45:23,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:45:23,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:45:23,793 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 23:45:23,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:45:23,822 INFO L93 Difference]: Finished difference Result 77 states and 118 transitions. [2024-11-08 23:45:23,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:45:23,825 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2024-11-08 23:45:23,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:45:23,832 INFO L225 Difference]: With dead ends: 77 [2024-11-08 23:45:23,833 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 23:45:23,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:45:23,857 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:45:23,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:45:23,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 23:45:23,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-08 23:45:23,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 23:45:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-08 23:45:23,905 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 63 [2024-11-08 23:45:23,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:45:23,906 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-08 23:45:23,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 23:45:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-08 23:45:23,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 23:45:23,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:45:23,909 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:45:23,920 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-08 23:45:24,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:45:24,115 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:45:24,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:45:24,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1625579600, now seen corresponding path program 1 times [2024-11-08 23:45:24,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:45:24,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108236427] [2024-11-08 23:45:24,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:45:24,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:45:24,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:45:24,119 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:45:24,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:45:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:24,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:45:24,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:45:25,031 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 23:45:25,032 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:45:25,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:45:25,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108236427] [2024-11-08 23:45:25,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108236427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:45:25,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:45:25,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:45:25,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796299940] [2024-11-08 23:45:25,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:45:25,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:45:25,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:45:25,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:45:25,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:45:25,039 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:45:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:45:26,614 INFO L93 Difference]: Finished difference Result 105 states and 145 transitions. [2024-11-08 23:45:26,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:45:26,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2024-11-08 23:45:26,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:45:26,634 INFO L225 Difference]: With dead ends: 105 [2024-11-08 23:45:26,634 INFO L226 Difference]: Without dead ends: 72 [2024-11-08 23:45:26,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:45:26,639 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 37 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:45:26,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 158 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 23:45:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-08 23:45:26,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 57. [2024-11-08 23:45:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:45:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2024-11-08 23:45:26,669 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 63 [2024-11-08 23:45:26,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:45:26,671 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2024-11-08 23:45:26,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:45:26,671 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2024-11-08 23:45:26,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 23:45:26,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:45:26,674 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:45:26,684 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-11-08 23:45:26,875 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-11-08 23:45:26,875 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:45:26,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:45:26,876 INFO L85 PathProgramCache]: Analyzing trace with hash 633638029, now seen corresponding path program 1 times [2024-11-08 23:45:26,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:45:26,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805104120] [2024-11-08 23:45:26,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:45:26,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:45:26,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:45:26,880 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-11-08 23:45:26,881 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-11-08 23:45:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:27,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 23:45:27,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:45:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 23:45:27,088 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:45:27,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:45:27,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805104120] [2024-11-08 23:45:27,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805104120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:45:27,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:45:27,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:45:27,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250538173] [2024-11-08 23:45:27,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:45:27,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:45:27,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:45:27,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:45:27,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:45:27,093 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:45:27,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:45:27,649 INFO L93 Difference]: Finished difference Result 102 states and 138 transitions. [2024-11-08 23:45:27,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:45:27,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2024-11-08 23:45:27,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:45:27,652 INFO L225 Difference]: With dead ends: 102 [2024-11-08 23:45:27,652 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 23:45:27,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:45:27,654 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 14 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:45:27,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 97 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 23:45:27,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 23:45:27,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2024-11-08 23:45:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:45:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 79 transitions. [2024-11-08 23:45:27,667 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 79 transitions. Word has length 64 [2024-11-08 23:45:27,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:45:27,668 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 79 transitions. [2024-11-08 23:45:27,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:45:27,668 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2024-11-08 23:45:27,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 23:45:27,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:45:27,670 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:45:27,680 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 (4)] Ended with exit code 0 [2024-11-08 23:45:27,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:45:27,871 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:45:27,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:45:27,872 INFO L85 PathProgramCache]: Analyzing trace with hash -175708597, now seen corresponding path program 1 times [2024-11-08 23:45:27,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:45:27,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305058085] [2024-11-08 23:45:27,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:45:27,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:45:27,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:45:27,876 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:45:27,877 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 (5)] Waiting until timeout for monitored process [2024-11-08 23:45:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:28,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 23:45:28,047 INFO L278 TraceCheckSpWp]: Computing forward predicates...