./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-41.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_amount25_file-41.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 155630b80ae5f39687a5e59bcc1f3f29538166935a6c37213c8299acb1006ecc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:30:56,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:30:56,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 17:30:56,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:30:56,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:30:57,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:30:57,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:30:57,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:30:57,020 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:30:57,020 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:30:57,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:30:57,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:30:57,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:30:57,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:30:57,022 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:30:57,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:30:57,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:30:57,023 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:30:57,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:30:57,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:30:57,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:30:57,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:30:57,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:30:57,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:30:57,027 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:30:57,027 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:30:57,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:30:57,028 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:30:57,028 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:30:57,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:30:57,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:30:57,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:30:57,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:30:57,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:30:57,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:30:57,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:30:57,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:30:57,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:30:57,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:30:57,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:30:57,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:30:57,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:30:57,032 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 -> 155630b80ae5f39687a5e59bcc1f3f29538166935a6c37213c8299acb1006ecc [2024-11-16 17:30:57,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:30:57,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:30:57,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:30:57,337 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:30:57,338 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:30:57,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-41.i [2024-11-16 17:30:58,783 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:30:58,980 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:30:58,981 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-41.i [2024-11-16 17:30:58,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59bcfaf0a/dd9011700b7f44b893b16d7f38616754/FLAG1da1b9d0d [2024-11-16 17:30:59,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59bcfaf0a/dd9011700b7f44b893b16d7f38616754 [2024-11-16 17:30:59,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:30:59,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:30:59,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:30:59,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:30:59,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:30:59,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:30:59" (1/1) ... [2024-11-16 17:30:59,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdbb426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:30:59, skipping insertion in model container [2024-11-16 17:30:59,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:30:59" (1/1) ... [2024-11-16 17:30:59,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:30:59,580 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-41.i[915,928] [2024-11-16 17:30:59,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:30:59,648 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:30:59,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-41.i[915,928] [2024-11-16 17:30:59,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:30:59,713 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:30:59,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:30:59 WrapperNode [2024-11-16 17:30:59,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:30:59,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:30:59,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:30:59,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:30:59,723 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:30:59" (1/1) ... [2024-11-16 17:30:59,732 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:30:59" (1/1) ... [2024-11-16 17:30:59,763 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-11-16 17:30:59,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:30:59,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:30:59,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:30:59,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:30:59,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:30:59" (1/1) ... [2024-11-16 17:30:59,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:30:59" (1/1) ... [2024-11-16 17:30:59,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:30:59" (1/1) ... [2024-11-16 17:30:59,798 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:30:59,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:30:59" (1/1) ... [2024-11-16 17:30:59,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:30:59" (1/1) ... [2024-11-16 17:30:59,810 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:30:59" (1/1) ... [2024-11-16 17:30:59,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:30:59" (1/1) ... [2024-11-16 17:30:59,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:30:59" (1/1) ... [2024-11-16 17:30:59,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:30:59" (1/1) ... [2024-11-16 17:30:59,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:30:59,819 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:30:59,819 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:30:59,819 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:30:59,820 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:30:59" (1/1) ... [2024-11-16 17:30:59,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:30:59,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:30:59,858 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:30:59,860 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:30:59,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:30:59,913 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:30:59,913 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:30:59,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:30:59,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:30:59,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:31:00,008 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:31:00,015 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:31:00,350 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 17:31:00,353 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:31:00,371 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:31:00,371 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:31:00,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:31:00 BoogieIcfgContainer [2024-11-16 17:31:00,372 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:31:00,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:31:00,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:31:00,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:31:00,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:30:59" (1/3) ... [2024-11-16 17:31:00,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677251f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:31:00, skipping insertion in model container [2024-11-16 17:31:00,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:30:59" (2/3) ... [2024-11-16 17:31:00,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677251f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:31:00, skipping insertion in model container [2024-11-16 17:31:00,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:31:00" (3/3) ... [2024-11-16 17:31:00,383 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-41.i [2024-11-16 17:31:00,399 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:31:00,399 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:31:00,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:31:00,483 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;@51809e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:31:00,483 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:31:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 17:31:00,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 17:31:00,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:31:00,500 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:00,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:31:00,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:31:00,505 INFO L85 PathProgramCache]: Analyzing trace with hash -392487840, now seen corresponding path program 1 times [2024-11-16 17:31:00,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:31:00,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924331597] [2024-11-16 17:31:00,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:31:00,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:31:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:02,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:31:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:02,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:31:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:02,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:31:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:02,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:31:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:02,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:31:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:02,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:31:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:02,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:31:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:02,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:31:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:02,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:31:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:02,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:31:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:02,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:31:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:02,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:31:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:02,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:31:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:02,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:31:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:02,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:31:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:02,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:31:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 17:31:02,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:31:02,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924331597] [2024-11-16 17:31:02,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924331597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:31:02,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:31:02,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 17:31:02,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928138059] [2024-11-16 17:31:02,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:31:02,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 17:31:02,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:31:02,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 17:31:02,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:31:02,646 INFO L87 Difference]: Start difference. First operand has 54 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 17:31:03,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:31:03,082 INFO L93 Difference]: Finished difference Result 169 states and 277 transitions. [2024-11-16 17:31:03,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 17:31:03,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-11-16 17:31:03,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:31:03,096 INFO L225 Difference]: With dead ends: 169 [2024-11-16 17:31:03,097 INFO L226 Difference]: Without dead ends: 118 [2024-11-16 17:31:03,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-16 17:31:03,106 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 78 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 17:31:03,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 479 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 17:31:03,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-16 17:31:03,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 96. [2024-11-16 17:31:03,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 68 states have internal predecessors, (78), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 17:31:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 130 transitions. [2024-11-16 17:31:03,180 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 130 transitions. Word has length 105 [2024-11-16 17:31:03,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:31:03,182 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 130 transitions. [2024-11-16 17:31:03,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 17:31:03,183 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 130 transitions. [2024-11-16 17:31:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 17:31:03,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:31:03,187 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:03,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:31:03,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:31:03,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:31:03,189 INFO L85 PathProgramCache]: Analyzing trace with hash 2095024993, now seen corresponding path program 1 times [2024-11-16 17:31:03,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:31:03,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213299112] [2024-11-16 17:31:03,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:31:03,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:31:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:04,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:31:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:04,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:31:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:04,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:31:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:04,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:31:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:04,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:31:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:04,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:31:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:04,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:31:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:04,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:31:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:04,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:31:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:04,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:31:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:04,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:31:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:04,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:31:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:04,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:31:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:04,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:31:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:04,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:31:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:04,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:31:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 17:31:04,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:31:04,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213299112] [2024-11-16 17:31:04,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213299112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:31:04,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:31:04,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 17:31:04,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777935335] [2024-11-16 17:31:04,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:31:04,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 17:31:04,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:31:04,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 17:31:04,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:31:04,189 INFO L87 Difference]: Start difference. First operand 96 states and 130 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 17:31:04,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:31:04,476 INFO L93 Difference]: Finished difference Result 198 states and 264 transitions. [2024-11-16 17:31:04,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 17:31:04,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-11-16 17:31:04,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:31:04,479 INFO L225 Difference]: With dead ends: 198 [2024-11-16 17:31:04,480 INFO L226 Difference]: Without dead ends: 105 [2024-11-16 17:31:04,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-16 17:31:04,481 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 54 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 17:31:04,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 467 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 17:31:04,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-16 17:31:04,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2024-11-16 17:31:04,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 59 states have internal predecessors, (68), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 17:31:04,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 112 transitions. [2024-11-16 17:31:04,500 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 112 transitions. Word has length 105 [2024-11-16 17:31:04,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:31:04,501 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 112 transitions. [2024-11-16 17:31:04,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 17:31:04,501 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 112 transitions. [2024-11-16 17:31:04,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 17:31:04,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:31:04,503 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:04,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 17:31:04,503 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:31:04,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:31:04,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2105528097, now seen corresponding path program 1 times [2024-11-16 17:31:04,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:31:04,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986157634] [2024-11-16 17:31:04,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:31:04,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:31:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:05,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:31:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:05,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:31:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:05,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:31:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:05,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:31:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:05,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:31:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:05,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:31:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:05,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:31:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:05,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:31:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:05,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:31:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:05,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:31:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:05,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:31:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:05,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:31:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:05,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:31:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:05,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:31:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:05,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:31:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:05,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:31:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 17:31:05,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:31:05,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986157634] [2024-11-16 17:31:05,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986157634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:31:05,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:31:05,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 17:31:05,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437221586] [2024-11-16 17:31:05,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:31:05,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 17:31:05,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:31:05,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 17:31:05,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:31:05,387 INFO L87 Difference]: Start difference. First operand 84 states and 112 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 17:31:05,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:31:05,583 INFO L93 Difference]: Finished difference Result 119 states and 149 transitions. [2024-11-16 17:31:05,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 17:31:05,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-11-16 17:31:05,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:31:05,587 INFO L225 Difference]: With dead ends: 119 [2024-11-16 17:31:05,587 INFO L226 Difference]: Without dead ends: 116 [2024-11-16 17:31:05,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-16 17:31:05,588 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 49 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:31:05,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 263 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:31:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-16 17:31:05,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 91. [2024-11-16 17:31:05,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 17:31:05,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 121 transitions. [2024-11-16 17:31:05,607 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 121 transitions. Word has length 105 [2024-11-16 17:31:05,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:31:05,607 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 121 transitions. [2024-11-16 17:31:05,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 17:31:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 121 transitions. [2024-11-16 17:31:05,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 17:31:05,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:31:05,609 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:05,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 17:31:05,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:31:05,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:31:05,610 INFO L85 PathProgramCache]: Analyzing trace with hash 298073634, now seen corresponding path program 1 times [2024-11-16 17:31:05,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:31:05,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921654622] [2024-11-16 17:31:05,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:31:05,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:31:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:31:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:31:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:31:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:31:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:31:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:31:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:31:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:31:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:31:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:31:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:31:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:31:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:31:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:31:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:31:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:31:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,417 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 17:31:06,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:31:06,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921654622] [2024-11-16 17:31:06,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921654622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:31:06,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:31:06,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 17:31:06,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040088913] [2024-11-16 17:31:06,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:31:06,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 17:31:06,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:31:06,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 17:31:06,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:31:06,420 INFO L87 Difference]: Start difference. First operand 91 states and 121 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 17:31:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:31:06,592 INFO L93 Difference]: Finished difference Result 118 states and 148 transitions. [2024-11-16 17:31:06,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 17:31:06,593 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-11-16 17:31:06,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:31:06,595 INFO L225 Difference]: With dead ends: 118 [2024-11-16 17:31:06,595 INFO L226 Difference]: Without dead ends: 115 [2024-11-16 17:31:06,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-16 17:31:06,597 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 35 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:31:06,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 299 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:31:06,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-16 17:31:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 87. [2024-11-16 17:31:06,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 62 states have internal predecessors, (71), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 17:31:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 115 transitions. [2024-11-16 17:31:06,626 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 115 transitions. Word has length 105 [2024-11-16 17:31:06,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:31:06,627 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 115 transitions. [2024-11-16 17:31:06,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 17:31:06,627 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 115 transitions. [2024-11-16 17:31:06,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 17:31:06,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:31:06,629 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:06,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 17:31:06,629 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:31:06,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:31:06,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1635819303, now seen corresponding path program 1 times [2024-11-16 17:31:06,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:31:06,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485023404] [2024-11-16 17:31:06,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:31:06,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:31:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:31:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:31:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:31:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:31:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:31:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:31:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:31:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:31:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:31:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:31:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:31:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:31:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:31:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:31:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:31:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:31:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:31:06,718 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 17:31:06,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:31:06,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485023404] [2024-11-16 17:31:06,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485023404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:31:06,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:31:06,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:31:06,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222772727] [2024-11-16 17:31:06,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:31:06,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 17:31:06,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:31:06,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 17:31:06,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:31:06,721 INFO L87 Difference]: Start difference. First operand 87 states and 115 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 17:31:06,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:31:06,737 INFO L93 Difference]: Finished difference Result 159 states and 212 transitions. [2024-11-16 17:31:06,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 17:31:06,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2024-11-16 17:31:06,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:31:06,738 INFO L225 Difference]: With dead ends: 159 [2024-11-16 17:31:06,738 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 17:31:06,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:31:06,741 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:31:06,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:31:06,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 17:31:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 17:31:06,742 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:31:06,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 17:31:06,743 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2024-11-16 17:31:06,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:31:06,743 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 17:31:06,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 17:31:06,743 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 17:31:06,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 17:31:06,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:31:06,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 17:31:06,751 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-16 17:31:06,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 17:31:07,119 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:31:07,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:31:07 BoogieIcfgContainer [2024-11-16 17:31:07,145 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:31:07,146 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:31:07,146 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:31:07,146 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:31:07,147 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:31:00" (3/4) ... [2024-11-16 17:31:07,149 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 17:31:07,155 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-16 17:31:07,161 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-16 17:31:07,162 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-16 17:31:07,162 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 17:31:07,162 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 17:31:07,267 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 17:31:07,270 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 17:31:07,270 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:31:07,271 INFO L158 Benchmark]: Toolchain (without parser) took 7915.09ms. Allocated memory was 148.9MB in the beginning and 262.1MB in the end (delta: 113.2MB). Free memory was 114.4MB in the beginning and 170.2MB in the end (delta: -55.7MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2024-11-16 17:31:07,271 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 109.1MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:31:07,271 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.65ms. Allocated memory is still 148.9MB. Free memory was 113.5MB in the beginning and 100.0MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 17:31:07,272 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.77ms. Allocated memory is still 148.9MB. Free memory was 100.0MB in the beginning and 98.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:31:07,272 INFO L158 Benchmark]: Boogie Preprocessor took 53.02ms. Allocated memory is still 148.9MB. Free memory was 98.0MB in the beginning and 95.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:31:07,272 INFO L158 Benchmark]: IcfgBuilder took 552.95ms. Allocated memory is still 148.9MB. Free memory was 95.9MB in the beginning and 110.5MB in the end (delta: -14.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 17:31:07,272 INFO L158 Benchmark]: TraceAbstraction took 6770.89ms. Allocated memory was 148.9MB in the beginning and 262.1MB in the end (delta: 113.2MB). Free memory was 110.3MB in the beginning and 175.4MB in the end (delta: -65.1MB). Peak memory consumption was 147.2MB. Max. memory is 16.1GB. [2024-11-16 17:31:07,273 INFO L158 Benchmark]: Witness Printer took 124.47ms. Allocated memory is still 262.1MB. Free memory was 175.4MB in the beginning and 170.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 17:31:07,274 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.10ms. Allocated memory is still 109.1MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.65ms. Allocated memory is still 148.9MB. Free memory was 113.5MB in the beginning and 100.0MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.77ms. Allocated memory is still 148.9MB. Free memory was 100.0MB in the beginning and 98.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.02ms. Allocated memory is still 148.9MB. Free memory was 98.0MB in the beginning and 95.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 552.95ms. Allocated memory is still 148.9MB. Free memory was 95.9MB in the beginning and 110.5MB in the end (delta: -14.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6770.89ms. Allocated memory was 148.9MB in the beginning and 262.1MB in the end (delta: 113.2MB). Free memory was 110.3MB in the beginning and 175.4MB in the end (delta: -65.1MB). Peak memory consumption was 147.2MB. Max. memory is 16.1GB. * Witness Printer took 124.47ms. Allocated memory is still 262.1MB. Free memory was 175.4MB in the beginning and 170.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 1625 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1247 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 451 IncrementalHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 378 mSDtfsCounter, 451 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=1, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 96 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 526 NumberOfCodeBlocks, 526 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 521 ConstructedInterpolants, 0 QuantifiedInterpolants, 1679 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2400/2400 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: 97]: 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_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) RESULT: Ultimate proved your program to be correct! [2024-11-16 17:31:07,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE