./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-39.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 8b89c5a452639706785e6c59e59bc9495b7c670c1d520018d254073dacdf7a8c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:34:43,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:34:44,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:34:44,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:34:44,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:34:44,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:34:44,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:34:44,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:34:44,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:34:44,084 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:34:44,085 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:34:44,085 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:34:44,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:34:44,086 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:34:44,086 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:34:44,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:34:44,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:34:44,089 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:34:44,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:34:44,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:34:44,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:34:44,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:34:44,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:34:44,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:34:44,095 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:34:44,095 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:34:44,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:34:44,095 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:34:44,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:34:44,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:34:44,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:34:44,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:34:44,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:34:44,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:34:44,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:34:44,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:34:44,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:34:44,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:34:44,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:34:44,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:34:44,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:34:44,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:34:44,101 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 -> 8b89c5a452639706785e6c59e59bc9495b7c670c1d520018d254073dacdf7a8c [2024-10-24 10:34:44,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:34:44,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:34:44,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:34:44,365 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:34:44,366 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:34:44,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-39.i [2024-10-24 10:34:45,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:34:46,000 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:34:46,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-39.i [2024-10-24 10:34:46,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8502c0037/ac1a697565e1444986c181bcea50f98c/FLAG7d39ffe88 [2024-10-24 10:34:46,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8502c0037/ac1a697565e1444986c181bcea50f98c [2024-10-24 10:34:46,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:34:46,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:34:46,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:34:46,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:34:46,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:34:46,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:34:46" (1/1) ... [2024-10-24 10:34:46,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2130023d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:46, skipping insertion in model container [2024-10-24 10:34:46,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:34:46" (1/1) ... [2024-10-24 10:34:46,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:34:46,248 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_operatoramount_amount25_file-39.i[915,928] [2024-10-24 10:34:46,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:34:46,323 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:34:46,335 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_operatoramount_amount25_file-39.i[915,928] [2024-10-24 10:34:46,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:34:46,423 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:34:46,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:46 WrapperNode [2024-10-24 10:34:46,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:34:46,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:34:46,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:34:46,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:34:46,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:46" (1/1) ... [2024-10-24 10:34:46,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:46" (1/1) ... [2024-10-24 10:34:46,469 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-10-24 10:34:46,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:34:46,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:34:46,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:34:46,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:34:46,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:46" (1/1) ... [2024-10-24 10:34:46,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:46" (1/1) ... [2024-10-24 10:34:46,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:46" (1/1) ... [2024-10-24 10:34:46,500 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-24 10:34:46,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:46" (1/1) ... [2024-10-24 10:34:46,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:46" (1/1) ... [2024-10-24 10:34:46,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:46" (1/1) ... [2024-10-24 10:34:46,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:46" (1/1) ... [2024-10-24 10:34:46,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:46" (1/1) ... [2024-10-24 10:34:46,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:46" (1/1) ... [2024-10-24 10:34:46,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:34:46,532 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:34:46,532 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:34:46,532 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:34:46,533 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:46" (1/1) ... [2024-10-24 10:34:46,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:34:46,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:34:46,571 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-24 10:34:46,578 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-24 10:34:46,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:34:46,633 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:34:46,633 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:34:46,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:34:46,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:34:46,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:34:46,715 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:34:46,718 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:34:46,956 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 10:34:46,956 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:34:46,990 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:34:46,991 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:34:46,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:34:46 BoogieIcfgContainer [2024-10-24 10:34:46,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:34:46,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:34:46,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:34:46,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:34:46,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:34:46" (1/3) ... [2024-10-24 10:34:46,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337e4696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:34:46, skipping insertion in model container [2024-10-24 10:34:46,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:46" (2/3) ... [2024-10-24 10:34:46,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337e4696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:34:46, skipping insertion in model container [2024-10-24 10:34:46,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:34:46" (3/3) ... [2024-10-24 10:34:47,000 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-39.i [2024-10-24 10:34:47,015 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:34:47,016 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:34:47,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:34:47,086 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;@107bfa94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:34:47,086 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:34:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 10:34:47,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 10:34:47,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:47,102 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:34:47,102 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:47,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:47,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1160943542, now seen corresponding path program 1 times [2024-10-24 10:34:47,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:34:47,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735803250] [2024-10-24 10:34:47,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:47,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:34:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:49,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:34:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:49,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:34:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:49,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:34:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:49,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 10:34:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:49,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 10:34:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:49,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 10:34:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:49,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:34:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:49,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 10:34:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:49,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 10:34:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:49,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 10:34:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:49,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 10:34:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:49,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 10:34:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:49,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 10:34:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 10:34:49,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:34:49,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735803250] [2024-10-24 10:34:49,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735803250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:49,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:49,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 10:34:49,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339885844] [2024-10-24 10:34:49,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:49,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 10:34:49,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:34:49,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 10:34:49,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:34:49,502 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 10:34:50,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:50,050 INFO L93 Difference]: Finished difference Result 146 states and 264 transitions. [2024-10-24 10:34:50,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:34:50,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 83 [2024-10-24 10:34:50,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:50,064 INFO L225 Difference]: With dead ends: 146 [2024-10-24 10:34:50,064 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 10:34:50,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:34:50,074 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 64 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:50,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 231 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 10:34:50,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 10:34:50,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2024-10-24 10:34:50,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 10:34:50,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2024-10-24 10:34:50,153 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 83 [2024-10-24 10:34:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:50,155 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2024-10-24 10:34:50,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 10:34:50,156 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2024-10-24 10:34:50,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 10:34:50,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:50,159 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:34:50,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:34:50,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:50,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:50,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1380550262, now seen corresponding path program 1 times [2024-10-24 10:34:50,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:34:50,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996757426] [2024-10-24 10:34:50,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:50,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:34:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:51,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:34:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:51,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:34:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:51,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:34:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:51,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 10:34:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:51,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 10:34:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:51,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 10:34:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:51,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:34:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:51,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 10:34:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:51,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 10:34:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:51,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 10:34:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:51,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 10:34:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:51,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 10:34:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:51,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 10:34:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 10:34:51,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:34:51,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996757426] [2024-10-24 10:34:51,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996757426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:51,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:51,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 10:34:51,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412071303] [2024-10-24 10:34:51,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:51,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:34:51,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:34:51,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:34:51,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:34:51,221 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 10:34:51,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:51,427 INFO L93 Difference]: Finished difference Result 106 states and 147 transitions. [2024-10-24 10:34:51,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 10:34:51,428 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2024-10-24 10:34:51,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:51,430 INFO L225 Difference]: With dead ends: 106 [2024-10-24 10:34:51,430 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 10:34:51,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-24 10:34:51,432 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 31 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:51,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 161 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:34:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 10:34:51,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2024-10-24 10:34:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 60 states have internal predecessors, (76), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 10:34:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2024-10-24 10:34:51,462 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 84 [2024-10-24 10:34:51,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:51,464 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2024-10-24 10:34:51,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 10:34:51,465 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2024-10-24 10:34:51,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 10:34:51,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:51,467 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:34:51,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:34:51,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:51,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:51,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1380490680, now seen corresponding path program 1 times [2024-10-24 10:34:51,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:34:51,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442146986] [2024-10-24 10:34:51,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:51,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:34:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:34:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:34:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:34:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 10:34:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 10:34:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 10:34:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:34:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 10:34:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 10:34:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 10:34:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 10:34:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 10:34:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 10:34:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 10:34:52,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:34:52,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442146986] [2024-10-24 10:34:52,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442146986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:52,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:52,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 10:34:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092890728] [2024-10-24 10:34:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:52,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:34:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:34:52,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:34:52,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:34:52,296 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 10:34:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:52,446 INFO L93 Difference]: Finished difference Result 107 states and 150 transitions. [2024-10-24 10:34:52,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 10:34:52,446 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2024-10-24 10:34:52,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:52,448 INFO L225 Difference]: With dead ends: 107 [2024-10-24 10:34:52,448 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 10:34:52,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-24 10:34:52,449 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:52,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 229 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:34:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 10:34:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2024-10-24 10:34:52,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 65 states have internal predecessors, (84), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 10:34:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-24 10:34:52,465 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 84 [2024-10-24 10:34:52,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:52,466 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-24 10:34:52,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 10:34:52,466 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-24 10:34:52,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 10:34:52,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:52,468 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:34:52,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:34:52,468 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:52,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:52,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1639892609, now seen corresponding path program 1 times [2024-10-24 10:34:52,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:34:52,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600418424] [2024-10-24 10:34:52,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:52,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:34:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:34:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:34:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:34:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 10:34:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 10:34:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 10:34:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:34:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 10:34:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 10:34:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 10:34:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 10:34:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 10:34:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 10:34:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 10:34:52,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:34:52,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600418424] [2024-10-24 10:34:52,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600418424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:52,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:52,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:34:52,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365416068] [2024-10-24 10:34:52,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:52,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:34:52,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:34:52,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:34:52,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:34:52,626 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 10:34:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:52,721 INFO L93 Difference]: Finished difference Result 226 states and 325 transitions. [2024-10-24 10:34:52,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:34:52,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2024-10-24 10:34:52,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:52,724 INFO L225 Difference]: With dead ends: 226 [2024-10-24 10:34:52,724 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 10:34:52,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:34:52,726 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 36 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:52,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 157 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:34:52,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 10:34:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2024-10-24 10:34:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.244186046511628) internal successors, (107), 86 states have internal predecessors, (107), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 10:34:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 185 transitions. [2024-10-24 10:34:52,752 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 185 transitions. Word has length 84 [2024-10-24 10:34:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:52,753 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 185 transitions. [2024-10-24 10:34:52,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 10:34:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 185 transitions. [2024-10-24 10:34:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 10:34:52,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:52,755 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:52,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 10:34:52,755 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:52,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1141709522, now seen corresponding path program 1 times [2024-10-24 10:34:52,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:34:52,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089978598] [2024-10-24 10:34:52,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:52,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:34:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:34:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:34:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:34:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 10:34:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 10:34:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 10:34:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:34:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 10:34:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 10:34:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 10:34:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 10:34:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 10:34:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 10:34:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:34:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:34:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 10:34:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:34:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:34:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 10:34:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 10:34:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 10:34:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 10:34:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 10:34:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 10:34:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 10:34:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 10:34:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2024-10-24 10:34:54,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:34:54,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089978598] [2024-10-24 10:34:54,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089978598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:54,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:54,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 10:34:54,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888171781] [2024-10-24 10:34:54,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:54,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 10:34:54,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:34:54,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 10:34:54,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 10:34:54,421 INFO L87 Difference]: Start difference. First operand 129 states and 185 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 10:34:55,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:55,065 INFO L93 Difference]: Finished difference Result 150 states and 206 transitions. [2024-10-24 10:34:55,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 10:34:55,066 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 167 [2024-10-24 10:34:55,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:55,068 INFO L225 Difference]: With dead ends: 150 [2024-10-24 10:34:55,068 INFO L226 Difference]: Without dead ends: 148 [2024-10-24 10:34:55,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2024-10-24 10:34:55,070 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 30 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:55,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 223 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:34:55,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-24 10:34:55,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 124. [2024-10-24 10:34:55,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 10:34:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 177 transitions. [2024-10-24 10:34:55,094 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 177 transitions. Word has length 167 [2024-10-24 10:34:55,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:55,095 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 177 transitions. [2024-10-24 10:34:55,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 10:34:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 177 transitions. [2024-10-24 10:34:55,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 10:34:55,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:55,102 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:55,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 10:34:55,103 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:55,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:55,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1298593554, now seen corresponding path program 1 times [2024-10-24 10:34:55,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:34:55,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913847412] [2024-10-24 10:34:55,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:55,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:34:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:34:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:34:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:34:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 10:34:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 10:34:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 10:34:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:34:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 10:34:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 10:34:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 10:34:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 10:34:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 10:34:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 10:34:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:34:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:34:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 10:34:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:34:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:34:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 10:34:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 10:34:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 10:34:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 10:34:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 10:34:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 10:34:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 10:34:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 10:34:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2024-10-24 10:34:56,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:34:56,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913847412] [2024-10-24 10:34:56,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913847412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:56,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:56,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 10:34:56,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284671215] [2024-10-24 10:34:56,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:56,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 10:34:56,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:34:56,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 10:34:56,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 10:34:56,320 INFO L87 Difference]: Start difference. First operand 124 states and 177 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 10:34:56,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:56,500 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2024-10-24 10:34:56,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 10:34:56,501 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 168 [2024-10-24 10:34:56,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:56,503 INFO L225 Difference]: With dead ends: 144 [2024-10-24 10:34:56,503 INFO L226 Difference]: Without dead ends: 142 [2024-10-24 10:34:56,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-24 10:34:56,505 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 29 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:56,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 299 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:34:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-24 10:34:56,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 124. [2024-10-24 10:34:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 10:34:56,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 177 transitions. [2024-10-24 10:34:56,541 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 177 transitions. Word has length 168 [2024-10-24 10:34:56,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:56,541 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 177 transitions. [2024-10-24 10:34:56,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 10:34:56,542 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 177 transitions. [2024-10-24 10:34:56,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 10:34:56,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:56,544 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:56,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 10:34:56,545 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:56,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:56,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1298533972, now seen corresponding path program 1 times [2024-10-24 10:34:56,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:34:56,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43301538] [2024-10-24 10:34:56,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:56,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:34:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:34:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:34:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:34:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 10:34:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 10:34:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 10:34:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:34:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 10:34:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 10:34:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 10:34:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 10:34:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 10:34:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 10:34:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:34:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:34:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 10:34:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:34:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:34:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 10:34:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 10:34:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 10:34:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 10:34:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 10:34:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 10:34:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 10:34:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 10:34:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:57,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2024-10-24 10:34:57,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:34:57,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43301538] [2024-10-24 10:34:57,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43301538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:57,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:57,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 10:34:57,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671777296] [2024-10-24 10:34:57,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:57,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 10:34:57,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:34:57,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 10:34:57,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-24 10:34:57,470 INFO L87 Difference]: Start difference. First operand 124 states and 177 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 10:34:57,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:57,607 INFO L93 Difference]: Finished difference Result 138 states and 194 transitions. [2024-10-24 10:34:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 10:34:57,608 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 168 [2024-10-24 10:34:57,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:57,609 INFO L225 Difference]: With dead ends: 138 [2024-10-24 10:34:57,609 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 10:34:57,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 10:34:57,611 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 27 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:57,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 205 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:34:57,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 10:34:57,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 10:34:57,614 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-24 10:34:57,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 10:34:57,614 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 168 [2024-10-24 10:34:57,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:57,615 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 10:34:57,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 10:34:57,615 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 10:34:57,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 10:34:57,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:34:57,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 10:34:57,622 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:57,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 10:34:57,799 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:34:57,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:34:57 BoogieIcfgContainer [2024-10-24 10:34:57,818 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:34:57,818 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:34:57,818 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:34:57,819 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:34:57,819 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:34:46" (3/4) ... [2024-10-24 10:34:57,821 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 10:34:57,825 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 10:34:57,829 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-24 10:34:57,829 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-24 10:34:57,830 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 10:34:57,830 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 10:34:57,935 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 10:34:57,936 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 10:34:57,936 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:34:57,936 INFO L158 Benchmark]: Toolchain (without parser) took 11908.32ms. Allocated memory was 153.1MB in the beginning and 339.7MB in the end (delta: 186.6MB). Free memory was 88.9MB in the beginning and 273.2MB in the end (delta: -184.2MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2024-10-24 10:34:57,937 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:34:57,937 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.49ms. Allocated memory is still 153.1MB. Free memory was 88.4MB in the beginning and 122.9MB in the end (delta: -34.5MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-10-24 10:34:57,937 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.54ms. Allocated memory is still 153.1MB. Free memory was 122.3MB in the beginning and 119.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:34:57,937 INFO L158 Benchmark]: Boogie Preprocessor took 60.28ms. Allocated memory is still 153.1MB. Free memory was 119.9MB in the beginning and 115.9MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 10:34:57,937 INFO L158 Benchmark]: RCFGBuilder took 459.42ms. Allocated memory is still 153.1MB. Free memory was 115.9MB in the beginning and 97.7MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 10:34:57,938 INFO L158 Benchmark]: TraceAbstraction took 10824.48ms. Allocated memory was 153.1MB in the beginning and 339.7MB in the end (delta: 186.6MB). Free memory was 97.2MB in the beginning and 279.4MB in the end (delta: -182.3MB). Peak memory consumption was 181.2MB. Max. memory is 16.1GB. [2024-10-24 10:34:57,938 INFO L158 Benchmark]: Witness Printer took 117.49ms. Allocated memory is still 339.7MB. Free memory was 279.4MB in the beginning and 273.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 10:34:57,941 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.17ms. Allocated memory is still 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.49ms. Allocated memory is still 153.1MB. Free memory was 88.4MB in the beginning and 122.9MB in the end (delta: -34.5MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.54ms. Allocated memory is still 153.1MB. Free memory was 122.3MB in the beginning and 119.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.28ms. Allocated memory is still 153.1MB. Free memory was 119.9MB in the beginning and 115.9MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 459.42ms. Allocated memory is still 153.1MB. Free memory was 115.9MB in the beginning and 97.7MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10824.48ms. Allocated memory was 153.1MB in the beginning and 339.7MB in the end (delta: 186.6MB). Free memory was 97.2MB in the beginning and 279.4MB in the end (delta: -182.3MB). Peak memory consumption was 181.2MB. Max. memory is 16.1GB. * Witness Printer took 117.49ms. Allocated memory is still 339.7MB. Free memory was 279.4MB in the beginning and 273.2MB 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, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 7, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 227 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 227 mSDsluCounter, 1505 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1119 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 705 IncrementalHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 386 mSDtfsCounter, 705 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 334 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=4, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 103 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 838 NumberOfCodeBlocks, 838 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 831 ConstructedInterpolants, 0 QuantifiedInterpolants, 4190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 5237/5237 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: 94]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_16 == \old(var_1_16))) && (last_1_var_1_6 == \old(last_1_var_1_6))) && (last_1_var_1_10 == \old(last_1_var_1_10))) RESULT: Ultimate proved your program to be correct! [2024-10-24 10:34:57,973 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