./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-34.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 5ba331e7382548a714447aae24dc39067b99d6e58e7280c88c6b71afa304f6fc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:13:55,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:13:55,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 17:13:55,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:13:55,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:13:55,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:13:55,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:13:55,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:13:55,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:13:55,129 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:13:55,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:13:55,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:13:55,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:13:55,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:13:55,132 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:13:55,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:13:55,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:13:55,132 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:13:55,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:13:55,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:13:55,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:13:55,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:13:55,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:13:55,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:13:55,136 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:13:55,137 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:13:55,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:13:55,137 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:13:55,137 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:13:55,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:13:55,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:13:55,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:13:55,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:13:55,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:13:55,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:13:55,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:13:55,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:13:55,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:13:55,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:13:55,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:13:55,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:13:55,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:13:55,140 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 -> 5ba331e7382548a714447aae24dc39067b99d6e58e7280c88c6b71afa304f6fc [2024-11-16 17:13:55,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:13:55,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:13:55,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:13:55,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:13:55,334 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:13:55,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-34.i [2024-11-16 17:13:56,502 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:13:56,643 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:13:56,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-34.i [2024-11-16 17:13:56,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81737c258/1ac9586972434c9891e068855df8f213/FLAGaed43e286 [2024-11-16 17:13:57,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81737c258/1ac9586972434c9891e068855df8f213 [2024-11-16 17:13:57,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:13:57,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:13:57,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:13:57,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:13:57,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:13:57,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:13:57" (1/1) ... [2024-11-16 17:13:57,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@529058ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:57, skipping insertion in model container [2024-11-16 17:13:57,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:13:57" (1/1) ... [2024-11-16 17:13:57,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:13:57,231 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-34.i[915,928] [2024-11-16 17:13:57,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:13:57,276 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:13:57,284 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-34.i[915,928] [2024-11-16 17:13:57,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:13:57,316 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:13:57,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:57 WrapperNode [2024-11-16 17:13:57,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:13:57,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:13:57,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:13:57,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:13:57,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:57" (1/1) ... [2024-11-16 17:13:57,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:57" (1/1) ... [2024-11-16 17:13:57,349 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 67 [2024-11-16 17:13:57,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:13:57,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:13:57,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:13:57,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:13:57,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:57" (1/1) ... [2024-11-16 17:13:57,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:57" (1/1) ... [2024-11-16 17:13:57,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:57" (1/1) ... [2024-11-16 17:13:57,372 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-16 17:13:57,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:57" (1/1) ... [2024-11-16 17:13:57,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:57" (1/1) ... [2024-11-16 17:13:57,376 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:57" (1/1) ... [2024-11-16 17:13:57,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:57" (1/1) ... [2024-11-16 17:13:57,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:57" (1/1) ... [2024-11-16 17:13:57,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:57" (1/1) ... [2024-11-16 17:13:57,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:13:57,380 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:13:57,380 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:13:57,381 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:13:57,381 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:57" (1/1) ... [2024-11-16 17:13:57,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:13:57,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:13:57,420 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-16 17:13:57,437 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-16 17:13:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:13:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:13:57,497 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:13:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:13:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:13:57,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:13:57,550 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:13:57,551 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:13:57,675 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 17:13:57,676 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:13:57,684 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:13:57,684 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:13:57,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:13:57 BoogieIcfgContainer [2024-11-16 17:13:57,685 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:13:57,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:13:57,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:13:57,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:13:57,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:13:57" (1/3) ... [2024-11-16 17:13:57,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4735192d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:13:57, skipping insertion in model container [2024-11-16 17:13:57,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:57" (2/3) ... [2024-11-16 17:13:57,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4735192d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:13:57, skipping insertion in model container [2024-11-16 17:13:57,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:13:57" (3/3) ... [2024-11-16 17:13:57,691 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-34.i [2024-11-16 17:13:57,703 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:13:57,703 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:13:57,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:13:57,754 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;@78fb0aee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:13:57,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:13:57,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 17:13:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-16 17:13:57,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:57,765 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:13:57,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:57,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:57,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1869106543, now seen corresponding path program 1 times [2024-11-16 17:13:57,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:13:57,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678253198] [2024-11-16 17:13:57,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:57,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:13:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:57,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:13:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:57,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 17:13:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:57,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 17:13:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 17:13:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:57,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 17:13:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:57,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 17:13:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:57,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 17:13:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:57,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:13:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:57,954 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 17:13:57,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:13:57,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678253198] [2024-11-16 17:13:57,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678253198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:13:57,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:13:57,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:13:57,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569180720] [2024-11-16 17:13:57,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:13:57,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:13:57,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:13:57,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:13:57,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:13:57,989 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 17:13:58,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:13:58,003 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2024-11-16 17:13:58,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:13:58,004 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2024-11-16 17:13:58,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:13:58,009 INFO L225 Difference]: With dead ends: 66 [2024-11-16 17:13:58,009 INFO L226 Difference]: Without dead ends: 32 [2024-11-16 17:13:58,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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-16 17:13:58,013 INFO L432 NwaCegarLoop]: 41 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, 41 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-16 17:13:58,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:13:58,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-16 17:13:58,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-16 17:13:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 17:13:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-11-16 17:13:58,037 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 57 [2024-11-16 17:13:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:13:58,038 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-11-16 17:13:58,038 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 17:13:58,038 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-11-16 17:13:58,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-16 17:13:58,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:58,040 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:13:58,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:13:58,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:58,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:58,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1842475699, now seen corresponding path program 1 times [2024-11-16 17:13:58,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:13:58,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067193758] [2024-11-16 17:13:58,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:58,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:13:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:13:58,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 17:13:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:13:58,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 17:13:58,156 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 17:13:58,157 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:13:58,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 17:13:58,160 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-16 17:13:58,185 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:13:58,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:13:58 BoogieIcfgContainer [2024-11-16 17:13:58,187 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:13:58,188 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:13:58,188 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:13:58,188 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:13:58,188 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:13:57" (3/4) ... [2024-11-16 17:13:58,190 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 17:13:58,191 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:13:58,191 INFO L158 Benchmark]: Toolchain (without parser) took 1125.01ms. Allocated memory is still 201.3MB. Free memory was 130.1MB in the beginning and 118.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-11-16 17:13:58,192 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 156.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:13:58,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.02ms. Allocated memory is still 201.3MB. Free memory was 129.9MB in the beginning and 116.5MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 17:13:58,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.06ms. Allocated memory is still 201.3MB. Free memory was 116.5MB in the beginning and 114.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:13:58,193 INFO L158 Benchmark]: Boogie Preprocessor took 29.63ms. Allocated memory is still 201.3MB. Free memory was 114.2MB in the beginning and 110.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:13:58,193 INFO L158 Benchmark]: IcfgBuilder took 304.49ms. Allocated memory is still 201.3MB. Free memory was 110.8MB in the beginning and 157.4MB in the end (delta: -46.6MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-11-16 17:13:58,193 INFO L158 Benchmark]: TraceAbstraction took 501.23ms. Allocated memory is still 201.3MB. Free memory was 157.4MB in the beginning and 118.7MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-16 17:13:58,193 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:13:58,196 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 156.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.02ms. Allocated memory is still 201.3MB. Free memory was 129.9MB in the beginning and 116.5MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.06ms. Allocated memory is still 201.3MB. Free memory was 116.5MB in the beginning and 114.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.63ms. Allocated memory is still 201.3MB. Free memory was 114.2MB in the beginning and 110.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 304.49ms. Allocated memory is still 201.3MB. Free memory was 110.8MB in the beginning and 157.4MB in the end (delta: -46.6MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * TraceAbstraction took 501.23ms. Allocated memory is still 201.3MB. Free memory was 157.4MB in the beginning and 118.7MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. 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 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] double var_1_2 = 4.4; [L24] double var_1_3 = 16.475; [L25] unsigned char var_1_4 = 1; [L26] unsigned char var_1_5 = 2; [L27] unsigned char var_1_6 = 5; VAL [isInitial=0, var_1_1=16, var_1_2=22/5, var_1_3=659/40, var_1_4=1, var_1_5=2, var_1_6=5] [L63] isInitial = 1 [L64] FCALL initially() [L65] COND TRUE 1 [L66] FCALL updateLastVariables() [L67] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_double() [L43] 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=16, var_1_3=659/40, var_1_4=1, var_1_5=2, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_3=659/40, var_1_4=1, var_1_5=2, var_1_6=5] [L43] 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=16, var_1_3=659/40, var_1_4=1, var_1_5=2, var_1_6=5] [L44] var_1_3 = __VERIFIER_nondet_double() [L45] 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=16, var_1_4=1, var_1_5=2, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=1, var_1_5=2, var_1_6=5] [L45] 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=16, var_1_4=1, var_1_5=2, var_1_6=5] [L46] var_1_4 = __VERIFIER_nondet_uchar() [L47] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_5=2, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_5=2, var_1_6=5] [L47] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=16, var_1_5=2, var_1_6=5] [L48] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=0, var_1_5=2, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=0, var_1_5=2, var_1_6=5] [L48] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_1=16, var_1_4=0, var_1_5=2, var_1_6=5] [L49] var_1_5 = __VERIFIER_nondet_uchar() [L50] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=0, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=0, var_1_6=5] [L50] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=16, var_1_4=0, var_1_6=5] [L51] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=0, var_1_5=25, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=0, var_1_5=25, var_1_6=5] [L51] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, var_1_1=16, var_1_4=0, var_1_5=25, var_1_6=5] [L52] var_1_6 = __VERIFIER_nondet_uchar() [L53] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=0, var_1_5=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=0, var_1_5=25] [L53] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_1=16, var_1_4=0, var_1_5=25] [L54] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=0, var_1_5=25, var_1_6=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=0, var_1_5=25, var_1_6=254] [L54] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, var_1_1=16, var_1_4=0, var_1_5=25, var_1_6=254] [L67] RET updateVariables() [L68] CALL step() [L31] COND FALSE !(var_1_2 > (- var_1_3)) [L38] var_1_1 = var_1_5 VAL [isInitial=1, var_1_1=25, var_1_4=0, var_1_5=25, var_1_6=254] [L68] RET step() [L69] CALL, EXPR property() [L59-L60] return (var_1_2 > (- var_1_3)) ? (var_1_4 ? (var_1_1 == ((unsigned char) ((((var_1_5) < (((((25) > (((((var_1_6) < (8)) ? (var_1_6) : (8))))) ? (25) : (((((var_1_6) < (8)) ? (var_1_6) : (8)))))))) ? (var_1_5) : (((((25) > (((((var_1_6) < (8)) ? (var_1_6) : (8))))) ? (25) : (((((var_1_6) < (8)) ? (var_1_6) : (8))))))))))) : (var_1_1 == ((unsigned char) var_1_6))) : (var_1_1 == ((unsigned char) var_1_5)) ; VAL [\result=0, isInitial=1, var_1_1=25, var_1_4=0, var_1_5=25, var_1_6=254] [L69] RET, EXPR property() [L69] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=25, var_1_4=0, var_1_5=25, var_1_6=254] [L19] reach_error() VAL [isInitial=1, var_1_1=25, var_1_4=0, var_1_5=25, var_1_6=254] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 41 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, 41 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 56 ConstructedInterpolants, 0 QuantifiedInterpolants, 56 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 112/112 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-16 17:13:58,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-34.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 5ba331e7382548a714447aae24dc39067b99d6e58e7280c88c6b71afa304f6fc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:13:59,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:14:00,002 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 17:14:00,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:14:00,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:14:00,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:14:00,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:14:00,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:14:00,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:14:00,030 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:14:00,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:14:00,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:14:00,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:14:00,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:14:00,031 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:14:00,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:14:00,032 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:14:00,032 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:14:00,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:14:00,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:14:00,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:14:00,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:14:00,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:14:00,037 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 17:14:00,037 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 17:14:00,037 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:14:00,037 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 17:14:00,037 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:14:00,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:14:00,038 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:14:00,038 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:14:00,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:14:00,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:14:00,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:14:00,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:14:00,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:14:00,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:14:00,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:14:00,039 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 17:14:00,039 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 17:14:00,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:14:00,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:14:00,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:14:00,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:14:00,041 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 -> 5ba331e7382548a714447aae24dc39067b99d6e58e7280c88c6b71afa304f6fc [2024-11-16 17:14:00,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:14:00,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:14:00,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:14:00,293 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:14:00,294 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:14:00,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-34.i [2024-11-16 17:14:01,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:14:01,690 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:14:01,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-34.i [2024-11-16 17:14:01,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e32a4d180/83562f2d4150435597d9ef95b16a388e/FLAG0354e7213 [2024-11-16 17:14:02,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e32a4d180/83562f2d4150435597d9ef95b16a388e [2024-11-16 17:14:02,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:14:02,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:14:02,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:14:02,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:14:02,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:14:02,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:14:02" (1/1) ... [2024-11-16 17:14:02,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@80cbfa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:14:02, skipping insertion in model container [2024-11-16 17:14:02,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:14:02" (1/1) ... [2024-11-16 17:14:02,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:14:02,211 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-34.i[915,928] [2024-11-16 17:14:02,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:14:02,255 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:14:02,280 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-34.i[915,928] [2024-11-16 17:14:02,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:14:02,329 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:14:02,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:14:02 WrapperNode [2024-11-16 17:14:02,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:14:02,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:14:02,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:14:02,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:14:02,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:14:02" (1/1) ... [2024-11-16 17:14:02,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:14:02" (1/1) ... [2024-11-16 17:14:02,365 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 67 [2024-11-16 17:14:02,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:14:02,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:14:02,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:14:02,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:14:02,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:14:02" (1/1) ... [2024-11-16 17:14:02,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:14:02" (1/1) ... [2024-11-16 17:14:02,382 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:14:02" (1/1) ... [2024-11-16 17:14:02,404 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-16 17:14:02,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:14:02" (1/1) ... [2024-11-16 17:14:02,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:14:02" (1/1) ... [2024-11-16 17:14:02,411 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:14:02" (1/1) ... [2024-11-16 17:14:02,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:14:02" (1/1) ... [2024-11-16 17:14:02,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:14:02" (1/1) ... [2024-11-16 17:14:02,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:14:02" (1/1) ... [2024-11-16 17:14:02,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:14:02,422 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:14:02,423 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:14:02,423 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:14:02,423 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:14:02" (1/1) ... [2024-11-16 17:14:02,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:14:02,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:14:02,453 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-16 17:14:02,456 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-16 17:14:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:14:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 17:14:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:14:02,491 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:14:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:14:02,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:14:02,552 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:14:02,554 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:14:02,704 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 17:14:02,704 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:14:02,718 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:14:02,718 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:14:02,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:14:02 BoogieIcfgContainer [2024-11-16 17:14:02,719 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:14:02,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:14:02,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:14:02,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:14:02,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:14:02" (1/3) ... [2024-11-16 17:14:02,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6cca3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:14:02, skipping insertion in model container [2024-11-16 17:14:02,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:14:02" (2/3) ... [2024-11-16 17:14:02,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6cca3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:14:02, skipping insertion in model container [2024-11-16 17:14:02,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:14:02" (3/3) ... [2024-11-16 17:14:02,728 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-34.i [2024-11-16 17:14:02,741 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:14:02,741 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:14:02,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:14:02,802 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;@4c4628fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:14:02,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:14:02,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 17:14:02,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-16 17:14:02,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:14:02,815 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:14:02,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:14:02,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:14:02,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1869106543, now seen corresponding path program 1 times [2024-11-16 17:14:02,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:14:02,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791900599] [2024-11-16 17:14:02,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:14:02,833 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-16 17:14:02,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:14:02,836 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-16 17:14:02,837 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-16 17:14:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:14:02,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 17:14:02,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:14:02,973 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-16 17:14:02,973 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:14:02,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:14:02,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791900599] [2024-11-16 17:14:02,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791900599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:14:02,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:14:02,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:14:02,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228118459] [2024-11-16 17:14:02,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:14:02,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:14:02,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:14:02,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:14:02,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:14:03,001 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 17:14:03,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:14:03,019 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2024-11-16 17:14:03,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:14:03,021 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2024-11-16 17:14:03,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:14:03,025 INFO L225 Difference]: With dead ends: 66 [2024-11-16 17:14:03,025 INFO L226 Difference]: Without dead ends: 32 [2024-11-16 17:14:03,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-16 17:14:03,031 INFO L432 NwaCegarLoop]: 41 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, 41 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-16 17:14:03,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:14:03,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-16 17:14:03,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-16 17:14:03,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 17:14:03,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-11-16 17:14:03,062 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 57 [2024-11-16 17:14:03,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:14:03,063 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-11-16 17:14:03,063 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 17:14:03,064 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-11-16 17:14:03,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-16 17:14:03,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:14:03,066 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:14:03,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 17:14:03,266 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-16 17:14:03,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:14:03,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:14:03,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1842475699, now seen corresponding path program 1 times [2024-11-16 17:14:03,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:14:03,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588703441] [2024-11-16 17:14:03,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:14:03,269 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-16 17:14:03,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:14:03,270 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-16 17:14:03,271 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-16 17:14:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:14:03,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 17:14:03,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:14:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 17:14:08,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:14:08,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:14:08,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588703441] [2024-11-16 17:14:08,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588703441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:14:08,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:14:08,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 17:14:08,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737400101] [2024-11-16 17:14:08,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:14:08,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 17:14:08,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:14:08,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 17:14:08,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:14:08,609 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 17:14:08,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:14:08,703 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-16 17:14:08,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 17:14:08,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2024-11-16 17:14:08,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:14:08,705 INFO L225 Difference]: With dead ends: 42 [2024-11-16 17:14:08,705 INFO L226 Difference]: Without dead ends: 39 [2024-11-16 17:14:08,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:14:08,706 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:14:08,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 149 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:14:08,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-16 17:14:08,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-11-16 17:14:08,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 17:14:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2024-11-16 17:14:08,715 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 57 [2024-11-16 17:14:08,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:14:08,716 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2024-11-16 17:14:08,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 17:14:08,716 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2024-11-16 17:14:08,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 17:14:08,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:14:08,717 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:14:08,722 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-16 17:14:08,920 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-16 17:14:08,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:14:08,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:14:08,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2094755020, now seen corresponding path program 1 times [2024-11-16 17:14:08,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:14:08,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775019804] [2024-11-16 17:14:08,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:14:08,926 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-16 17:14:08,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:14:08,927 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-16 17:14:08,928 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-16 17:14:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:14:08,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 17:14:08,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:14:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 17:14:12,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:14:12,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:14:12,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775019804] [2024-11-16 17:14:12,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775019804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:14:12,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:14:12,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 17:14:12,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210101700] [2024-11-16 17:14:12,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:14:12,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 17:14:12,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:14:12,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 17:14:12,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 17:14:12,183 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 17:14:12,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:14:12,311 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-11-16 17:14:12,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 17:14:12,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 58 [2024-11-16 17:14:12,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:14:12,313 INFO L225 Difference]: With dead ends: 49 [2024-11-16 17:14:12,313 INFO L226 Difference]: Without dead ends: 46 [2024-11-16 17:14:12,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:14:12,314 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 22 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:14:12,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 164 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:14:12,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-16 17:14:12,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2024-11-16 17:14:12,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 17:14:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2024-11-16 17:14:12,318 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 58 [2024-11-16 17:14:12,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:14:12,318 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2024-11-16 17:14:12,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 17:14:12,318 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2024-11-16 17:14:12,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 17:14:12,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:14:12,319 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:14:12,325 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-16 17:14:12,522 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-16 17:14:12,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:14:12,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:14:12,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2066125869, now seen corresponding path program 1 times [2024-11-16 17:14:12,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:14:12,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572168514] [2024-11-16 17:14:12,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:14:12,524 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-16 17:14:12,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:14:12,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:14:12,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 17:14:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:14:12,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 17:14:12,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:14:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 17:14:14,232 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:14:14,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:14:14,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572168514] [2024-11-16 17:14:14,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572168514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:14:14,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:14:14,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 17:14:14,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940616369] [2024-11-16 17:14:14,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:14:14,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 17:14:14,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:14:14,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 17:14:14,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 17:14:14,234 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 17:14:14,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:14:14,356 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2024-11-16 17:14:14,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 17:14:14,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 58 [2024-11-16 17:14:14,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:14:14,357 INFO L225 Difference]: With dead ends: 46 [2024-11-16 17:14:14,357 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 17:14:14,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:14:14,358 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:14:14,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 176 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:14:14,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 17:14:14,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 17:14:14,359 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-16 17:14:14,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 17:14:14,359 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2024-11-16 17:14:14,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:14:14,359 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 17:14:14,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 17:14:14,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 17:14:14,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 17:14:14,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:14:14,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-16 17:14:14,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:14:14,567 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-16 17:14:14,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 17:14:14,579 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:14:14,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:14:14 BoogieIcfgContainer [2024-11-16 17:14:14,591 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:14:14,591 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:14:14,591 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:14:14,591 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:14:14,592 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:14:02" (3/4) ... [2024-11-16 17:14:14,593 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 17:14:14,597 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-16 17:14:14,601 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-16 17:14:14,601 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-16 17:14:14,601 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 17:14:14,601 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 17:14:14,676 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 17:14:14,678 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 17:14:14,678 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:14:14,678 INFO L158 Benchmark]: Toolchain (without parser) took 12622.93ms. Allocated memory was 60.8MB in the beginning and 1.0GB in the end (delta: 956.3MB). Free memory was 38.1MB in the beginning and 901.7MB in the end (delta: -863.6MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. [2024-11-16 17:14:14,678 INFO L158 Benchmark]: CDTParser took 1.19ms. Allocated memory is still 60.8MB. Free memory was 36.8MB in the beginning and 36.8MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:14:14,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.94ms. Allocated memory was 60.8MB in the beginning and 88.1MB in the end (delta: 27.3MB). Free memory was 37.8MB in the beginning and 66.6MB in the end (delta: -28.8MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-11-16 17:14:14,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.54ms. Allocated memory is still 88.1MB. Free memory was 66.6MB in the beginning and 64.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:14:14,679 INFO L158 Benchmark]: Boogie Preprocessor took 53.87ms. Allocated memory is still 88.1MB. Free memory was 64.8MB in the beginning and 62.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:14:14,679 INFO L158 Benchmark]: IcfgBuilder took 296.12ms. Allocated memory is still 88.1MB. Free memory was 62.4MB in the beginning and 49.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 17:14:14,679 INFO L158 Benchmark]: TraceAbstraction took 11869.17ms. Allocated memory was 88.1MB in the beginning and 1.0GB in the end (delta: 929.0MB). Free memory was 49.3MB in the beginning and 906.9MB in the end (delta: -857.6MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. [2024-11-16 17:14:14,679 INFO L158 Benchmark]: Witness Printer took 86.81ms. Allocated memory is still 1.0GB. Free memory was 906.9MB in the beginning and 901.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 17:14:14,680 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.19ms. Allocated memory is still 60.8MB. Free memory was 36.8MB in the beginning and 36.8MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.94ms. Allocated memory was 60.8MB in the beginning and 88.1MB in the end (delta: 27.3MB). Free memory was 37.8MB in the beginning and 66.6MB in the end (delta: -28.8MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.54ms. Allocated memory is still 88.1MB. Free memory was 66.6MB in the beginning and 64.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.87ms. Allocated memory is still 88.1MB. Free memory was 64.8MB in the beginning and 62.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 296.12ms. Allocated memory is still 88.1MB. Free memory was 62.4MB in the beginning and 49.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11869.17ms. Allocated memory was 88.1MB in the beginning and 1.0GB in the end (delta: 929.0MB). Free memory was 49.3MB in the beginning and 906.9MB in the end (delta: -857.6MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. * Witness Printer took 86.81ms. Allocated memory is still 1.0GB. Free memory was 906.9MB in the beginning and 901.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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 4, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 530 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 358 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 172 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 290 SizeOfPredicates, 18 NumberOfNonLiveVariables, 382 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 448/448 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: 65]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) RESULT: Ultimate proved your program to be correct! [2024-11-16 17:14:14,711 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