./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-26.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 0cc8a0783ec7e65aec5bb1b8ce7f7837d17a7d27f4f67ff4962ce15c1b498ac3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:55:56,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:55:56,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:55:56,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:55:56,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:55:56,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:55:56,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:55:56,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:55:56,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:55:56,391 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:55:56,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:55:56,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:55:56,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:55:56,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:55:56,394 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:55:56,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:55:56,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:55:56,395 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:55:56,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:55:56,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:55:56,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:55:56,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:55:56,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:55:56,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:55:56,403 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:55:56,403 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:55:56,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:55:56,404 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:55:56,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:55:56,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:55:56,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:55:56,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:55:56,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:55:56,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:55:56,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:55:56,407 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:55:56,407 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:55:56,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:55:56,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:55:56,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:55:56,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:55:56,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:55:56,408 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 -> 0cc8a0783ec7e65aec5bb1b8ce7f7837d17a7d27f4f67ff4962ce15c1b498ac3 [2024-10-13 03:55:56,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:55:56,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:55:56,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:55:56,669 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:55:56,669 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:55:56,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-26.i [2024-10-13 03:55:58,222 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:55:58,418 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:55:58,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-26.i [2024-10-13 03:55:58,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c70786f5/2ba71674d200468589a89aa0bf5bd7de/FLAG72423846d [2024-10-13 03:55:58,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c70786f5/2ba71674d200468589a89aa0bf5bd7de [2024-10-13 03:55:58,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:55:58,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:55:58,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:55:58,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:55:58,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:55:58,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:55:58" (1/1) ... [2024-10-13 03:55:58,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40dac530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:58, skipping insertion in model container [2024-10-13 03:55:58,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:55:58" (1/1) ... [2024-10-13 03:55:58,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:55:58,987 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-26.i[916,929] [2024-10-13 03:55:59,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:55:59,094 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:55:59,128 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-26.i[916,929] [2024-10-13 03:55:59,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:55:59,220 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:55:59,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:59 WrapperNode [2024-10-13 03:55:59,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:55:59,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:55:59,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:55:59,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:55:59,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:59" (1/1) ... [2024-10-13 03:55:59,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:59" (1/1) ... [2024-10-13 03:55:59,321 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 236 [2024-10-13 03:55:59,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:55:59,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:55:59,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:55:59,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:55:59,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:59" (1/1) ... [2024-10-13 03:55:59,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:59" (1/1) ... [2024-10-13 03:55:59,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:59" (1/1) ... [2024-10-13 03:55:59,385 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-13 03:55:59,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:59" (1/1) ... [2024-10-13 03:55:59,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:59" (1/1) ... [2024-10-13 03:55:59,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:59" (1/1) ... [2024-10-13 03:55:59,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:59" (1/1) ... [2024-10-13 03:55:59,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:59" (1/1) ... [2024-10-13 03:55:59,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:59" (1/1) ... [2024-10-13 03:55:59,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:55:59,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:55:59,438 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:55:59,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:55:59,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:59" (1/1) ... [2024-10-13 03:55:59,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:55:59,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:55:59,476 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-13 03:55:59,479 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-13 03:55:59,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:55:59,516 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:55:59,517 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:55:59,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:55:59,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:55:59,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:55:59,597 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:55:59,599 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:55:59,952 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-13 03:55:59,952 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:55:59,978 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:55:59,979 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:55:59,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:55:59 BoogieIcfgContainer [2024-10-13 03:55:59,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:55:59,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:55:59,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:55:59,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:55:59,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:55:58" (1/3) ... [2024-10-13 03:55:59,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:55:59, skipping insertion in model container [2024-10-13 03:55:59,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:59" (2/3) ... [2024-10-13 03:55:59,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:55:59, skipping insertion in model container [2024-10-13 03:55:59,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:55:59" (3/3) ... [2024-10-13 03:55:59,986 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-26.i [2024-10-13 03:56:00,001 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:56:00,002 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:56:00,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:56:00,080 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;@f800390, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:56:00,080 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:56:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 64 states have internal predecessors, (93), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 03:56:00,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-13 03:56:00,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:00,097 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:56:00,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:00,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:00,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1885740933, now seen corresponding path program 1 times [2024-10-13 03:56:00,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:56:00,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377470509] [2024-10-13 03:56:00,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:00,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:56:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:56:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:56:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:56:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:56:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:56:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:56:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:56:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:56:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:56:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:56:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:56:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:56:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:56:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:56:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:56:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:56:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:56:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:56:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:56:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:56:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:56:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 03:56:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:56:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:56:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:56:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 03:56:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 03:56:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 03:56:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 03:56:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:56:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:00,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 03:56:00,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:56:00,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377470509] [2024-10-13 03:56:00,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377470509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:56:00,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:56:00,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:56:00,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235591544] [2024-10-13 03:56:00,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:56:00,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:56:00,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:56:00,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:56:00,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:56:00,702 INFO L87 Difference]: Start difference. First operand has 96 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 64 states have internal predecessors, (93), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-13 03:56:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:56:00,752 INFO L93 Difference]: Finished difference Result 189 states and 334 transitions. [2024-10-13 03:56:00,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:56:00,757 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 193 [2024-10-13 03:56:00,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:56:00,767 INFO L225 Difference]: With dead ends: 189 [2024-10-13 03:56:00,767 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 03:56:00,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:56:00,780 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:56:00,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:56:00,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 03:56:00,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-13 03:56:00,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 62 states have internal predecessors, (88), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 03:56:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 148 transitions. [2024-10-13 03:56:00,831 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 148 transitions. Word has length 193 [2024-10-13 03:56:00,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:56:00,831 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 148 transitions. [2024-10-13 03:56:00,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-13 03:56:00,831 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 148 transitions. [2024-10-13 03:56:00,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-13 03:56:00,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:00,835 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:56:00,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:56:00,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:00,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:00,836 INFO L85 PathProgramCache]: Analyzing trace with hash 928168457, now seen corresponding path program 1 times [2024-10-13 03:56:00,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:56:00,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643483058] [2024-10-13 03:56:00,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:00,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:56:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:56:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:56:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:56:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:56:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:56:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:56:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:56:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:56:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:56:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:56:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:56:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:56:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:56:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:56:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:56:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:56:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:56:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:56:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:56:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:56:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:56:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 03:56:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:56:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:56:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:56:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 03:56:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 03:56:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 03:56:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 03:56:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:56:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 03:56:01,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:56:01,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643483058] [2024-10-13 03:56:01,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643483058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:56:01,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:56:01,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:56:01,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211268072] [2024-10-13 03:56:01,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:56:01,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:56:01,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:56:01,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:56:01,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:56:01,444 INFO L87 Difference]: Start difference. First operand 94 states and 148 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 03:56:01,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:56:01,532 INFO L93 Difference]: Finished difference Result 280 states and 442 transitions. [2024-10-13 03:56:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:56:01,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 193 [2024-10-13 03:56:01,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:56:01,536 INFO L225 Difference]: With dead ends: 280 [2024-10-13 03:56:01,536 INFO L226 Difference]: Without dead ends: 187 [2024-10-13 03:56:01,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:56:01,542 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 144 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:56:01,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 384 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:56:01,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-13 03:56:01,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 95. [2024-10-13 03:56:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 63 states have internal predecessors, (89), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 03:56:01,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2024-10-13 03:56:01,576 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 149 transitions. Word has length 193 [2024-10-13 03:56:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:56:01,580 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 149 transitions. [2024-10-13 03:56:01,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 03:56:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 149 transitions. [2024-10-13 03:56:01,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-13 03:56:01,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:01,586 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:56:01,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:56:01,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:01,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:01,587 INFO L85 PathProgramCache]: Analyzing trace with hash -351695221, now seen corresponding path program 1 times [2024-10-13 03:56:01,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:56:01,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125195878] [2024-10-13 03:56:01,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:01,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:56:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:56:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:56:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:56:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:56:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:56:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:56:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:56:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:56:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:56:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:56:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:56:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:56:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:56:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:56:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:56:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:56:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:56:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:56:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:56:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:56:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:56:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 03:56:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:56:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:56:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:56:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 03:56:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 03:56:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 03:56:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 03:56:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:56:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 03:56:02,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:56:02,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125195878] [2024-10-13 03:56:02,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125195878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:56:02,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:56:02,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:56:02,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956372347] [2024-10-13 03:56:02,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:56:02,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:56:02,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:56:02,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:56:02,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:56:02,153 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 03:56:02,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:56:02,469 INFO L93 Difference]: Finished difference Result 307 states and 479 transitions. [2024-10-13 03:56:02,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:56:02,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 193 [2024-10-13 03:56:02,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:56:02,475 INFO L225 Difference]: With dead ends: 307 [2024-10-13 03:56:02,475 INFO L226 Difference]: Without dead ends: 213 [2024-10-13 03:56:02,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:56:02,484 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 152 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:56:02,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 571 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:56:02,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-13 03:56:02,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 187. [2024-10-13 03:56:02,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 124 states have (on average 1.4112903225806452) internal successors, (175), 124 states have internal predecessors, (175), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 03:56:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 295 transitions. [2024-10-13 03:56:02,519 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 295 transitions. Word has length 193 [2024-10-13 03:56:02,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:56:02,521 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 295 transitions. [2024-10-13 03:56:02,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 03:56:02,521 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 295 transitions. [2024-10-13 03:56:02,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-13 03:56:02,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:02,528 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:56:02,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:56:02,528 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:02,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:02,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2137833741, now seen corresponding path program 1 times [2024-10-13 03:56:02,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:56:02,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223803688] [2024-10-13 03:56:02,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:02,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:56:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:56:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:56:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:56:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:56:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:56:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:56:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:56:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:56:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:56:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:56:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:56:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:56:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:56:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:56:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:56:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:56:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:56:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:56:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:56:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:56:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:56:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 03:56:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:56:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:56:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:56:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 03:56:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 03:56:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 03:56:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 03:56:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:56:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 03:56:03,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:56:03,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223803688] [2024-10-13 03:56:03,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223803688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:56:03,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:56:03,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:56:03,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074254564] [2024-10-13 03:56:03,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:56:03,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:56:03,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:56:03,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:56:03,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:56:03,318 INFO L87 Difference]: Start difference. First operand 187 states and 295 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 03:56:03,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:56:03,481 INFO L93 Difference]: Finished difference Result 564 states and 876 transitions. [2024-10-13 03:56:03,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:56:03,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 193 [2024-10-13 03:56:03,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:56:03,485 INFO L225 Difference]: With dead ends: 564 [2024-10-13 03:56:03,485 INFO L226 Difference]: Without dead ends: 378 [2024-10-13 03:56:03,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:56:03,487 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 126 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:56:03,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 500 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:56:03,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-13 03:56:03,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 311. [2024-10-13 03:56:03,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 234 states have (on average 1.4658119658119657) internal successors, (343), 236 states have internal predecessors, (343), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 03:56:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 487 transitions. [2024-10-13 03:56:03,529 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 487 transitions. Word has length 193 [2024-10-13 03:56:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:56:03,530 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 487 transitions. [2024-10-13 03:56:03,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 03:56:03,531 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 487 transitions. [2024-10-13 03:56:03,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-13 03:56:03,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:03,533 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:56:03,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:56:03,534 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:03,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:03,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1257511258, now seen corresponding path program 1 times [2024-10-13 03:56:03,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:56:03,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6175560] [2024-10-13 03:56:03,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:03,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:56:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:56:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:56:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:56:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:56:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:56:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:56:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:56:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:56:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:56:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:56:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:56:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:56:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:56:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:56:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:56:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:56:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:56:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:56:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:56:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:56:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:56:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 03:56:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:56:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:56:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:56:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 03:56:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 03:56:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 03:56:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 03:56:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:56:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 03:56:03,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:56:03,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6175560] [2024-10-13 03:56:03,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6175560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:56:03,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:56:03,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 03:56:03,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027043331] [2024-10-13 03:56:03,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:56:03,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 03:56:03,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:56:03,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 03:56:03,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:56:03,954 INFO L87 Difference]: Start difference. First operand 311 states and 487 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-13 03:56:04,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:56:04,235 INFO L93 Difference]: Finished difference Result 787 states and 1233 transitions. [2024-10-13 03:56:04,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:56:04,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 194 [2024-10-13 03:56:04,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:56:04,240 INFO L225 Difference]: With dead ends: 787 [2024-10-13 03:56:04,240 INFO L226 Difference]: Without dead ends: 477 [2024-10-13 03:56:04,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:56:04,241 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 250 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:56:04,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 445 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:56:04,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-13 03:56:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 475. [2024-10-13 03:56:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 360 states have (on average 1.4583333333333333) internal successors, (525), 363 states have internal predecessors, (525), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-13 03:56:04,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 741 transitions. [2024-10-13 03:56:04,278 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 741 transitions. Word has length 194 [2024-10-13 03:56:04,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:56:04,278 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 741 transitions. [2024-10-13 03:56:04,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-13 03:56:04,279 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 741 transitions. [2024-10-13 03:56:04,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-13 03:56:04,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:04,280 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:56:04,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:56:04,280 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:04,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:04,281 INFO L85 PathProgramCache]: Analyzing trace with hash -431432484, now seen corresponding path program 1 times [2024-10-13 03:56:04,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:56:04,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294805206] [2024-10-13 03:56:04,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:04,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:56:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:56:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:56:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:56:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:56:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:56:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:56:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:56:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:56:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:56:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:56:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:56:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:56:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:56:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:56:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:56:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:56:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:56:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:56:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:56:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:56:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:56:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 03:56:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:56:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:56:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:56:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 03:56:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 03:56:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 03:56:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 03:56:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:56:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 03:56:04,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:56:04,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294805206] [2024-10-13 03:56:04,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294805206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:56:04,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:56:04,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:56:04,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411253909] [2024-10-13 03:56:04,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:56:04,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:56:04,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:56:04,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:56:04,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:56:04,781 INFO L87 Difference]: Start difference. First operand 475 states and 741 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 03:56:06,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:56:06,937 INFO L93 Difference]: Finished difference Result 3008 states and 4647 transitions. [2024-10-13 03:56:06,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 03:56:06,937 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2024-10-13 03:56:06,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:56:06,950 INFO L225 Difference]: With dead ends: 3008 [2024-10-13 03:56:06,951 INFO L226 Difference]: Without dead ends: 2534 [2024-10-13 03:56:06,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2024-10-13 03:56:06,954 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 883 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 648 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 648 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 03:56:06,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 1415 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [648 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 03:56:06,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2024-10-13 03:56:07,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2072. [2024-10-13 03:56:07,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2072 states, 1548 states have (on average 1.4328165374677002) internal successors, (2218), 1568 states have internal predecessors, (2218), 492 states have call successors, (492), 31 states have call predecessors, (492), 31 states have return successors, (492), 472 states have call predecessors, (492), 492 states have call successors, (492) [2024-10-13 03:56:07,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 3202 transitions. [2024-10-13 03:56:07,160 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 3202 transitions. Word has length 194 [2024-10-13 03:56:07,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:56:07,160 INFO L471 AbstractCegarLoop]: Abstraction has 2072 states and 3202 transitions. [2024-10-13 03:56:07,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 03:56:07,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3202 transitions. [2024-10-13 03:56:07,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-13 03:56:07,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:07,163 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:56:07,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:56:07,163 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:07,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:07,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1343574878, now seen corresponding path program 1 times [2024-10-13 03:56:07,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:56:07,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532447985] [2024-10-13 03:56:07,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:07,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:56:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:56:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:56:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:56:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:56:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:56:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:56:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:56:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:56:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:56:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:56:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:56:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:56:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:56:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:56:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:56:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:56:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:56:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:56:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:56:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:56:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:56:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 03:56:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:56:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:56:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:56:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 03:56:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 03:56:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 03:56:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 03:56:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:13,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:56:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 03:56:14,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:56:14,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532447985] [2024-10-13 03:56:14,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532447985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:56:14,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:56:14,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 03:56:14,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523076876] [2024-10-13 03:56:14,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:56:14,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 03:56:14,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:56:14,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 03:56:14,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-13 03:56:14,009 INFO L87 Difference]: Start difference. First operand 2072 states and 3202 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-10-13 03:56:15,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:56:15,628 INFO L93 Difference]: Finished difference Result 5103 states and 7843 transitions. [2024-10-13 03:56:15,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 03:56:15,628 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 194 [2024-10-13 03:56:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:56:15,645 INFO L225 Difference]: With dead ends: 5103 [2024-10-13 03:56:15,645 INFO L226 Difference]: Without dead ends: 3032 [2024-10-13 03:56:15,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-10-13 03:56:15,654 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 451 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:56:15,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 944 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 03:56:15,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2024-10-13 03:56:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 2312. [2024-10-13 03:56:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2312 states, 1788 states have (on average 1.4429530201342282) internal successors, (2580), 1808 states have internal predecessors, (2580), 492 states have call successors, (492), 31 states have call predecessors, (492), 31 states have return successors, (492), 472 states have call predecessors, (492), 492 states have call successors, (492) [2024-10-13 03:56:15,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3564 transitions. [2024-10-13 03:56:15,833 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3564 transitions. Word has length 194 [2024-10-13 03:56:15,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:56:15,835 INFO L471 AbstractCegarLoop]: Abstraction has 2312 states and 3564 transitions. [2024-10-13 03:56:15,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-10-13 03:56:15,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3564 transitions. [2024-10-13 03:56:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-13 03:56:15,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:15,838 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:56:15,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 03:56:15,839 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:15,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:15,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1601740316, now seen corresponding path program 1 times [2024-10-13 03:56:15,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:56:15,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262809362] [2024-10-13 03:56:15,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:15,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:56:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat