./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_operatoramount_amount10_file-35.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 0296c2c765da5a529e1bbaf319642b95a8aa6afdf63ae3123d19a38a95241bba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:16:58,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:16:58,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:16:58,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:16:58,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:16:58,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:16:58,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:16:58,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:16:58,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:16:58,934 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:16:58,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:16:58,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:16:58,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:16:58,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:16:58,937 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:16:58,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:16:58,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:16:58,937 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:16:58,938 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:16:58,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:16:58,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:16:58,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:16:58,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:16:58,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:16:58,942 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:16:58,942 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:16:58,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:16:58,942 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:16:58,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:16:58,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:16:58,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:16:58,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:16:58,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:16:58,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:16:58,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:16:58,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:16:58,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:16:58,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:16:58,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:16:58,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:16:58,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:16:58,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:16:58,945 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 -> 0296c2c765da5a529e1bbaf319642b95a8aa6afdf63ae3123d19a38a95241bba [2024-11-10 08:16:59,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:16:59,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:16:59,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:16:59,205 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:16:59,205 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:16:59,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-35.i [2024-11-10 08:17:00,739 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:17:00,934 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:17:00,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-35.i [2024-11-10 08:17:00,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25ff02b2e/e4305cc63f234d4fac64974d85e1e147/FLAGd333ac86c [2024-11-10 08:17:00,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25ff02b2e/e4305cc63f234d4fac64974d85e1e147 [2024-11-10 08:17:00,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:17:00,960 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:17:00,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:17:00,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:17:00,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:17:00,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:17:00" (1/1) ... [2024-11-10 08:17:00,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11451a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:00, skipping insertion in model container [2024-11-10 08:17:00,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:17:00" (1/1) ... [2024-11-10 08:17:00,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:17:01,109 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_operatoramount_amount10_file-35.i[915,928] [2024-11-10 08:17:01,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:17:01,148 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:17:01,172 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_operatoramount_amount10_file-35.i[915,928] [2024-11-10 08:17:01,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:17:01,200 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:17:01,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:01 WrapperNode [2024-11-10 08:17:01,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:17:01,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:17:01,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:17:01,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:17:01,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:01" (1/1) ... [2024-11-10 08:17:01,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:01" (1/1) ... [2024-11-10 08:17:01,242 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 61 [2024-11-10 08:17:01,243 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:17:01,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:17:01,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:17:01,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:17:01,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:01" (1/1) ... [2024-11-10 08:17:01,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:01" (1/1) ... [2024-11-10 08:17:01,256 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:01" (1/1) ... [2024-11-10 08:17:01,270 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-10 08:17:01,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:01" (1/1) ... [2024-11-10 08:17:01,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:01" (1/1) ... [2024-11-10 08:17:01,274 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:01" (1/1) ... [2024-11-10 08:17:01,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:01" (1/1) ... [2024-11-10 08:17:01,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:01" (1/1) ... [2024-11-10 08:17:01,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:01" (1/1) ... [2024-11-10 08:17:01,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:17:01,279 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:17:01,279 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:17:01,279 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:17:01,280 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:01" (1/1) ... [2024-11-10 08:17:01,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:17:01,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:17:01,313 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-10 08:17:01,320 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-10 08:17:01,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:17:01,365 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:17:01,365 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:17:01,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:17:01,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:17:01,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:17:01,464 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:17:01,471 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:17:01,783 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 08:17:01,784 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:17:01,804 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:17:01,812 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:17:01,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:01 BoogieIcfgContainer [2024-11-10 08:17:01,813 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:17:01,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:17:01,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:17:01,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:17:01,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:17:00" (1/3) ... [2024-11-10 08:17:01,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa4b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:17:01, skipping insertion in model container [2024-11-10 08:17:01,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:01" (2/3) ... [2024-11-10 08:17:01,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa4b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:17:01, skipping insertion in model container [2024-11-10 08:17:01,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:01" (3/3) ... [2024-11-10 08:17:01,836 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-35.i [2024-11-10 08:17:01,855 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:17:01,855 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:17:01,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:17:01,962 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;@1a3c12b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:17:01,963 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:17:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 08:17:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 08:17:01,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:01,978 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 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-10 08:17:01,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:01,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:01,983 INFO L85 PathProgramCache]: Analyzing trace with hash 755728299, now seen corresponding path program 1 times [2024-11-10 08:17:01,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:17:01,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958136493] [2024-11-10 08:17:01,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:01,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:17:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:02,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:17:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:02,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:17:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:02,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:17:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:02,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:17:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:02,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:17:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:02,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:17:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 08:17:02,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:17:02,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958136493] [2024-11-10 08:17:02,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958136493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:17:02,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:17:02,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:17:02,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624811552] [2024-11-10 08:17:02,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:17:02,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:17:02,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:17:02,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:17:02,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:17:02,359 INFO L87 Difference]: Start difference. First operand has 34 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 08:17:02,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:17:02,377 INFO L93 Difference]: Finished difference Result 60 states and 87 transitions. [2024-11-10 08:17:02,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:17:02,382 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2024-11-10 08:17:02,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:17:02,388 INFO L225 Difference]: With dead ends: 60 [2024-11-10 08:17:02,389 INFO L226 Difference]: Without dead ends: 29 [2024-11-10 08:17:02,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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-10 08:17:02,395 INFO L432 NwaCegarLoop]: 36 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, 36 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-10 08:17:02,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:17:02,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-10 08:17:02,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-10 08:17:02,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 08:17:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-10 08:17:02,435 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 46 [2024-11-10 08:17:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:17:02,436 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-10 08:17:02,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 08:17:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-10 08:17:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 08:17:02,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:02,438 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 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-10 08:17:02,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:17:02,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:02,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:02,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1115894859, now seen corresponding path program 1 times [2024-11-10 08:17:02,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:17:02,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870108883] [2024-11-10 08:17:02,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:02,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:17:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:17:02,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 08:17:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:17:02,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 08:17:02,583 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 08:17:02,585 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:17:02,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:17:02,588 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 08:17:02,628 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:17:02,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:17:02 BoogieIcfgContainer [2024-11-10 08:17:02,635 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:17:02,635 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:17:02,636 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:17:02,636 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:17:02,636 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:01" (3/4) ... [2024-11-10 08:17:02,640 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 08:17:02,642 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:17:02,642 INFO L158 Benchmark]: Toolchain (without parser) took 1682.63ms. Allocated memory is still 209.7MB. Free memory was 177.2MB in the beginning and 138.6MB in the end (delta: 38.5MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2024-11-10 08:17:02,643 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:17:02,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.27ms. Allocated memory is still 209.7MB. Free memory was 177.2MB in the beginning and 163.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:17:02,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.27ms. Allocated memory is still 209.7MB. Free memory was 163.7MB in the beginning and 162.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:17:02,645 INFO L158 Benchmark]: Boogie Preprocessor took 34.65ms. Allocated memory is still 209.7MB. Free memory was 162.6MB in the beginning and 160.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:17:02,645 INFO L158 Benchmark]: IcfgBuilder took 534.22ms. Allocated memory is still 209.7MB. Free memory was 160.6MB in the beginning and 174.3MB in the end (delta: -13.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 08:17:02,648 INFO L158 Benchmark]: TraceAbstraction took 820.21ms. Allocated memory is still 209.7MB. Free memory was 173.2MB in the beginning and 138.6MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-10 08:17:02,649 INFO L158 Benchmark]: Witness Printer took 6.38ms. Allocated memory is still 209.7MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:17:02,651 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.14ms. Allocated memory is still 104.9MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.27ms. Allocated memory is still 209.7MB. Free memory was 177.2MB in the beginning and 163.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.27ms. Allocated memory is still 209.7MB. Free memory was 163.7MB in the beginning and 162.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.65ms. Allocated memory is still 209.7MB. Free memory was 162.6MB in the beginning and 160.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 534.22ms. Allocated memory is still 209.7MB. Free memory was 160.6MB in the beginning and 174.3MB in the end (delta: -13.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 820.21ms. Allocated memory is still 209.7MB. Free memory was 173.2MB in the beginning and 138.6MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 6.38ms. Allocated memory is still 209.7MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -2; [L23] signed char var_1_2 = 32; [L24] signed char var_1_3 = 2; [L25] signed char var_1_4 = 10; [L26] double var_1_5 = 4.4; VAL [isInitial=0, var_1_1=-2, var_1_2=32, var_1_3=2, var_1_4=10, var_1_5=22/5] [L57] isInitial = 1 [L58] FCALL initially() [L59] COND TRUE 1 [L60] FCALL updateLastVariables() [L61] CALL updateVariables() [L40] var_1_2 = __VERIFIER_nondet_char() [L41] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=2, var_1_4=10, var_1_5=22/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=2, var_1_4=10, var_1_5=22/5] [L41] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=2, var_1_4=10, var_1_5=22/5] [L42] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=2, var_1_4=10, var_1_5=22/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=2, var_1_4=10, var_1_5=22/5] [L42] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=2, var_1_4=10, var_1_5=22/5] [L43] var_1_3 = __VERIFIER_nondet_char() [L44] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=4, var_1_4=10, var_1_5=22/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=4, var_1_4=10, var_1_5=22/5] [L44] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=4, var_1_4=10, var_1_5=22/5] [L45] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=4, var_1_4=10, var_1_5=22/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=4, var_1_4=10, var_1_5=22/5] [L45] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=4, var_1_4=10, var_1_5=22/5] [L46] var_1_4 = __VERIFIER_nondet_char() [L47] CALL assume_abort_if_not(var_1_4 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=4, var_1_4=0, var_1_5=22/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=4, var_1_4=0, var_1_5=22/5] [L47] RET assume_abort_if_not(var_1_4 >= -128) VAL [isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=4, var_1_4=0, var_1_5=22/5] [L48] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=4, var_1_4=0, var_1_5=22/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=4, var_1_4=0, var_1_5=22/5] [L48] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=4, var_1_4=0, var_1_5=22/5] [L61] RET updateVariables() [L62] CALL step() [L30] COND TRUE var_1_2 != var_1_3 [L31] var_1_1 = ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=0, var_1_5=22/5] [L37] var_1_5 = 9999.5 VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=0, var_1_5=19999/2] [L62] RET step() [L63] CALL, EXPR property() [L53-L54] return ((var_1_2 != var_1_3) ? (var_1_1 == ((signed short int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))))) : ((var_1_3 <= ((((var_1_2) < (var_1_4)) ? (var_1_2) : (var_1_4)))) ? (var_1_1 == ((signed short int) (var_1_3 + var_1_4))) : 1)) && (var_1_5 == ((double) 9999.5)) ; VAL [\result=0, isInitial=1, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=0, var_1_5=19999/2] [L63] RET, EXPR property() [L63] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=0, var_1_5=19999/2] [L19] reach_error() VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=0, var_1_5=19999/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 36 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 45 ConstructedInterpolants, 0 QuantifiedInterpolants, 45 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 60/60 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-10 08:17:02,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-35.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 0296c2c765da5a529e1bbaf319642b95a8aa6afdf63ae3123d19a38a95241bba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:17:04,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:17:04,906 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 08:17:04,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:17:04,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:17:04,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:17:04,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:17:04,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:17:04,935 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:17:04,936 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:17:04,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:17:04,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:17:04,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:17:04,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:17:04,937 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:17:04,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:17:04,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:17:04,938 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:17:04,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:17:04,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:17:04,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:17:04,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:17:04,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:17:04,940 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 08:17:04,940 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 08:17:04,941 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:17:04,941 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 08:17:04,941 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:17:04,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:17:04,942 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:17:04,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:17:04,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:17:04,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:17:04,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:17:04,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:17:04,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:17:04,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:17:04,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:17:04,945 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 08:17:04,945 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 08:17:04,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:17:04,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:17:04,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:17:04,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:17:04,949 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0296c2c765da5a529e1bbaf319642b95a8aa6afdf63ae3123d19a38a95241bba [2024-11-10 08:17:05,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:17:05,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:17:05,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:17:05,223 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:17:05,223 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:17:05,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-35.i [2024-11-10 08:17:06,531 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:17:06,751 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:17:06,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-35.i [2024-11-10 08:17:06,761 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5869b893b/7e1122bc1827405f873ea81e8186784d/FLAG62a255a42 [2024-11-10 08:17:06,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5869b893b/7e1122bc1827405f873ea81e8186784d [2024-11-10 08:17:06,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:17:06,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:17:06,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:17:06,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:17:06,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:17:06,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:17:06" (1/1) ... [2024-11-10 08:17:06,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f194f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:06, skipping insertion in model container [2024-11-10 08:17:06,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:17:06" (1/1) ... [2024-11-10 08:17:06,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:17:06,967 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_operatoramount_amount10_file-35.i[915,928] [2024-11-10 08:17:06,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:17:07,004 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:17:07,017 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_operatoramount_amount10_file-35.i[915,928] [2024-11-10 08:17:07,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:17:07,046 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:17:07,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:07 WrapperNode [2024-11-10 08:17:07,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:17:07,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:17:07,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:17:07,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:17:07,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:07" (1/1) ... [2024-11-10 08:17:07,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:07" (1/1) ... [2024-11-10 08:17:07,077 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 58 [2024-11-10 08:17:07,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:17:07,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:17:07,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:17:07,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:17:07,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:07" (1/1) ... [2024-11-10 08:17:07,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:07" (1/1) ... [2024-11-10 08:17:07,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:07" (1/1) ... [2024-11-10 08:17:07,107 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-10 08:17:07,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:07" (1/1) ... [2024-11-10 08:17:07,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:07" (1/1) ... [2024-11-10 08:17:07,113 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:07" (1/1) ... [2024-11-10 08:17:07,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:07" (1/1) ... [2024-11-10 08:17:07,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:07" (1/1) ... [2024-11-10 08:17:07,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:07" (1/1) ... [2024-11-10 08:17:07,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:17:07,123 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:17:07,123 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:17:07,123 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:17:07,124 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:07" (1/1) ... [2024-11-10 08:17:07,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:17:07,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:17:07,150 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-10 08:17:07,154 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-10 08:17:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:17:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 08:17:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:17:07,249 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:17:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:17:07,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:17:07,320 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:17:07,322 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:17:07,506 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 08:17:07,506 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:17:07,521 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:17:07,523 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:17:07,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:07 BoogieIcfgContainer [2024-11-10 08:17:07,524 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:17:07,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:17:07,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:17:07,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:17:07,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:17:06" (1/3) ... [2024-11-10 08:17:07,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a8bb47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:17:07, skipping insertion in model container [2024-11-10 08:17:07,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:07" (2/3) ... [2024-11-10 08:17:07,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a8bb47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:17:07, skipping insertion in model container [2024-11-10 08:17:07,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:07" (3/3) ... [2024-11-10 08:17:07,535 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-35.i [2024-11-10 08:17:07,553 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:17:07,554 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:17:07,621 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:17:07,627 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;@11437d37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:17:07,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:17:07,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 08:17:07,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 08:17:07,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:07,644 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 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-10 08:17:07,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:07,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:07,652 INFO L85 PathProgramCache]: Analyzing trace with hash 755728299, now seen corresponding path program 1 times [2024-11-10 08:17:07,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:17:07,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968170442] [2024-11-10 08:17:07,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:07,667 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-10 08:17:07,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:17:07,675 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-10 08:17:07,678 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-10 08:17:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:07,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 08:17:07,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:17:07,836 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 08:17:07,836 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:17:07,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:17:07,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968170442] [2024-11-10 08:17:07,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968170442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:17:07,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:17:07,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:17:07,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377804081] [2024-11-10 08:17:07,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:17:07,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:17:07,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:17:07,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:17:07,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:17:07,872 INFO L87 Difference]: Start difference. First operand has 34 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 08:17:07,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:17:07,896 INFO L93 Difference]: Finished difference Result 60 states and 87 transitions. [2024-11-10 08:17:07,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:17:07,898 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2024-11-10 08:17:07,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:17:07,904 INFO L225 Difference]: With dead ends: 60 [2024-11-10 08:17:07,904 INFO L226 Difference]: Without dead ends: 29 [2024-11-10 08:17:07,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 45 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-10 08:17:07,913 INFO L432 NwaCegarLoop]: 36 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, 36 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-10 08:17:07,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:17:07,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-10 08:17:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-10 08:17:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 08:17:07,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-10 08:17:07,955 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 46 [2024-11-10 08:17:07,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:17:07,956 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-10 08:17:07,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 08:17:07,957 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-10 08:17:07,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 08:17:07,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:07,960 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 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-10 08:17:07,966 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-10 08:17:08,164 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-10 08:17:08,165 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:08,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:08,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1115894859, now seen corresponding path program 1 times [2024-11-10 08:17:08,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:17:08,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935737983] [2024-11-10 08:17:08,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:08,186 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-10 08:17:08,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:17:08,190 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-10 08:17:08,191 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-10 08:17:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:08,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 08:17:08,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:17:10,575 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 08:17:10,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:17:10,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:17:10,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935737983] [2024-11-10 08:17:10,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935737983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:17:10,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:17:10,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:17:10,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79773700] [2024-11-10 08:17:10,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:17:10,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:17:10,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:17:10,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:17:10,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:17:10,580 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-10 08:17:10,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:17:10,725 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-10 08:17:10,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:17:10,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2024-11-10 08:17:10,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:17:10,727 INFO L225 Difference]: With dead ends: 40 [2024-11-10 08:17:10,728 INFO L226 Difference]: Without dead ends: 37 [2024-11-10 08:17:10,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:17:10,729 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:17:10,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 153 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:17:10,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-10 08:17:10,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2024-11-10 08:17:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 08:17:10,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-11-10 08:17:10,740 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 46 [2024-11-10 08:17:10,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:17:10,742 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-10 08:17:10,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-10 08:17:10,742 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-11-10 08:17:10,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 08:17:10,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:10,748 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 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-10 08:17:10,755 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-10 08:17:10,949 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-10 08:17:10,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:10,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:10,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1322957190, now seen corresponding path program 1 times [2024-11-10 08:17:10,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:17:10,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002649883] [2024-11-10 08:17:10,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:10,956 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-10 08:17:10,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:17:10,959 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-10 08:17:10,971 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-10 08:17:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:11,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 08:17:11,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:17:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 08:17:11,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:17:11,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:17:11,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002649883] [2024-11-10 08:17:11,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002649883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:17:11,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:17:11,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 08:17:11,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790184443] [2024-11-10 08:17:11,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:17:11,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 08:17:11,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:17:11,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 08:17:11,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:17:11,902 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-10 08:17:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:17:12,008 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2024-11-10 08:17:12,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 08:17:12,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 47 [2024-11-10 08:17:12,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:17:12,010 INFO L225 Difference]: With dead ends: 48 [2024-11-10 08:17:12,010 INFO L226 Difference]: Without dead ends: 45 [2024-11-10 08:17:12,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:17:12,011 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:17:12,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 165 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:17:12,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-10 08:17:12,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2024-11-10 08:17:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 08:17:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-11-10 08:17:12,016 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 47 [2024-11-10 08:17:12,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:17:12,018 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-10 08:17:12,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-10 08:17:12,018 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-11-10 08:17:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 08:17:12,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:12,019 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 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-10 08:17:12,028 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 (4)] Forceful destruction successful, exit code 0 [2024-11-10 08:17:12,221 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-10 08:17:12,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:12,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:12,222 INFO L85 PathProgramCache]: Analyzing trace with hash -435453509, now seen corresponding path program 1 times [2024-11-10 08:17:12,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:17:12,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202147040] [2024-11-10 08:17:12,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:12,223 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-10 08:17:12,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:17:12,228 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-10 08:17:12,229 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-10 08:17:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:12,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 08:17:12,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:17:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 08:17:13,201 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:17:13,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:17:13,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202147040] [2024-11-10 08:17:13,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202147040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:17:13,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:17:13,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 08:17:13,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118218669] [2024-11-10 08:17:13,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:17:13,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 08:17:13,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:17:13,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 08:17:13,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:17:13,204 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-10 08:17:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:17:13,287 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2024-11-10 08:17:13,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 08:17:13,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 47 [2024-11-10 08:17:13,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:17:13,288 INFO L225 Difference]: With dead ends: 45 [2024-11-10 08:17:13,288 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 08:17:13,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:17:13,289 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 14 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:17:13,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 168 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:17:13,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 08:17:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 08:17:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 08:17:13,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 08:17:13,291 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2024-11-10 08:17:13,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:17:13,291 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 08:17:13,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-10 08:17:13,291 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 08:17:13,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 08:17:13,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:17:13,299 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 (5)] Ended with exit code 0 [2024-11-10 08:17:13,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-10 08:17:13,500 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 08:17:13,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 08:17:13,515 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:17:13,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:17:13 BoogieIcfgContainer [2024-11-10 08:17:13,529 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:17:13,530 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:17:13,530 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:17:13,530 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:17:13,531 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:07" (3/4) ... [2024-11-10 08:17:13,533 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 08:17:13,536 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 08:17:13,539 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 08:17:13,539 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-10 08:17:13,539 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 08:17:13,540 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 08:17:13,613 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 08:17:13,613 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 08:17:13,613 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:17:13,614 INFO L158 Benchmark]: Toolchain (without parser) took 6831.43ms. Allocated memory was 73.4MB in the beginning and 402.7MB in the end (delta: 329.3MB). Free memory was 51.3MB in the beginning and 178.4MB in the end (delta: -127.1MB). Peak memory consumption was 204.8MB. Max. memory is 16.1GB. [2024-11-10 08:17:13,614 INFO L158 Benchmark]: CDTParser took 2.66ms. Allocated memory is still 73.4MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:17:13,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.51ms. Allocated memory is still 73.4MB. Free memory was 51.1MB in the beginning and 37.5MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 08:17:13,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.31ms. Allocated memory is still 73.4MB. Free memory was 37.5MB in the beginning and 35.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:17:13,615 INFO L158 Benchmark]: Boogie Preprocessor took 43.59ms. Allocated memory is still 73.4MB. Free memory was 35.8MB in the beginning and 33.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:17:13,615 INFO L158 Benchmark]: IcfgBuilder took 401.00ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 33.7MB in the beginning and 66.2MB in the end (delta: -32.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 08:17:13,615 INFO L158 Benchmark]: TraceAbstraction took 6002.58ms. Allocated memory was 96.5MB in the beginning and 402.7MB in the end (delta: 306.2MB). Free memory was 65.4MB in the beginning and 183.6MB in the end (delta: -118.3MB). Peak memory consumption was 188.8MB. Max. memory is 16.1GB. [2024-11-10 08:17:13,616 INFO L158 Benchmark]: Witness Printer took 83.14ms. Allocated memory is still 402.7MB. Free memory was 183.6MB in the beginning and 178.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 08:17:13,617 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.66ms. Allocated memory is still 73.4MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.51ms. Allocated memory is still 73.4MB. Free memory was 51.1MB in the beginning and 37.5MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.31ms. Allocated memory is still 73.4MB. Free memory was 37.5MB in the beginning and 35.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.59ms. Allocated memory is still 73.4MB. Free memory was 35.8MB in the beginning and 33.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 401.00ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 33.7MB in the beginning and 66.2MB in the end (delta: -32.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6002.58ms. Allocated memory was 96.5MB in the beginning and 402.7MB in the end (delta: 306.2MB). Free memory was 65.4MB in the beginning and 183.6MB in the end (delta: -118.3MB). Peak memory consumption was 188.8MB. Max. memory is 16.1GB. * Witness Printer took 83.14ms. Allocated memory is still 402.7MB. Free memory was 183.6MB in the beginning and 178.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 522 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 368 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 151 IncrementalHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 154 mSDtfsCounter, 151 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 323 SizeOfPredicates, 18 NumberOfNonLiveVariables, 317 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 240/240 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 59]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) RESULT: Ultimate proved your program to be correct! [2024-11-10 08:17:13,648 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 Writing output log to file Ultimate.log Result: TRUE