./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_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 05a6e6e8723c5d79d8476dd5b74b6ce5ae5199b412c2ad129a20e082f5fd2cdb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:42:45,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:42:45,954 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:42:45,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:42:45,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:42:45,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:42:45,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:42:45,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:42:45,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:42:45,983 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:42:45,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:42:45,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:42:45,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:42:45,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:42:45,985 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:42:45,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:42:45,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:42:45,987 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:42:45,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:42:45,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:42:45,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:42:45,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:42:45,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:42:45,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:42:45,991 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:42:45,991 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:42:45,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:42:45,991 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:42:45,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:42:45,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:42:45,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:42:45,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:42:45,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:42:45,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:42:45,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:42:45,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:42:45,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:42:45,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:42:45,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:42:45,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:42:45,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:42:45,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:42:45,995 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 -> 05a6e6e8723c5d79d8476dd5b74b6ce5ae5199b412c2ad129a20e082f5fd2cdb [2024-10-14 11:42:46,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:42:46,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:42:46,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:42:46,216 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:42:46,216 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:42:46,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-13.i [2024-10-14 11:42:47,460 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:42:47,617 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:42:47,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-13.i [2024-10-14 11:42:47,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3872b1547/a40a3a6410eb4003bfe5fe6b2f4380bf/FLAG8a84ac4fd [2024-10-14 11:42:48,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3872b1547/a40a3a6410eb4003bfe5fe6b2f4380bf [2024-10-14 11:42:48,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:42:48,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:42:48,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:42:48,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:42:48,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:42:48,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:42:48" (1/1) ... [2024-10-14 11:42:48,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3173cf7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:48, skipping insertion in model container [2024-10-14 11:42:48,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:42:48" (1/1) ... [2024-10-14 11:42:48,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:42:48,165 WARN L248 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_loopvsstraightlinecode_25-while_file-13.i[915,928] [2024-10-14 11:42:48,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:42:48,214 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:42:48,228 WARN L248 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_loopvsstraightlinecode_25-while_file-13.i[915,928] [2024-10-14 11:42:48,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:42:48,275 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:42:48,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:48 WrapperNode [2024-10-14 11:42:48,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:42:48,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:42:48,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:42:48,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:42:48,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:48" (1/1) ... [2024-10-14 11:42:48,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:48" (1/1) ... [2024-10-14 11:42:48,322 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2024-10-14 11:42:48,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:42:48,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:42:48,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:42:48,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:42:48,332 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:48" (1/1) ... [2024-10-14 11:42:48,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:48" (1/1) ... [2024-10-14 11:42:48,335 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:48" (1/1) ... [2024-10-14 11:42:48,353 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-10-14 11:42:48,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:48" (1/1) ... [2024-10-14 11:42:48,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:48" (1/1) ... [2024-10-14 11:42:48,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:48" (1/1) ... [2024-10-14 11:42:48,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:48" (1/1) ... [2024-10-14 11:42:48,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:48" (1/1) ... [2024-10-14 11:42:48,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:48" (1/1) ... [2024-10-14 11:42:48,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:42:48,369 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:42:48,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:42:48,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:42:48,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:48" (1/1) ... [2024-10-14 11:42:48,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:42:48,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:42:48,402 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-10-14 11:42:48,404 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-10-14 11:42:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:42:48,441 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:42:48,441 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:42:48,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:42:48,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:42:48,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:42:48,512 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:42:48,514 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:42:48,725 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 11:42:48,726 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:42:48,780 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:42:48,780 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:42:48,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:42:48 BoogieIcfgContainer [2024-10-14 11:42:48,781 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:42:48,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:42:48,784 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:42:48,787 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:42:48,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:42:48" (1/3) ... [2024-10-14 11:42:48,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3e3e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:42:48, skipping insertion in model container [2024-10-14 11:42:48,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:48" (2/3) ... [2024-10-14 11:42:48,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3e3e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:42:48, skipping insertion in model container [2024-10-14 11:42:48,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:42:48" (3/3) ... [2024-10-14 11:42:48,791 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-13.i [2024-10-14 11:42:48,805 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:42:48,806 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:42:48,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:42:48,857 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;@729d9c48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:42:48,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:42:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 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-10-14 11:42:48,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 11:42:48,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:42:48,869 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] [2024-10-14 11:42:48,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:42:48,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:42:48,874 INFO L85 PathProgramCache]: Analyzing trace with hash 933376894, now seen corresponding path program 1 times [2024-10-14 11:42:48,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:42:48,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378374901] [2024-10-14 11:42:48,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:42:48,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:42:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:42:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:42:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:42:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:42:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:42:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:42:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:42:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:42:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:42:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:42:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:42:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:42:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:42:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:42:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:42:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:42:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:42:49,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:42:49,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378374901] [2024-10-14 11:42:49,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378374901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:42:49,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:42:49,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:42:49,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514938640] [2024-10-14 11:42:49,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:42:49,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:42:49,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:42:49,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:42:49,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:42:49,230 INFO L87 Difference]: Start difference. First operand has 40 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 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) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-10-14 11:42:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:42:49,263 INFO L93 Difference]: Finished difference Result 77 states and 136 transitions. [2024-10-14 11:42:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:42:49,266 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 96 [2024-10-14 11:42:49,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:42:49,273 INFO L225 Difference]: With dead ends: 77 [2024-10-14 11:42:49,274 INFO L226 Difference]: Without dead ends: 38 [2024-10-14 11:42:49,278 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-10-14 11:42:49,281 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 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-10-14 11:42:49,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:42:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-14 11:42:49,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-14 11:42:49,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-10-14 11:42:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2024-10-14 11:42:49,320 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 96 [2024-10-14 11:42:49,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:42:49,320 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2024-10-14 11:42:49,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-10-14 11:42:49,321 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2024-10-14 11:42:49,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 11:42:49,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:42:49,324 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] [2024-10-14 11:42:49,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:42:49,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:42:49,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:42:49,325 INFO L85 PathProgramCache]: Analyzing trace with hash -369667202, now seen corresponding path program 1 times [2024-10-14 11:42:49,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:42:49,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451947796] [2024-10-14 11:42:49,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:42:49,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:42:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:42:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:42:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:42:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:42:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:42:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:42:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:42:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:42:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:42:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:42:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:42:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:42:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:42:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:42:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:42:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:42:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:42:49,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:42:49,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451947796] [2024-10-14 11:42:49,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451947796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:42:49,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:42:49,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:42:49,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079530602] [2024-10-14 11:42:49,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:42:49,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:42:49,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:42:49,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:42:49,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:42:49,504 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-10-14 11:42:49,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:42:49,555 INFO L93 Difference]: Finished difference Result 104 states and 155 transitions. [2024-10-14 11:42:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:42:49,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 96 [2024-10-14 11:42:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:42:49,558 INFO L225 Difference]: With dead ends: 104 [2024-10-14 11:42:49,559 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 11:42:49,560 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-10-14 11:42:49,561 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 51 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:42:49,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 134 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:42:49,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 11:42:49,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 38. [2024-10-14 11:42:49,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 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-10-14 11:42:49,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2024-10-14 11:42:49,573 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 96 [2024-10-14 11:42:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:42:49,577 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2024-10-14 11:42:49,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-10-14 11:42:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2024-10-14 11:42:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 11:42:49,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:42:49,580 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] [2024-10-14 11:42:49,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:42:49,580 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:42:49,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:42:49,581 INFO L85 PathProgramCache]: Analyzing trace with hash -367820160, now seen corresponding path program 1 times [2024-10-14 11:42:49,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:42:49,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148485276] [2024-10-14 11:42:49,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:42:49,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:42:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:42:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:42:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:42:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:42:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:42:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:42:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:42:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:42:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:42:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:42:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:42:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:42:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:42:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:42:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:42:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:42:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:42:49,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:42:49,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148485276] [2024-10-14 11:42:49,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148485276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:42:49,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:42:49,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:42:49,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125981819] [2024-10-14 11:42:49,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:42:49,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:42:49,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:42:49,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:42:49,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:42:49,906 INFO L87 Difference]: Start difference. First operand 38 states and 54 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-10-14 11:42:49,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:42:49,927 INFO L93 Difference]: Finished difference Result 75 states and 107 transitions. [2024-10-14 11:42:49,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:42:49,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 96 [2024-10-14 11:42:49,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:42:49,931 INFO L225 Difference]: With dead ends: 75 [2024-10-14 11:42:49,931 INFO L226 Difference]: Without dead ends: 38 [2024-10-14 11:42:49,931 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-10-14 11:42:49,932 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 49 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-10-14 11:42:49,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 49 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:42:49,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-14 11:42:49,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-14 11:42:49,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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-10-14 11:42:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-10-14 11:42:49,944 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 96 [2024-10-14 11:42:49,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:42:49,944 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-10-14 11:42:49,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-10-14 11:42:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-10-14 11:42:49,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 11:42:49,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:42:49,947 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] [2024-10-14 11:42:49,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:42:49,948 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:42:49,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:42:49,948 INFO L85 PathProgramCache]: Analyzing trace with hash -367760578, now seen corresponding path program 1 times [2024-10-14 11:42:49,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:42:49,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647137342] [2024-10-14 11:42:49,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:42:49,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:42:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:53,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:42:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:53,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:42:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:53,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:42:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:53,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:42:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:53,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:42:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:53,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:42:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:53,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:42:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:53,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:42:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:53,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:42:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:53,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:42:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:53,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:42:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:53,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:42:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:53,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:42:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:53,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:42:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:53,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:42:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:53,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:42:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:42:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:42:53,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:42:53,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647137342] [2024-10-14 11:42:53,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647137342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:42:53,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:42:53,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 11:42:53,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16705411] [2024-10-14 11:42:53,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:42:53,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 11:42:53,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:42:53,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 11:42:53,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 11:42:53,800 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-10-14 11:42:53,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:42:53,941 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2024-10-14 11:42:53,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 11:42:53,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 96 [2024-10-14 11:42:53,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:42:53,946 INFO L225 Difference]: With dead ends: 62 [2024-10-14 11:42:53,946 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 11:42:53,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:42:53,951 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 37 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:42:53,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 231 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:42:53,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 11:42:53,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 11:42:53,952 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-10-14 11:42:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 11:42:53,953 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2024-10-14 11:42:53,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:42:53,953 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 11:42:53,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-10-14 11:42:53,956 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 11:42:53,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 11:42:53,958 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:42:53,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:42:53,961 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 11:42:53,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 11:42:54,229 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:42:54,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:42:54 BoogieIcfgContainer [2024-10-14 11:42:54,244 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:42:54,244 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:42:54,244 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:42:54,245 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:42:54,245 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:42:48" (3/4) ... [2024-10-14 11:42:54,247 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 11:42:54,250 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 11:42:54,253 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-14 11:42:54,253 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-14 11:42:54,254 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 11:42:54,254 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 11:42:54,340 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 11:42:54,341 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 11:42:54,341 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:42:54,341 INFO L158 Benchmark]: Toolchain (without parser) took 6323.40ms. Allocated memory was 144.7MB in the beginning and 419.4MB in the end (delta: 274.7MB). Free memory was 88.3MB in the beginning and 333.3MB in the end (delta: -245.0MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2024-10-14 11:42:54,341 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 144.7MB. Free memory is still 106.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:42:54,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.42ms. Allocated memory is still 144.7MB. Free memory was 87.9MB in the beginning and 74.4MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 11:42:54,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.32ms. Allocated memory is still 144.7MB. Free memory was 74.1MB in the beginning and 70.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:42:54,342 INFO L158 Benchmark]: Boogie Preprocessor took 45.50ms. Allocated memory is still 144.7MB. Free memory was 70.4MB in the beginning and 63.5MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 11:42:54,343 INFO L158 Benchmark]: RCFGBuilder took 411.86ms. Allocated memory was 144.7MB in the beginning and 205.5MB in the end (delta: 60.8MB). Free memory was 63.5MB in the beginning and 159.7MB in the end (delta: -96.2MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-10-14 11:42:54,343 INFO L158 Benchmark]: TraceAbstraction took 5461.38ms. Allocated memory was 205.5MB in the beginning and 419.4MB in the end (delta: 213.9MB). Free memory was 158.6MB in the beginning and 339.5MB in the end (delta: -180.9MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2024-10-14 11:42:54,343 INFO L158 Benchmark]: Witness Printer took 96.37ms. Allocated memory is still 419.4MB. Free memory was 339.5MB in the beginning and 333.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 11:42:54,344 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.16ms. Allocated memory is still 144.7MB. Free memory is still 106.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.42ms. Allocated memory is still 144.7MB. Free memory was 87.9MB in the beginning and 74.4MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.32ms. Allocated memory is still 144.7MB. Free memory was 74.1MB in the beginning and 70.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.50ms. Allocated memory is still 144.7MB. Free memory was 70.4MB in the beginning and 63.5MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 411.86ms. Allocated memory was 144.7MB in the beginning and 205.5MB in the end (delta: 60.8MB). Free memory was 63.5MB in the beginning and 159.7MB in the end (delta: -96.2MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5461.38ms. Allocated memory was 205.5MB in the beginning and 419.4MB in the end (delta: 213.9MB). Free memory was 158.6MB in the beginning and 339.5MB in the end (delta: -180.9MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * Witness Printer took 96.37ms. Allocated memory is still 419.4MB. Free memory was 339.5MB in the beginning and 333.3MB 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, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 467 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 199 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 268 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 29 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 809 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]: Loop Invariant Derived loop invariant: ((25 <= var_1_1) && (0 <= 0)) - 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)) RESULT: Ultimate proved your program to be correct! [2024-10-14 11:42:54,372 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