./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_amount25_file-7.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 d088ac5fc2da0d72c1ae551d8fda1eb109929d56d90266eacee133c324cf70b8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:31:59,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:31:59,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:31:59,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:31:59,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:31:59,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:31:59,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:31:59,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:31:59,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:31:59,141 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:31:59,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:31:59,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:31:59,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:31:59,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:31:59,143 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:31:59,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:31:59,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:31:59,144 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:31:59,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:31:59,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:31:59,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:31:59,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:31:59,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:31:59,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:31:59,149 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:31:59,150 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:31:59,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:31:59,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:31:59,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:31:59,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:31:59,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:31:59,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:31:59,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:31:59,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:31:59,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:31:59,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:31:59,155 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:31:59,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:31:59,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:31:59,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:31:59,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:31:59,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:31:59,157 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 -> d088ac5fc2da0d72c1ae551d8fda1eb109929d56d90266eacee133c324cf70b8 [2024-11-12 06:31:59,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:31:59,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:31:59,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:31:59,442 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:31:59,442 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:31:59,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-7.i [2024-11-12 06:32:00,907 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:32:01,096 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:32:01,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-7.i [2024-11-12 06:32:01,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42236512d/c08fc41301b64e65a85ca1c7526fb668/FLAG37d50d832 [2024-11-12 06:32:01,492 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42236512d/c08fc41301b64e65a85ca1c7526fb668 [2024-11-12 06:32:01,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:32:01,496 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:32:01,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:32:01,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:32:01,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:32:01,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:32:01" (1/1) ... [2024-11-12 06:32:01,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7cf45d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:01, skipping insertion in model container [2024-11-12 06:32:01,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:32:01" (1/1) ... [2024-11-12 06:32:01,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:32:01,724 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_amount25_file-7.i[914,927] [2024-11-12 06:32:01,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:32:01,804 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:32:01,816 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_amount25_file-7.i[914,927] [2024-11-12 06:32:01,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:32:01,850 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:32:01,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:01 WrapperNode [2024-11-12 06:32:01,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:32:01,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:32:01,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:32:01,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:32:01,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:01" (1/1) ... [2024-11-12 06:32:01,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:01" (1/1) ... [2024-11-12 06:32:01,904 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 79 [2024-11-12 06:32:01,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:32:01,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:32:01,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:32:01,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:32:01,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:01" (1/1) ... [2024-11-12 06:32:01,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:01" (1/1) ... [2024-11-12 06:32:01,923 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:01" (1/1) ... [2024-11-12 06:32:01,934 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-12 06:32:01,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:01" (1/1) ... [2024-11-12 06:32:01,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:01" (1/1) ... [2024-11-12 06:32:01,940 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:01" (1/1) ... [2024-11-12 06:32:01,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:01" (1/1) ... [2024-11-12 06:32:01,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:01" (1/1) ... [2024-11-12 06:32:01,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:01" (1/1) ... [2024-11-12 06:32:01,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:32:01,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:32:01,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:32:01,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:32:01,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:01" (1/1) ... [2024-11-12 06:32:01,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:32:01,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:32:01,986 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-12 06:32:01,989 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-12 06:32:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:32:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:32:02,027 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:32:02,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:32:02,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:32:02,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:32:02,090 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:32:02,092 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:32:02,295 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-12 06:32:02,295 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:32:02,307 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:32:02,307 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:32:02,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:32:02 BoogieIcfgContainer [2024-11-12 06:32:02,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:32:02,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:32:02,310 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:32:02,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:32:02,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:32:01" (1/3) ... [2024-11-12 06:32:02,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a042fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:32:02, skipping insertion in model container [2024-11-12 06:32:02,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:01" (2/3) ... [2024-11-12 06:32:02,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a042fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:32:02, skipping insertion in model container [2024-11-12 06:32:02,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:32:02" (3/3) ... [2024-11-12 06:32:02,317 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-7.i [2024-11-12 06:32:02,330 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:32:02,330 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:32:02,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:32:02,391 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;@d913989, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:32:02,391 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:32:02,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 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-12 06:32:02,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 06:32:02,402 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:32:02,402 INFO L218 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, 1] [2024-11-12 06:32:02,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:32:02,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:32:02,410 INFO L85 PathProgramCache]: Analyzing trace with hash 968799621, now seen corresponding path program 1 times [2024-11-12 06:32:02,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:32:02,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42319042] [2024-11-12 06:32:02,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:32:02,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:32:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:02,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:32:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:02,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 06:32:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:02,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 06:32:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:02,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 06:32:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:02,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 06:32:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:02,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 06:32:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:02,731 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-12 06:32:02,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:32:02,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42319042] [2024-11-12 06:32:02,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42319042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:32:02,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:32:02,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:32:02,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587619172] [2024-11-12 06:32:02,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:32:02,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:32:02,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:32:02,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:32:02,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:32:02,765 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 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 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-12 06:32:02,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:32:02,788 INFO L93 Difference]: Finished difference Result 67 states and 102 transitions. [2024-11-12 06:32:02,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:32:02,790 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (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 48 [2024-11-12 06:32:02,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:32:02,796 INFO L225 Difference]: With dead ends: 67 [2024-11-12 06:32:02,796 INFO L226 Difference]: Without dead ends: 33 [2024-11-12 06:32:02,800 INFO L434 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-12 06:32:02,806 INFO L435 NwaCegarLoop]: 43 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, 43 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-12 06:32:02,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:32:02,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-12 06:32:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-12 06:32:02,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-12 06:32:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-12 06:32:02,842 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 48 [2024-11-12 06:32:02,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:32:02,842 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-12 06:32:02,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (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-12 06:32:02,843 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-12 06:32:02,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 06:32:02,844 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:32:02,845 INFO L218 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, 1] [2024-11-12 06:32:02,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:32:02,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:32:02,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:32:02,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1549515065, now seen corresponding path program 1 times [2024-11-12 06:32:02,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:32:02,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345761805] [2024-11-12 06:32:02,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:32:02,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:32:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:03,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:32:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:03,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 06:32:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:03,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 06:32:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:03,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 06:32:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:03,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 06:32:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:03,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 06:32:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:03,338 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-12 06:32:03,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:32:03,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345761805] [2024-11-12 06:32:03,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345761805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:32:03,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:32:03,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:32:03,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113111059] [2024-11-12 06:32:03,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:32:03,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:32:03,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:32:03,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:32:03,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:32:03,346 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-12 06:32:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:32:03,390 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2024-11-12 06:32:03,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:32:03,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 48 [2024-11-12 06:32:03,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:32:03,392 INFO L225 Difference]: With dead ends: 63 [2024-11-12 06:32:03,392 INFO L226 Difference]: Without dead ends: 33 [2024-11-12 06:32:03,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:32:03,394 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 35 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:32:03,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 41 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:32:03,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-12 06:32:03,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-12 06:32:03,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-12 06:32:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2024-11-12 06:32:03,413 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 48 [2024-11-12 06:32:03,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:32:03,415 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-12 06:32:03,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-12 06:32:03,416 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2024-11-12 06:32:03,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 06:32:03,417 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:32:03,417 INFO L218 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, 1, 1] [2024-11-12 06:32:03,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:32:03,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:32:03,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:32:03,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1025887069, now seen corresponding path program 1 times [2024-11-12 06:32:03,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:32:03,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677287360] [2024-11-12 06:32:03,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:32:03,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:32:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:32:03,465 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:32:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:32:03,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:32:03,522 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:32:03,524 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:32:03,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:32:03,532 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 06:32:03,574 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:32:03,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:32:03 BoogieIcfgContainer [2024-11-12 06:32:03,583 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:32:03,583 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:32:03,583 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:32:03,584 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:32:03,584 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:32:02" (3/4) ... [2024-11-12 06:32:03,587 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:32:03,588 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:32:03,589 INFO L158 Benchmark]: Toolchain (without parser) took 2092.16ms. Allocated memory was 167.8MB in the beginning and 211.8MB in the end (delta: 44.0MB). Free memory was 104.9MB in the beginning and 137.8MB in the end (delta: -32.9MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-11-12 06:32:03,589 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 98.6MB. Free memory was 52.7MB in the beginning and 52.7MB in the end (delta: 70.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:32:03,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.02ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 137.2MB in the end (delta: -32.7MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-11-12 06:32:03,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.00ms. Allocated memory is still 167.8MB. Free memory was 137.2MB in the beginning and 135.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:32:03,591 INFO L158 Benchmark]: Boogie Preprocessor took 37.71ms. Allocated memory is still 167.8MB. Free memory was 135.1MB in the beginning and 132.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 06:32:03,593 INFO L158 Benchmark]: RCFGBuilder took 360.51ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 118.9MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 06:32:03,593 INFO L158 Benchmark]: TraceAbstraction took 1272.72ms. Allocated memory was 167.8MB in the beginning and 211.8MB in the end (delta: 44.0MB). Free memory was 118.4MB in the beginning and 137.8MB in the end (delta: -19.5MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2024-11-12 06:32:03,595 INFO L158 Benchmark]: Witness Printer took 4.62ms. Allocated memory is still 211.8MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:32:03,597 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.18ms. Allocated memory is still 98.6MB. Free memory was 52.7MB in the beginning and 52.7MB in the end (delta: 70.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.02ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 137.2MB in the end (delta: -32.7MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.00ms. Allocated memory is still 167.8MB. Free memory was 137.2MB in the beginning and 135.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.71ms. Allocated memory is still 167.8MB. Free memory was 135.1MB in the beginning and 132.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 360.51ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 118.9MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1272.72ms. Allocated memory was 167.8MB in the beginning and 211.8MB in the end (delta: 44.0MB). Free memory was 118.4MB in the beginning and 137.8MB in the end (delta: -19.5MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * Witness Printer took 4.62ms. Allocated memory is still 211.8MB. Free memory is still 137.8MB. 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 someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] float var_1_2 = 200.875; [L24] float var_1_3 = 8.2; [L25] float var_1_4 = 100000000000.4; [L26] unsigned char var_1_5 = 5; [L27] unsigned long int var_1_6 = 100; [L28] double var_1_9 = 4.6; [L29] double var_1_10 = 2.5; [L30] double last_1_var_1_9 = 4.6; VAL [isInitial=0, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_2=1607/8, var_1_3=41/5, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L80] isInitial = 1 [L81] FCALL initially() [L82] COND TRUE 1 [L83] CALL updateLastVariables() [L73] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_2=1607/8, var_1_3=41/5, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L83] RET updateLastVariables() [L84] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_float() [L61] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_3=41/5, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_3=41/5, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L61] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_3=41/5, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L62] var_1_3 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L63] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L64] var_1_4 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=5, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=5, var_1_6=100, var_1_9=23/5] [L65] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=5, var_1_6=100, var_1_9=23/5] [L66] var_1_5 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_6=100, var_1_9=23/5] [L67] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_6=100, var_1_9=23/5] [L68] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=0, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=0, var_1_6=100, var_1_9=23/5] [L68] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=0, var_1_6=100, var_1_9=23/5] [L69] var_1_10 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_1=1, var_1_5=0, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_1=1, var_1_5=0, var_1_6=100, var_1_9=23/5] [L70] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=1, var_1_5=0, var_1_6=100, var_1_9=23/5] [L84] RET updateVariables() [L85] CALL step() [L34] COND FALSE !(! (last_1_var_1_9 <= (var_1_3 - var_1_4))) [L45] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=0, var_1_5=0, var_1_6=100, var_1_9=23/5] [L47] unsigned char stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=0, var_1_5=0, var_1_6=100, var_1_9=23/5] [L48] COND FALSE !(stepLocal_0 < 0) [L51] var_1_6 = ((((((var_1_5) > (var_1_1)) ? (var_1_5) : (var_1_1))) + ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) + var_1_1) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=0, var_1_5=0, var_1_6=0, var_1_9=23/5] [L53] COND TRUE var_1_1 <= var_1_6 VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=0, var_1_5=0, var_1_6=0, var_1_9=23/5] [L54] COND TRUE var_1_2 >= var_1_3 [L55] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=100000000005, var_1_1=0, var_1_5=0, var_1_6=0, var_1_9=100000000005] [L85] RET step() [L86] CALL, EXPR property() [L76-L77] return (((! (last_1_var_1_9 <= (var_1_3 - var_1_4))) ? ((last_1_var_1_9 < var_1_3) ? ((! (var_1_3 > last_1_var_1_9)) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && ((var_1_5 < 0) ? (var_1_6 == ((unsigned long int) var_1_5)) : (var_1_6 == ((unsigned long int) ((((((var_1_5) > (var_1_1)) ? (var_1_5) : (var_1_1))) + ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) + var_1_1))))) && ((var_1_1 <= var_1_6) ? ((var_1_2 >= var_1_3) ? (var_1_9 == ((double) var_1_10)) : 1) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_9=23/5, var_1_10=100000000005, var_1_1=0, var_1_5=0, var_1_6=0, var_1_9=100000000005] [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=100000000005, var_1_1=0, var_1_5=0, var_1_6=0, var_1_9=100000000005] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=100000000005, var_1_1=0, var_1_5=0, var_1_6=0, var_1_9=100000000005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 83 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 110 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 120/120 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-12 06:32:03,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-7.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 d088ac5fc2da0d72c1ae551d8fda1eb109929d56d90266eacee133c324cf70b8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:32:05,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:32:05,897 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:32:05,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:32:05,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:32:05,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:32:05,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:32:05,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:32:05,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:32:05,943 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:32:05,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:32:05,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:32:05,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:32:05,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:32:05,947 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:32:05,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:32:05,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:32:05,948 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:32:05,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:32:05,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:32:05,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:32:05,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:32:05,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:32:05,950 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:32:05,950 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:32:05,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:32:05,951 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:32:05,951 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:32:05,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:32:05,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:32:05,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:32:05,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:32:05,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:32:05,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:32:05,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:32:05,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:32:05,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:32:05,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:32:05,955 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:32:05,955 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:32:05,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:32:05,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:32:05,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:32:05,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:32:05,956 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 -> d088ac5fc2da0d72c1ae551d8fda1eb109929d56d90266eacee133c324cf70b8 [2024-11-12 06:32:06,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:32:06,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:32:06,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:32:06,319 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:32:06,319 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:32:06,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-7.i [2024-11-12 06:32:07,893 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:32:08,100 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:32:08,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-7.i [2024-11-12 06:32:08,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d737f92b/85b90a04adb7433bbb5142ccfa7b2dd4/FLAG54d6c7755 [2024-11-12 06:32:08,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d737f92b/85b90a04adb7433bbb5142ccfa7b2dd4 [2024-11-12 06:32:08,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:32:08,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:32:08,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:32:08,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:32:08,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:32:08,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:32:08" (1/1) ... [2024-11-12 06:32:08,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@126efcb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:08, skipping insertion in model container [2024-11-12 06:32:08,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:32:08" (1/1) ... [2024-11-12 06:32:08,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:32:08,690 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_amount25_file-7.i[914,927] [2024-11-12 06:32:08,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:32:08,753 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:32:08,765 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_amount25_file-7.i[914,927] [2024-11-12 06:32:08,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:32:08,815 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:32:08,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:08 WrapperNode [2024-11-12 06:32:08,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:32:08,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:32:08,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:32:08,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:32:08,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:08" (1/1) ... [2024-11-12 06:32:08,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:08" (1/1) ... [2024-11-12 06:32:08,873 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 79 [2024-11-12 06:32:08,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:32:08,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:32:08,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:32:08,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:32:08,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:08" (1/1) ... [2024-11-12 06:32:08,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:08" (1/1) ... [2024-11-12 06:32:08,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:08" (1/1) ... [2024-11-12 06:32:08,908 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-12 06:32:08,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:08" (1/1) ... [2024-11-12 06:32:08,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:08" (1/1) ... [2024-11-12 06:32:08,921 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:08" (1/1) ... [2024-11-12 06:32:08,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:08" (1/1) ... [2024-11-12 06:32:08,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:08" (1/1) ... [2024-11-12 06:32:08,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:08" (1/1) ... [2024-11-12 06:32:08,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:32:08,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:32:08,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:32:08,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:32:08,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:08" (1/1) ... [2024-11-12 06:32:08,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:32:08,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:32:08,980 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-12 06:32:08,984 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-12 06:32:09,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:32:09,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:32:09,032 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:32:09,032 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:32:09,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:32:09,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:32:09,118 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:32:09,121 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:32:09,949 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-12 06:32:09,949 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:32:09,962 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:32:09,962 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:32:09,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:32:09 BoogieIcfgContainer [2024-11-12 06:32:09,963 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:32:09,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:32:09,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:32:09,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:32:09,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:32:08" (1/3) ... [2024-11-12 06:32:09,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23169528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:32:09, skipping insertion in model container [2024-11-12 06:32:09,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:08" (2/3) ... [2024-11-12 06:32:09,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23169528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:32:09, skipping insertion in model container [2024-11-12 06:32:09,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:32:09" (3/3) ... [2024-11-12 06:32:09,973 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-7.i [2024-11-12 06:32:09,990 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:32:09,990 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:32:10,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:32:10,065 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;@f762ef9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:32:10,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:32:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 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-12 06:32:10,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 06:32:10,076 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:32:10,077 INFO L218 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, 1] [2024-11-12 06:32:10,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:32:10,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:32:10,083 INFO L85 PathProgramCache]: Analyzing trace with hash 968799621, now seen corresponding path program 1 times [2024-11-12 06:32:10,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:32:10,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884109910] [2024-11-12 06:32:10,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:32:10,096 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-12 06:32:10,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:32:10,100 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-12 06:32:10,101 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-12 06:32:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:10,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:32:10,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:32:10,397 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-12 06:32:10,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:32:10,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:32:10,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884109910] [2024-11-12 06:32:10,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884109910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:32:10,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:32:10,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:32:10,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213587182] [2024-11-12 06:32:10,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:32:10,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:32:10,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:32:10,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:32:10,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:32:10,431 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 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 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-12 06:32:10,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:32:10,455 INFO L93 Difference]: Finished difference Result 67 states and 102 transitions. [2024-11-12 06:32:10,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:32:10,458 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (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 48 [2024-11-12 06:32:10,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:32:10,465 INFO L225 Difference]: With dead ends: 67 [2024-11-12 06:32:10,466 INFO L226 Difference]: Without dead ends: 33 [2024-11-12 06:32:10,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-12 06:32:10,475 INFO L435 NwaCegarLoop]: 43 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, 43 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-12 06:32:10,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:32:10,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-12 06:32:10,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-12 06:32:10,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-12 06:32:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-12 06:32:10,520 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 48 [2024-11-12 06:32:10,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:32:10,521 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-12 06:32:10,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (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-12 06:32:10,522 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-12 06:32:10,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 06:32:10,525 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:32:10,525 INFO L218 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, 1] [2024-11-12 06:32:10,535 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-12 06:32:10,729 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-12 06:32:10,730 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:32:10,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:32:10,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1549515065, now seen corresponding path program 1 times [2024-11-12 06:32:10,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:32:10,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869169015] [2024-11-12 06:32:10,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:32:10,734 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-12 06:32:10,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:32:10,738 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-12 06:32:10,740 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-12 06:32:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:10,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 06:32:10,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:32:11,148 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-12 06:32:11,148 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:32:11,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:32:11,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1869169015] [2024-11-12 06:32:11,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1869169015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:32:11,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:32:11,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 06:32:11,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916680955] [2024-11-12 06:32:11,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:32:11,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:32:11,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:32:11,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:32:11,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:32:11,153 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-12 06:32:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:32:11,624 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2024-11-12 06:32:11,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:32:11,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 48 [2024-11-12 06:32:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:32:11,627 INFO L225 Difference]: With dead ends: 75 [2024-11-12 06:32:11,627 INFO L226 Difference]: Without dead ends: 45 [2024-11-12 06:32:11,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:32:11,629 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 38 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 06:32:11,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 75 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 06:32:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-12 06:32:11,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-11-12 06:32:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 06:32:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2024-11-12 06:32:11,641 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 48 [2024-11-12 06:32:11,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:32:11,641 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2024-11-12 06:32:11,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-12 06:32:11,642 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2024-11-12 06:32:11,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 06:32:11,646 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:32:11,646 INFO L218 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, 1, 1] [2024-11-12 06:32:11,655 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 (3)] Forceful destruction successful, exit code 0 [2024-11-12 06:32:11,846 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-12 06:32:11,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:32:11,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:32:11,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1025887069, now seen corresponding path program 1 times [2024-11-12 06:32:11,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:32:11,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262687444] [2024-11-12 06:32:11,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:32:11,850 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-12 06:32:11,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:32:11,852 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-12 06:32:11,853 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-12 06:32:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:12,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 06:32:12,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:32:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-12 06:32:39,680 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:32:39,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:32:39,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262687444] [2024-11-12 06:32:39,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262687444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:32:39,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:32:39,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 06:32:39,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811974352] [2024-11-12 06:32:39,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:32:39,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 06:32:39,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:32:39,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 06:32:39,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-12 06:32:39,684 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 06:32:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:32:42,082 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2024-11-12 06:32:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 06:32:42,083 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2024-11-12 06:32:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:32:42,085 INFO L225 Difference]: With dead ends: 69 [2024-11-12 06:32:42,085 INFO L226 Difference]: Without dead ends: 67 [2024-11-12 06:32:42,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2024-11-12 06:32:42,087 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 85 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-12 06:32:42,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 135 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-12 06:32:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-12 06:32:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2024-11-12 06:32:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 06:32:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2024-11-12 06:32:42,106 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 49 [2024-11-12 06:32:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:32:42,107 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2024-11-12 06:32:42,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 06:32:42,107 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2024-11-12 06:32:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 06:32:42,108 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:32:42,109 INFO L218 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, 1, 1] [2024-11-12 06:32:42,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 06:32:42,309 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-12 06:32:42,310 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:32:42,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:32:42,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1024040027, now seen corresponding path program 1 times [2024-11-12 06:32:42,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:32:42,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511512583] [2024-11-12 06:32:42,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:32:42,316 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-12 06:32:42,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:32:42,318 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-12 06:32:42,319 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-12 06:32:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:42,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 06:32:42,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:32:53,784 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-12 06:32:53,785 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:32:53,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:32:53,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511512583] [2024-11-12 06:32:53,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511512583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:32:53,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:32:53,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 06:32:53,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905897447] [2024-11-12 06:32:53,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:32:53,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 06:32:53,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:32:53,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 06:32:53,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:32:53,788 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-12 06:32:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:32:54,365 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-11-12 06:32:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 06:32:54,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 49 [2024-11-12 06:32:54,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:32:54,366 INFO L225 Difference]: With dead ends: 55 [2024-11-12 06:32:54,366 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 06:32:54,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 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-12 06:32:54,368 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 23 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 06:32:54,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 208 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 06:32:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 06:32:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 06:32:54,369 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-12 06:32:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 06:32:54,370 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2024-11-12 06:32:54,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:32:54,370 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 06:32:54,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-12 06:32:54,370 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 06:32:54,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 06:32:54,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:32:54,383 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 (5)] Forceful destruction successful, exit code 0 [2024-11-12 06:32:54,574 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-12 06:32:54,578 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 06:32:54,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 06:32:55,271 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:32:55,285 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:32:55,286 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:32:55,287 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:32:55,287 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:32:55,288 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 06:32:55,288 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:32:55,293 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 06:32:55,293 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:32:55,296 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 06:32:55,297 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:32:55,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:32:55 BoogieIcfgContainer [2024-11-12 06:32:55,302 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:32:55,303 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:32:55,303 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:32:55,303 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:32:55,304 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:32:09" (3/4) ... [2024-11-12 06:32:55,306 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 06:32:55,311 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 06:32:55,316 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-12 06:32:55,318 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 06:32:55,318 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 06:32:55,318 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 06:32:55,431 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 06:32:55,432 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 06:32:55,432 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:32:55,433 INFO L158 Benchmark]: Toolchain (without parser) took 46965.42ms. Allocated memory was 79.7MB in the beginning and 966.8MB in the end (delta: 887.1MB). Free memory was 45.1MB in the beginning and 449.7MB in the end (delta: -404.6MB). Peak memory consumption was 482.0MB. Max. memory is 16.1GB. [2024-11-12 06:32:55,433 INFO L158 Benchmark]: CDTParser took 0.95ms. Allocated memory is still 50.3MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:32:55,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.06ms. Allocated memory is still 79.7MB. Free memory was 45.1MB in the beginning and 52.6MB in the end (delta: -7.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-11-12 06:32:55,434 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.70ms. Allocated memory is still 79.7MB. Free memory was 52.6MB in the beginning and 51.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:32:55,434 INFO L158 Benchmark]: Boogie Preprocessor took 64.92ms. Allocated memory is still 79.7MB. Free memory was 51.0MB in the beginning and 48.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 06:32:55,434 INFO L158 Benchmark]: RCFGBuilder took 1022.20ms. Allocated memory is still 79.7MB. Free memory was 48.1MB in the beginning and 35.2MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 06:32:55,435 INFO L158 Benchmark]: TraceAbstraction took 45336.57ms. Allocated memory was 79.7MB in the beginning and 966.8MB in the end (delta: 887.1MB). Free memory was 34.4MB in the beginning and 454.9MB in the end (delta: -420.5MB). Peak memory consumption was 466.4MB. Max. memory is 16.1GB. [2024-11-12 06:32:55,435 INFO L158 Benchmark]: Witness Printer took 129.74ms. Allocated memory is still 966.8MB. Free memory was 454.9MB in the beginning and 449.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 06:32:55,436 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.95ms. Allocated memory is still 50.3MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.06ms. Allocated memory is still 79.7MB. Free memory was 45.1MB in the beginning and 52.6MB in the end (delta: -7.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.70ms. Allocated memory is still 79.7MB. Free memory was 52.6MB in the beginning and 51.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.92ms. Allocated memory is still 79.7MB. Free memory was 51.0MB in the beginning and 48.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1022.20ms. Allocated memory is still 79.7MB. Free memory was 48.1MB in the beginning and 35.2MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 45336.57ms. Allocated memory was 79.7MB in the beginning and 966.8MB in the end (delta: 887.1MB). Free memory was 34.4MB in the beginning and 454.9MB in the end (delta: -420.5MB). Peak memory consumption was 466.4MB. Max. memory is 16.1GB. * Witness Printer took 129.74ms. Allocated memory is still 966.8MB. Free memory was 454.9MB in the beginning and 449.7MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.5s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 146 mSDsluCounter, 461 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 282 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 278 IncrementalHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 179 mSDtfsCounter, 278 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=3, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 39.3s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 601 SizeOfPredicates, 15 NumberOfNonLiveVariables, 346 ConjunctsInSsa, 29 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: 82]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && ((((((((((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))) && (var_1_6 == \old(var_1_6))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (last_1_var_1_9 == \old(last_1_var_1_9)))) RESULT: Ultimate proved your program to be correct! [2024-11-12 06:32:55,487 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 Writing output log to file Ultimate.log Result: TRUE