./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.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 31c38fc0029b15eea235546e14c5b61b4e70b436ee39f6c640a47d6a6b4e9a18 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:27:31,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:27:31,203 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 07:27:31,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:27:31,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:27:31,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:27:31,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:27:31,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:27:31,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:27:31,235 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:27:31,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:27:31,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:27:31,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:27:31,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:27:31,236 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:27:31,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:27:31,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:27:31,237 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:27:31,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 07:27:31,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:27:31,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:27:31,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:27:31,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:27:31,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:27:31,238 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:27:31,238 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:27:31,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:27:31,239 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:27:31,239 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:27:31,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:27:31,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:27:31,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:27:31,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:27:31,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:27:31,241 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:27:31,241 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:27:31,241 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 07:27:31,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 07:27:31,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:27:31,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:27:31,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:27:31,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:27:31,243 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31c38fc0029b15eea235546e14c5b61b4e70b436ee39f6c640a47d6a6b4e9a18 [2024-11-20 07:27:31,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:27:31,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:27:31,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:27:31,463 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:27:31,463 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:27:31,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.i [2024-11-20 07:27:32,752 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:27:32,958 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:27:32,958 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.i [2024-11-20 07:27:32,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/593ca231a/16db2b1fab8840219ab960d5a8544370/FLAG586d0fcca [2024-11-20 07:27:32,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/593ca231a/16db2b1fab8840219ab960d5a8544370 [2024-11-20 07:27:32,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:27:32,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:27:32,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:27:32,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:27:32,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:27:32,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:27:32" (1/1) ... [2024-11-20 07:27:32,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eb66bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:32, skipping insertion in model container [2024-11-20 07:27:32,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:27:32" (1/1) ... [2024-11-20 07:27:33,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:27:33,151 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.i[915,928] [2024-11-20 07:27:33,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:27:33,184 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:27:33,193 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.i[915,928] [2024-11-20 07:27:33,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:27:33,230 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:27:33,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:33 WrapperNode [2024-11-20 07:27:33,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:27:33,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:27:33,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:27:33,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:27:33,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:33" (1/1) ... [2024-11-20 07:27:33,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:33" (1/1) ... [2024-11-20 07:27:33,263 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 84 [2024-11-20 07:27:33,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:27:33,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:27:33,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:27:33,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:27:33,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:33" (1/1) ... [2024-11-20 07:27:33,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:33" (1/1) ... [2024-11-20 07:27:33,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:33" (1/1) ... [2024-11-20 07:27:33,297 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-20 07:27:33,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:33" (1/1) ... [2024-11-20 07:27:33,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:33" (1/1) ... [2024-11-20 07:27:33,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:33" (1/1) ... [2024-11-20 07:27:33,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:33" (1/1) ... [2024-11-20 07:27:33,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:33" (1/1) ... [2024-11-20 07:27:33,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:33" (1/1) ... [2024-11-20 07:27:33,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:27:33,315 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:27:33,315 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:27:33,315 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:27:33,316 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:33" (1/1) ... [2024-11-20 07:27:33,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:27:33,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:27:33,344 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-20 07:27:33,349 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-20 07:27:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:27:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:27:33,382 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:27:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 07:27:33,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:27:33,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:27:33,440 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:27:33,444 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:27:33,635 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-20 07:27:33,635 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:27:33,648 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:27:33,649 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:27:33,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:27:33 BoogieIcfgContainer [2024-11-20 07:27:33,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:27:33,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:27:33,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:27:33,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:27:33,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:27:32" (1/3) ... [2024-11-20 07:27:33,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b852222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:27:33, skipping insertion in model container [2024-11-20 07:27:33,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:33" (2/3) ... [2024-11-20 07:27:33,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b852222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:27:33, skipping insertion in model container [2024-11-20 07:27:33,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:27:33" (3/3) ... [2024-11-20 07:27:33,657 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-50.i [2024-11-20 07:27:33,671 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:27:33,671 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:27:33,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:27:33,741 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;@794ed384, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:27:33,741 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:27:33,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 07:27:33,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-20 07:27:33,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:27:33,754 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:27:33,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:27:33,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:27:33,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1715386766, now seen corresponding path program 1 times [2024-11-20 07:27:33,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:27:33,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213820549] [2024-11-20 07:27:33,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:27:33,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:27:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:33,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:27:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:33,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 07:27:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:33,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 07:27:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:33,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 07:27:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:34,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 07:27:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:34,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 07:27:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:34,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:27:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:34,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 07:27:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:34,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:27:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:34,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 07:27:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:34,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 07:27:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:34,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:27:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 07:27:34,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:27:34,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213820549] [2024-11-20 07:27:34,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213820549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:27:34,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:27:34,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:27:34,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139874456] [2024-11-20 07:27:34,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:27:34,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:27:34,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:27:34,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:27:34,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:27:34,102 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 07:27:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:27:34,120 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2024-11-20 07:27:34,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:27:34,121 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 77 [2024-11-20 07:27:34,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:27:34,126 INFO L225 Difference]: With dead ends: 73 [2024-11-20 07:27:34,127 INFO L226 Difference]: Without dead ends: 36 [2024-11-20 07:27:34,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-20 07:27:34,132 INFO L432 NwaCegarLoop]: 49 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, 49 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-20 07:27:34,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:27:34,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-20 07:27:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-20 07:27:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 07:27:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-20 07:27:34,231 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 77 [2024-11-20 07:27:34,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:27:34,232 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-20 07:27:34,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 07:27:34,232 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-20 07:27:34,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-20 07:27:34,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:27:34,238 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:27:34,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 07:27:34,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:27:34,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:27:34,239 INFO L85 PathProgramCache]: Analyzing trace with hash 321635914, now seen corresponding path program 1 times [2024-11-20 07:27:34,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:27:34,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95571160] [2024-11-20 07:27:34,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:27:34,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:27:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 07:27:34,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2064877921] [2024-11-20 07:27:34,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:27:34,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:27:34,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:27:34,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 07:27:34,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 07:27:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:27:34,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 07:27:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:27:34,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 07:27:34,503 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 07:27:34,505 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 07:27:34,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 07:27:34,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:27:34,710 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-20 07:27:34,756 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 07:27:34,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:27:34 BoogieIcfgContainer [2024-11-20 07:27:34,759 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 07:27:34,763 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 07:27:34,763 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 07:27:34,763 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 07:27:34,764 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:27:33" (3/4) ... [2024-11-20 07:27:34,766 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 07:27:34,767 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 07:27:34,768 INFO L158 Benchmark]: Toolchain (without parser) took 1786.89ms. Allocated memory is still 197.1MB. Free memory was 167.0MB in the beginning and 142.6MB in the end (delta: 24.4MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2024-11-20 07:27:34,768 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory is still 93.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:27:34,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.73ms. Allocated memory is still 197.1MB. Free memory was 166.8MB in the beginning and 156.6MB in the end (delta: 10.1MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-20 07:27:34,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.76ms. Allocated memory is still 197.1MB. Free memory was 156.6MB in the beginning and 155.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:27:34,769 INFO L158 Benchmark]: Boogie Preprocessor took 50.37ms. Allocated memory is still 197.1MB. Free memory was 155.3MB in the beginning and 153.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 07:27:34,769 INFO L158 Benchmark]: RCFGBuilder took 334.34ms. Allocated memory is still 197.1MB. Free memory was 153.2MB in the beginning and 139.8MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 07:27:34,769 INFO L158 Benchmark]: TraceAbstraction took 1108.41ms. Allocated memory is still 197.1MB. Free memory was 139.0MB in the beginning and 142.6MB in the end (delta: -3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:27:34,770 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 197.1MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:27:34,771 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory is still 93.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.73ms. Allocated memory is still 197.1MB. Free memory was 166.8MB in the beginning and 156.6MB in the end (delta: 10.1MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.76ms. Allocated memory is still 197.1MB. Free memory was 156.6MB in the beginning and 155.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.37ms. Allocated memory is still 197.1MB. Free memory was 155.3MB in the beginning and 153.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 334.34ms. Allocated memory is still 197.1MB. Free memory was 153.2MB in the beginning and 139.8MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1108.41ms. Allocated memory is still 197.1MB. Free memory was 139.0MB in the beginning and 142.6MB in the end (delta: -3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 197.1MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someUnaryDOUBLEoperation at line 24. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] double var_1_2 = 99999.67; [L24] double var_1_3 = -0.05; [L25] signed short int var_1_4 = 128; [L26] signed short int var_1_5 = 128; [L27] signed long int var_1_6 = -10; [L28] double var_1_7 = 8.6; [L29] unsigned char var_1_8 = 1; VAL [isInitial=0, var_1_1=5, var_1_2=9999967/100, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L72] isInitial = 1 [L73] FCALL initially() [L74] COND TRUE 1 [L75] FCALL updateLastVariables() [L76] CALL updateVariables() [L45] var_1_2 = __VERIFIER_nondet_double() [L46] 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, var_1_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L46] 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, var_1_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L47] var_1_3 = __VERIFIER_nondet_double() [L48] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L48] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L49] var_1_4 = __VERIFIER_nondet_short() [L50] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L50] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L51] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L51] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L52] var_1_5 = __VERIFIER_nondet_short() [L53] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L53] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L54] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L54] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L55] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L55] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L56] var_1_6 = __VERIFIER_nondet_long() [L57] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L57] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L58] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L58] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L59] var_1_7 = __VERIFIER_nondet_double() [L60] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=1] [L60] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=1] [L61] var_1_8 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1] [L62] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1] [L63] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=0] [L63] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=0] [L76] RET updateVariables() [L77] CALL step() [L33] unsigned char stepLocal_0 = ((((63.6) < (var_1_2)) ? (63.6) : (var_1_2))) != var_1_3; VAL [isInitial=1, stepLocal_0=0, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=0] [L34] COND FALSE !(stepLocal_0 && ((var_1_4 / var_1_5) < var_1_6)) [L41] var_1_1 = 10 VAL [isInitial=1, var_1_1=10, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=0] [L77] RET step() [L78] CALL, EXPR property() [L68-L69] return ((((((63.6) < (var_1_2)) ? (63.6) : (var_1_2))) != var_1_3) && ((var_1_4 / var_1_5) < var_1_6)) ? ((var_1_3 >= (var_1_2 + var_1_7)) ? (var_1_1 == ((unsigned char) var_1_8)) : (var_1_1 == ((unsigned char) var_1_8))) : (var_1_1 == ((unsigned char) 10)) ; VAL [\result=0, isInitial=1, var_1_1=10, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=0] [L78] RET, EXPR property() [L78] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=10, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_1=10, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 49 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 76 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 264/264 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-20 07:27:34,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.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 31c38fc0029b15eea235546e14c5b61b4e70b436ee39f6c640a47d6a6b4e9a18 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:27:36,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:27:36,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 07:27:36,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:27:36,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:27:36,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:27:36,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:27:36,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:27:36,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:27:36,876 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:27:36,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:27:36,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:27:36,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:27:36,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:27:36,878 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:27:36,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:27:36,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:27:36,879 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:27:36,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:27:36,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:27:36,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:27:36,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:27:36,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:27:36,883 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 07:27:36,883 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 07:27:36,883 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:27:36,884 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 07:27:36,884 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:27:36,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:27:36,884 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:27:36,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:27:36,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:27:36,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:27:36,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:27:36,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:27:36,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:27:36,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:27:36,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:27:36,885 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 07:27:36,886 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 07:27:36,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:27:36,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:27:36,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:27:36,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:27:36,888 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 -> 31c38fc0029b15eea235546e14c5b61b4e70b436ee39f6c640a47d6a6b4e9a18 [2024-11-20 07:27:37,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:27:37,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:27:37,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:27:37,148 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:27:37,151 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:27:37,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.i [2024-11-20 07:27:38,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:27:38,597 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:27:38,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.i [2024-11-20 07:27:38,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59a12d58d/bac877e19809435b9b80ebb19ed29060/FLAGc0063258f [2024-11-20 07:27:38,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59a12d58d/bac877e19809435b9b80ebb19ed29060 [2024-11-20 07:27:38,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:27:38,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:27:38,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:27:38,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:27:38,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:27:38,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:27:38" (1/1) ... [2024-11-20 07:27:38,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d386904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:38, skipping insertion in model container [2024-11-20 07:27:38,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:27:38" (1/1) ... [2024-11-20 07:27:38,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:27:38,811 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.i[915,928] [2024-11-20 07:27:38,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:27:38,855 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:27:38,865 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.i[915,928] [2024-11-20 07:27:38,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:27:38,900 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:27:38,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:38 WrapperNode [2024-11-20 07:27:38,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:27:38,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:27:38,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:27:38,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:27:38,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:38" (1/1) ... [2024-11-20 07:27:38,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:38" (1/1) ... [2024-11-20 07:27:38,937 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2024-11-20 07:27:38,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:27:38,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:27:38,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:27:38,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:27:38,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:38" (1/1) ... [2024-11-20 07:27:38,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:38" (1/1) ... [2024-11-20 07:27:38,957 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:38" (1/1) ... [2024-11-20 07:27:38,968 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-20 07:27:38,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:38" (1/1) ... [2024-11-20 07:27:38,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:38" (1/1) ... [2024-11-20 07:27:38,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:38" (1/1) ... [2024-11-20 07:27:38,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:38" (1/1) ... [2024-11-20 07:27:38,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:38" (1/1) ... [2024-11-20 07:27:38,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:38" (1/1) ... [2024-11-20 07:27:38,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:27:38,998 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:27:38,998 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:27:38,998 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:27:38,999 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:38" (1/1) ... [2024-11-20 07:27:39,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:27:39,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:27:39,035 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-20 07:27:39,045 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-20 07:27:39,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:27:39,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 07:27:39,079 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:27:39,079 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:27:39,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:27:39,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:27:39,131 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:27:39,133 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:27:39,531 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-20 07:27:39,532 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:27:39,542 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:27:39,542 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:27:39,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:27:39 BoogieIcfgContainer [2024-11-20 07:27:39,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:27:39,544 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:27:39,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:27:39,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:27:39,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:27:38" (1/3) ... [2024-11-20 07:27:39,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217175ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:27:39, skipping insertion in model container [2024-11-20 07:27:39,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:38" (2/3) ... [2024-11-20 07:27:39,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217175ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:27:39, skipping insertion in model container [2024-11-20 07:27:39,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:27:39" (3/3) ... [2024-11-20 07:27:39,550 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-50.i [2024-11-20 07:27:39,563 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:27:39,563 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:27:39,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:27:39,616 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;@219eb1af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:27:39,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:27:39,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 07:27:39,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-20 07:27:39,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:27:39,628 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:27:39,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:27:39,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:27:39,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1715386766, now seen corresponding path program 1 times [2024-11-20 07:27:39,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:27:39,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126922479] [2024-11-20 07:27:39,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:27:39,648 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-20 07:27:39,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:27:39,651 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-20 07:27:39,652 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-20 07:27:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:39,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 07:27:39,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:27:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-20 07:27:39,835 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:27:39,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:27:39,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126922479] [2024-11-20 07:27:39,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126922479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:27:39,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:27:39,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:27:39,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287222672] [2024-11-20 07:27:39,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:27:39,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:27:39,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:27:39,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:27:39,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:27:39,859 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 07:27:39,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:27:39,878 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2024-11-20 07:27:39,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:27:39,880 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 77 [2024-11-20 07:27:39,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:27:39,886 INFO L225 Difference]: With dead ends: 73 [2024-11-20 07:27:39,886 INFO L226 Difference]: Without dead ends: 36 [2024-11-20 07:27:39,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 76 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-20 07:27:39,891 INFO L432 NwaCegarLoop]: 49 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, 49 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-20 07:27:39,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:27:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-20 07:27:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-20 07:27:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 07:27:39,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-20 07:27:39,920 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 77 [2024-11-20 07:27:39,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:27:39,920 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-20 07:27:39,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 07:27:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-20 07:27:39,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-20 07:27:39,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:27:39,922 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:27:39,930 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-20 07:27:40,126 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-20 07:27:40,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:27:40,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:27:40,128 INFO L85 PathProgramCache]: Analyzing trace with hash 321635914, now seen corresponding path program 1 times [2024-11-20 07:27:40,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:27:40,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859534725] [2024-11-20 07:27:40,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:27:40,128 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-20 07:27:40,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:27:40,130 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-20 07:27:40,132 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-20 07:27:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:40,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 07:27:40,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:27:42,010 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 07:27:42,010 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:27:42,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:27:42,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859534725] [2024-11-20 07:27:42,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859534725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:27:42,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:27:42,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 07:27:42,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847668421] [2024-11-20 07:27:42,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:27:42,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 07:27:42,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:27:42,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 07:27:42,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 07:27:42,013 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:27:43,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:27:43,346 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2024-11-20 07:27:43,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 07:27:43,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2024-11-20 07:27:43,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:27:43,353 INFO L225 Difference]: With dead ends: 44 [2024-11-20 07:27:43,353 INFO L226 Difference]: Without dead ends: 42 [2024-11-20 07:27:43,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:27:43,355 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 07:27:43,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 199 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 07:27:43,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-20 07:27:43,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-11-20 07:27:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 07:27:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2024-11-20 07:27:43,361 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 77 [2024-11-20 07:27:43,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:27:43,363 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-11-20 07:27:43,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:27:43,363 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2024-11-20 07:27:43,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-20 07:27:43,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:27:43,365 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:27:43,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 07:27:43,566 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-20 07:27:43,566 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:27:43,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:27:43,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1145218415, now seen corresponding path program 1 times [2024-11-20 07:27:43,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:27:43,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42428855] [2024-11-20 07:27:43,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:27:43,568 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-20 07:27:43,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:27:43,572 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-20 07:27:43,573 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-20 07:27:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:43,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 07:27:43,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:27:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 07:27:45,062 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:27:45,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:27:45,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42428855] [2024-11-20 07:27:45,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42428855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:27:45,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:27:45,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 07:27:45,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48720336] [2024-11-20 07:27:45,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:27:45,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 07:27:45,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:27:45,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 07:27:45,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 07:27:45,069 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:27:47,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:27:47,118 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2024-11-20 07:27:47,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 07:27:47,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2024-11-20 07:27:47,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:27:47,125 INFO L225 Difference]: With dead ends: 42 [2024-11-20 07:27:47,126 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 07:27:47,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 07:27:47,128 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 11 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 07:27:47,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 194 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 07:27:47,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 07:27:47,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 07:27:47,130 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-20 07:27:47,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 07:27:47,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2024-11-20 07:27:47,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:27:47,130 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 07:27:47,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:27:47,131 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 07:27:47,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 07:27:47,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 07:27:47,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 07:27:47,338 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-20 07:27:47,342 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 07:27:47,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 07:27:47,367 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 07:27:47,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:27:47 BoogieIcfgContainer [2024-11-20 07:27:47,398 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 07:27:47,401 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 07:27:47,401 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 07:27:47,402 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 07:27:47,402 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:27:39" (3/4) ... [2024-11-20 07:27:47,404 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 07:27:47,408 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-20 07:27:47,413 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-20 07:27:47,414 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-20 07:27:47,414 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 07:27:47,414 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 07:27:47,491 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 07:27:47,491 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 07:27:47,491 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 07:27:47,492 INFO L158 Benchmark]: Toolchain (without parser) took 8874.08ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 35.9MB in the beginning and 59.7MB in the end (delta: -23.8MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2024-11-20 07:27:47,492 INFO L158 Benchmark]: CDTParser took 1.46ms. Allocated memory is still 56.6MB. Free memory is still 26.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:27:47,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.55ms. Allocated memory is still 79.7MB. Free memory was 35.6MB in the beginning and 51.9MB in the end (delta: -16.3MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-11-20 07:27:47,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.14ms. Allocated memory is still 79.7MB. Free memory was 51.9MB in the beginning and 49.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 07:27:47,495 INFO L158 Benchmark]: Boogie Preprocessor took 57.46ms. Allocated memory is still 79.7MB. Free memory was 49.9MB in the beginning and 47.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 07:27:47,495 INFO L158 Benchmark]: RCFGBuilder took 545.39ms. Allocated memory is still 79.7MB. Free memory was 47.8MB in the beginning and 34.4MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 07:27:47,495 INFO L158 Benchmark]: TraceAbstraction took 7853.88ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 34.0MB in the beginning and 64.9MB in the end (delta: -31.0MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-11-20 07:27:47,496 INFO L158 Benchmark]: Witness Printer took 90.06ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 59.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 07:27:47,497 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.46ms. Allocated memory is still 56.6MB. Free memory is still 26.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.55ms. Allocated memory is still 79.7MB. Free memory was 35.6MB in the beginning and 51.9MB in the end (delta: -16.3MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.14ms. Allocated memory is still 79.7MB. Free memory was 51.9MB in the beginning and 49.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.46ms. Allocated memory is still 79.7MB. Free memory was 49.9MB in the beginning and 47.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 545.39ms. Allocated memory is still 79.7MB. Free memory was 47.8MB in the beginning and 34.4MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7853.88ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 34.0MB in the beginning and 64.9MB in the end (delta: -31.0MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Witness Printer took 90.06ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 59.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 442 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 301 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 141 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 15, 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, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 475 SizeOfPredicates, 16 NumberOfNonLiveVariables, 377 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 792/792 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: 74]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) RESULT: Ultimate proved your program to be correct! [2024-11-20 07:27:47,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE