./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-13.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 0774421f7ba176c3cd99ed79363ce4f8b6083c8c0f33805bbcb720d76b34f63e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:30:34,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:30:34,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:30:34,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:30:34,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:30:34,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:30:34,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:30:34,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:30:34,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:30:34,982 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:30:34,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:30:34,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:30:34,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:30:34,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:30:34,988 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:30:34,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:30:34,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:30:34,989 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:30:34,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:30:34,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:30:34,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:30:34,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:30:34,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:30:34,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:30:34,994 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:30:34,995 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:30:34,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:30:34,995 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:30:34,996 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:30:34,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:30:34,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:30:34,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:30:34,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:30:34,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:30:34,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:30:34,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:30:34,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:30:34,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:30:34,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:30:34,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:30:34,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:30:35,001 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:30:35,001 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 -> 0774421f7ba176c3cd99ed79363ce4f8b6083c8c0f33805bbcb720d76b34f63e [2024-11-10 08:30:35,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:30:35,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:30:35,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:30:35,307 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:30:35,307 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:30:35,309 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-13.i [2024-11-10 08:30:36,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:30:37,045 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:30:37,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-13.i [2024-11-10 08:30:37,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8237eac47/fce08a2bf8414ca99747b282eb1abb5e/FLAG4dd7dc5ce [2024-11-10 08:30:37,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8237eac47/fce08a2bf8414ca99747b282eb1abb5e [2024-11-10 08:30:37,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:30:37,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:30:37,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:30:37,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:30:37,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:30:37,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:30:37" (1/1) ... [2024-11-10 08:30:37,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@566e698f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:30:37, skipping insertion in model container [2024-11-10 08:30:37,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:30:37" (1/1) ... [2024-11-10 08:30:37,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:30:37,268 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-13.i[915,928] [2024-11-10 08:30:37,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:30:37,319 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:30:37,331 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-13.i[915,928] [2024-11-10 08:30:37,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:30:37,384 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:30:37,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:30:37 WrapperNode [2024-11-10 08:30:37,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:30:37,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:30:37,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:30:37,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:30:37,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:30:37" (1/1) ... [2024-11-10 08:30:37,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:30:37" (1/1) ... [2024-11-10 08:30:37,437 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-11-10 08:30:37,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:30:37,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:30:37,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:30:37,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:30:37,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:30:37" (1/1) ... [2024-11-10 08:30:37,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:30:37" (1/1) ... [2024-11-10 08:30:37,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:30:37" (1/1) ... [2024-11-10 08:30:37,519 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:30:37,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:30:37" (1/1) ... [2024-11-10 08:30:37,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:30:37" (1/1) ... [2024-11-10 08:30:37,538 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:30:37" (1/1) ... [2024-11-10 08:30:37,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:30:37" (1/1) ... [2024-11-10 08:30:37,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:30:37" (1/1) ... [2024-11-10 08:30:37,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:30:37" (1/1) ... [2024-11-10 08:30:37,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:30:37,564 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:30:37,564 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:30:37,564 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:30:37,565 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:30:37" (1/1) ... [2024-11-10 08:30:37,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:30:37,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:30:37,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:30:37,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:30:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:30:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:30:37,654 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:30:37,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:30:37,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:30:37,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:30:37,727 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:30:37,729 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:30:38,056 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 08:30:38,056 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:30:38,074 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:30:38,075 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:30:38,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:30:38 BoogieIcfgContainer [2024-11-10 08:30:38,076 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:30:38,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:30:38,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:30:38,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:30:38,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:30:37" (1/3) ... [2024-11-10 08:30:38,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3d9519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:30:38, skipping insertion in model container [2024-11-10 08:30:38,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:30:37" (2/3) ... [2024-11-10 08:30:38,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3d9519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:30:38, skipping insertion in model container [2024-11-10 08:30:38,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:30:38" (3/3) ... [2024-11-10 08:30:38,090 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-13.i [2024-11-10 08:30:38,108 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:30:38,108 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:30:38,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:30:38,179 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;@5064aba9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:30:38,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:30:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 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-10 08:30:38,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 08:30:38,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:30:38,198 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] [2024-11-10 08:30:38,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:30:38,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:30:38,207 INFO L85 PathProgramCache]: Analyzing trace with hash -118137280, now seen corresponding path program 1 times [2024-11-10 08:30:38,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:30:38,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639545151] [2024-11-10 08:30:38,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:30:38,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:30:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:30:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:30:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:30:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:30:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:30:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:30:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:30:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:30:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:30:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:30:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:30:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:30:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:30:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:30:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:30:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:30:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,613 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-10 08:30:38,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:30:38,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639545151] [2024-11-10 08:30:38,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639545151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:30:38,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:30:38,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:30:38,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039051377] [2024-11-10 08:30:38,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:30:38,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:30:38,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:30:38,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:30:38,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:30:38,652 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 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 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 08:30:38,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:30:38,683 INFO L93 Difference]: Finished difference Result 92 states and 151 transitions. [2024-11-10 08:30:38,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:30:38,686 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2024-11-10 08:30:38,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:30:38,695 INFO L225 Difference]: With dead ends: 92 [2024-11-10 08:30:38,695 INFO L226 Difference]: Without dead ends: 45 [2024-11-10 08:30:38,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:30:38,706 INFO L432 NwaCegarLoop]: 63 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, 63 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:30:38,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:30:38,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-10 08:30:38,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-10 08:30:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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-10 08:30:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2024-11-10 08:30:38,760 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 103 [2024-11-10 08:30:38,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:30:38,762 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2024-11-10 08:30:38,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 08:30:38,763 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2024-11-10 08:30:38,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 08:30:38,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:30:38,768 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] [2024-11-10 08:30:38,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:30:38,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:30:38,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:30:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1493225024, now seen corresponding path program 1 times [2024-11-10 08:30:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:30:38,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403304724] [2024-11-10 08:30:38,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:30:38,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:30:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:30:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:30:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:30:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:30:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:30:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:38,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:30:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:39,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:30:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:39,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:30:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:39,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:30:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:39,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:30:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:39,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:30:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:39,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:30:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:39,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:30:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:39,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:30:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:39,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:30:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:39,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:30:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:39,048 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-10 08:30:39,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:30:39,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403304724] [2024-11-10 08:30:39,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403304724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:30:39,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:30:39,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:30:39,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712914740] [2024-11-10 08:30:39,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:30:39,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:30:39,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:30:39,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:30:39,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:30:39,054 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-10 08:30:39,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:30:39,115 INFO L93 Difference]: Finished difference Result 118 states and 169 transitions. [2024-11-10 08:30:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:30:39,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 103 [2024-11-10 08:30:39,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:30:39,120 INFO L225 Difference]: With dead ends: 118 [2024-11-10 08:30:39,121 INFO L226 Difference]: Without dead ends: 76 [2024-11-10 08:30:39,123 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-10 08:30:39,125 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 56 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:30:39,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:30:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-10 08:30:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 45. [2024-11-10 08:30:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 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-10 08:30:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2024-11-10 08:30:39,147 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 103 [2024-11-10 08:30:39,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:30:39,149 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2024-11-10 08:30:39,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-10 08:30:39,150 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2024-11-10 08:30:39,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 08:30:39,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:30:39,153 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] [2024-11-10 08:30:39,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:30:39,154 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:30:39,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:30:39,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1058931937, now seen corresponding path program 1 times [2024-11-10 08:30:39,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:30:39,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658792920] [2024-11-10 08:30:39,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:30:39,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:30:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:41,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:30:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:41,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:30:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:41,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:30:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:41,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:30:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:41,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:30:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:41,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:30:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:41,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:30:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:41,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:30:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:41,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:30:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:41,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:30:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:41,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:30:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:41,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:30:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:41,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:30:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:41,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:30:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:41,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:30:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:41,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:30:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:41,591 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-10 08:30:41,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:30:41,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658792920] [2024-11-10 08:30:41,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658792920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:30:41,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:30:41,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 08:30:41,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256013271] [2024-11-10 08:30:41,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:30:41,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 08:30:41,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:30:41,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 08:30:41,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:30:41,598 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-10 08:30:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:30:41,971 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2024-11-10 08:30:41,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 08:30:41,971 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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 103 [2024-11-10 08:30:41,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:30:41,976 INFO L225 Difference]: With dead ends: 79 [2024-11-10 08:30:41,976 INFO L226 Difference]: Without dead ends: 76 [2024-11-10 08:30:41,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-10 08:30:41,978 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 41 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:30:41,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 354 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:30:41,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-10 08:30:41,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2024-11-10 08:30:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 08:30:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2024-11-10 08:30:41,993 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 99 transitions. Word has length 103 [2024-11-10 08:30:41,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:30:41,994 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 99 transitions. [2024-11-10 08:30:41,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-10 08:30:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 99 transitions. [2024-11-10 08:30:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 08:30:41,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:30:41,996 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] [2024-11-10 08:30:41,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 08:30:41,997 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:30:41,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:30:41,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1946435618, now seen corresponding path program 1 times [2024-11-10 08:30:41,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:30:41,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983295642] [2024-11-10 08:30:41,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:30:41,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:30:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:42,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:30:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:42,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:30:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:42,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:30:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:42,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:30:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:42,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:30:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:42,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:30:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:42,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:30:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:42,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:30:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:42,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:30:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:42,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:30:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:42,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:30:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:42,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:30:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:42,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:30:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:42,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:30:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:42,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:30:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:42,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:30:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:30:42,227 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-10 08:30:42,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:30:42,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983295642] [2024-11-10 08:30:42,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983295642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:30:42,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:30:42,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:30:42,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325333208] [2024-11-10 08:30:42,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:30:42,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:30:42,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:30:42,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:30:42,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:30:42,230 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-10 08:30:42,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:30:42,251 INFO L93 Difference]: Finished difference Result 139 states and 187 transitions. [2024-11-10 08:30:42,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:30:42,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 103 [2024-11-10 08:30:42,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:30:42,253 INFO L225 Difference]: With dead ends: 139 [2024-11-10 08:30:42,253 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 08:30:42,254 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-10 08:30:42,255 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:30:42,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 54 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:30:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 08:30:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 08:30:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 08:30:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 08:30:42,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2024-11-10 08:30:42,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:30:42,258 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 08:30:42,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-10 08:30:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 08:30:42,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 08:30:42,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:30:42,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 08:30:42,265 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 08:30:42,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 08:30:42,638 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:30:42,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:30:42 BoogieIcfgContainer [2024-11-10 08:30:42,669 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:30:42,670 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:30:42,670 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:30:42,671 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:30:42,671 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:30:38" (3/4) ... [2024-11-10 08:30:42,673 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 08:30:42,678 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 08:30:42,683 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 08:30:42,684 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-10 08:30:42,685 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 08:30:42,685 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 08:30:42,780 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 08:30:42,780 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 08:30:42,780 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:30:42,781 INFO L158 Benchmark]: Toolchain (without parser) took 5704.03ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 119.1MB in the beginning and 113.6MB in the end (delta: 5.5MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. [2024-11-10 08:30:42,781 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 146.8MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:30:42,782 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.78ms. Allocated memory is still 146.8MB. Free memory was 119.1MB in the beginning and 104.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 08:30:42,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.44ms. Allocated memory is still 146.8MB. Free memory was 104.3MB in the beginning and 100.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 08:30:42,782 INFO L158 Benchmark]: Boogie Preprocessor took 124.01ms. Allocated memory is still 146.8MB. Free memory was 100.2MB in the beginning and 112.8MB in the end (delta: -12.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 08:30:42,782 INFO L158 Benchmark]: IcfgBuilder took 512.69ms. Allocated memory is still 146.8MB. Free memory was 112.8MB in the beginning and 93.1MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 08:30:42,783 INFO L158 Benchmark]: TraceAbstraction took 4589.45ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 92.7MB in the beginning and 119.9MB in the end (delta: -27.2MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2024-11-10 08:30:42,783 INFO L158 Benchmark]: Witness Printer took 110.40ms. Allocated memory is still 216.0MB. Free memory was 119.9MB in the beginning and 113.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 08:30:42,784 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.23ms. Allocated memory is still 146.8MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.78ms. Allocated memory is still 146.8MB. Free memory was 119.1MB in the beginning and 104.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.44ms. Allocated memory is still 146.8MB. Free memory was 104.3MB in the beginning and 100.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 124.01ms. Allocated memory is still 146.8MB. Free memory was 100.2MB in the beginning and 112.8MB in the end (delta: -12.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 512.69ms. Allocated memory is still 146.8MB. Free memory was 112.8MB in the beginning and 93.1MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4589.45ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 92.7MB in the beginning and 119.9MB in the end (delta: -27.2MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. * Witness Printer took 110.40ms. Allocated memory is still 216.0MB. Free memory was 119.9MB in the beginning and 113.6MB in the end (delta: 6.3MB). 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, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 622 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 316 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 117 IncrementalHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 306 mSDtfsCounter, 117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=3, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 32 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 876 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1920/1920 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: 93]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((25 <= var_1_1) && (0 <= 0)) Ensures: (((25 <= var_1_1) && (0 <= 0)) && (((((((((((((((((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_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))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (var_1_19 == \old(var_1_19))) && (var_1_20 == \old(var_1_20)))) RESULT: Ultimate proved your program to be correct! [2024-11-10 08:30:42,818 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