./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-32.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 e3899bbf26c9ae805c010051d9160ff07bcd5d68dc29e4a0284125764e39562e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:57:54,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:57:54,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:57:54,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:57:54,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:57:54,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:57:54,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:57:54,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:57:54,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:57:54,332 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:57:54,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:57:54,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:57:54,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:57:54,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:57:54,334 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:57:54,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:57:54,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:57:54,335 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:57:54,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:57:54,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:57:54,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:57:54,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:57:54,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:57:54,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:57:54,341 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:57:54,341 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:57:54,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:57:54,342 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:57:54,342 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:57:54,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:57:54,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:57:54,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:57:54,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:57:54,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:57:54,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:57:54,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:57:54,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:57:54,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:57:54,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:57:54,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:57:54,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:57:54,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:57:54,346 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 -> e3899bbf26c9ae805c010051d9160ff07bcd5d68dc29e4a0284125764e39562e [2024-11-12 06:57:54,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:57:54,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:57:54,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:57:54,676 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:57:54,679 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:57:54,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-32.i [2024-11-12 06:57:56,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:57:56,340 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:57:56,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-32.i [2024-11-12 06:57:56,352 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d64f8177/0cd1a4c68ad34420a62f9f35316d6ec3/FLAGfc6b4790e [2024-11-12 06:57:56,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d64f8177/0cd1a4c68ad34420a62f9f35316d6ec3 [2024-11-12 06:57:56,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:57:56,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:57:56,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:57:56,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:57:56,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:57:56,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:57:56" (1/1) ... [2024-11-12 06:57:56,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17d15949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:56, skipping insertion in model container [2024-11-12 06:57:56,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:57:56" (1/1) ... [2024-11-12 06:57:56,406 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:57:56,591 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-32.i[913,926] [2024-11-12 06:57:56,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:57:56,670 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:57:56,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-32.i[913,926] [2024-11-12 06:57:56,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:57:56,723 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:57:56,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:56 WrapperNode [2024-11-12 06:57:56,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:57:56,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:57:56,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:57:56,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:57:56,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:56" (1/1) ... [2024-11-12 06:57:56,741 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:56" (1/1) ... [2024-11-12 06:57:56,774 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-11-12 06:57:56,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:57:56,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:57:56,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:57:56,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:57:56,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:56" (1/1) ... [2024-11-12 06:57:56,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:56" (1/1) ... [2024-11-12 06:57:56,791 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:56" (1/1) ... [2024-11-12 06:57:56,811 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:57:56,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:56" (1/1) ... [2024-11-12 06:57:56,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:56" (1/1) ... [2024-11-12 06:57:56,818 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:56" (1/1) ... [2024-11-12 06:57:56,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:56" (1/1) ... [2024-11-12 06:57:56,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:56" (1/1) ... [2024-11-12 06:57:56,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:56" (1/1) ... [2024-11-12 06:57:56,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:57:56,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:57:56,830 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:57:56,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:57:56,833 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:56" (1/1) ... [2024-11-12 06:57:56,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:57:56,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:57:56,877 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:57:56,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:57:56,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:57:56,931 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:57:56,931 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:57:56,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:57:56,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:57:56,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:57:57,030 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:57:57,032 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:57:57,351 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 06:57:57,352 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:57:57,368 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:57:57,369 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:57:57,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:57:57 BoogieIcfgContainer [2024-11-12 06:57:57,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:57:57,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:57:57,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:57:57,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:57:57,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:57:56" (1/3) ... [2024-11-12 06:57:57,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c49214b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:57:57, skipping insertion in model container [2024-11-12 06:57:57,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:56" (2/3) ... [2024-11-12 06:57:57,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c49214b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:57:57, skipping insertion in model container [2024-11-12 06:57:57,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:57:57" (3/3) ... [2024-11-12 06:57:57,376 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-32.i [2024-11-12 06:57:57,390 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:57:57,391 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:57:57,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:57:57,459 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;@342167c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:57:57,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:57:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 06:57:57,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-12 06:57:57,475 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:57:57,476 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:57:57,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:57:57,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:57:57,483 INFO L85 PathProgramCache]: Analyzing trace with hash 385929245, now seen corresponding path program 1 times [2024-11-12 06:57:57,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:57:57,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275567174] [2024-11-12 06:57:57,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:57:57,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:57:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:58,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:57:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:58,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:57:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:58,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:57:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:58,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:57:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:58,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:57:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:58,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:57:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:58,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:57:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:58,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:57:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:58,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:57:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:58,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:57:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:58,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:57:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:58,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:57:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:58,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:57:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:58,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:57:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:58,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:57:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:58,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:57:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:58,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:57:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:58,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:57:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 06:57:58,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:57:58,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275567174] [2024-11-12 06:57:58,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275567174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:57:58,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:57:58,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 06:57:58,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671438137] [2024-11-12 06:57:58,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:57:58,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:57:58,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:57:58,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:57:58,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:57:58,299 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:57:58,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:57:58,502 INFO L93 Difference]: Finished difference Result 162 states and 287 transitions. [2024-11-12 06:57:58,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:57:58,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2024-11-12 06:57:58,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:57:58,517 INFO L225 Difference]: With dead ends: 162 [2024-11-12 06:57:58,517 INFO L226 Difference]: Without dead ends: 110 [2024-11-12 06:57:58,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:57:58,527 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 72 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:57:58,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 206 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:57:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-12 06:57:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 97. [2024-11-12 06:57:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 58 states have internal predecessors, (73), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 06:57:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 145 transitions. [2024-11-12 06:57:58,606 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 145 transitions. Word has length 113 [2024-11-12 06:57:58,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:57:58,607 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 145 transitions. [2024-11-12 06:57:58,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:57:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 145 transitions. [2024-11-12 06:57:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-12 06:57:58,613 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:57:58,613 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:57:58,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:57:58,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:57:58,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:57:58,615 INFO L85 PathProgramCache]: Analyzing trace with hash -294129125, now seen corresponding path program 1 times [2024-11-12 06:57:58,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:57:58,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461694029] [2024-11-12 06:57:58,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:57:58,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:57:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:02,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:58:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:02,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:58:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:02,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:58:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:02,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:58:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:02,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:58:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:02,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:58:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:02,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:58:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:02,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:58:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:02,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:58:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:02,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:58:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:02,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:58:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:03,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:58:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:03,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:58:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:03,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:58:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:03,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:58:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:03,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:58:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:03,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:58:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:03,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:58:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:03,103 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 06:58:03,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:58:03,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461694029] [2024-11-12 06:58:03,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461694029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:58:03,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:58:03,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 06:58:03,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850318406] [2024-11-12 06:58:03,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:58:03,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 06:58:03,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:58:03,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 06:58:03,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-12 06:58:03,108 INFO L87 Difference]: Start difference. First operand 97 states and 145 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 06:58:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:04,610 INFO L93 Difference]: Finished difference Result 121 states and 171 transitions. [2024-11-12 06:58:04,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 06:58:04,611 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2024-11-12 06:58:04,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:04,615 INFO L225 Difference]: With dead ends: 121 [2024-11-12 06:58:04,615 INFO L226 Difference]: Without dead ends: 119 [2024-11-12 06:58:04,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2024-11-12 06:58:04,617 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 165 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:04,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 380 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 06:58:04,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-12 06:58:04,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2024-11-12 06:58:04,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.253968253968254) internal successors, (79), 63 states have internal predecessors, (79), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 06:58:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2024-11-12 06:58:04,639 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 113 [2024-11-12 06:58:04,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:04,640 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2024-11-12 06:58:04,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 06:58:04,641 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2024-11-12 06:58:04,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 06:58:04,643 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:04,643 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:58:04,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:58:04,644 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:04,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:04,644 INFO L85 PathProgramCache]: Analyzing trace with hash -933556435, now seen corresponding path program 1 times [2024-11-12 06:58:04,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:58:04,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312242561] [2024-11-12 06:58:04,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:04,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:58:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:07,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:58:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:07,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:58:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:07,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:58:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:07,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:58:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:07,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:58:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:07,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:58:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:07,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:58:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:07,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:58:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:07,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:58:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:07,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:58:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:07,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:58:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:07,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:58:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:07,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:58:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:07,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:58:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:07,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:58:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:07,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:58:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:07,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:58:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:07,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:58:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 06:58:07,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:58:07,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312242561] [2024-11-12 06:58:07,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312242561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:58:07,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:58:07,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 06:58:07,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941210042] [2024-11-12 06:58:07,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:58:07,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 06:58:07,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:58:07,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 06:58:07,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-12 06:58:07,526 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:08,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:08,874 INFO L93 Difference]: Finished difference Result 151 states and 208 transitions. [2024-11-12 06:58:08,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 06:58:08,875 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-11-12 06:58:08,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:08,877 INFO L225 Difference]: With dead ends: 151 [2024-11-12 06:58:08,877 INFO L226 Difference]: Without dead ends: 149 [2024-11-12 06:58:08,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2024-11-12 06:58:08,880 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 113 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:08,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 399 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 06:58:08,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-12 06:58:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 109. [2024-11-12 06:58:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 70 states have internal predecessors, (89), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 06:58:08,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions. [2024-11-12 06:58:08,896 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 114 [2024-11-12 06:58:08,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:08,896 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 161 transitions. [2024-11-12 06:58:08,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions. [2024-11-12 06:58:08,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 06:58:08,899 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:08,899 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:58:08,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:58:08,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:08,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:08,900 INFO L85 PathProgramCache]: Analyzing trace with hash 36486516, now seen corresponding path program 1 times [2024-11-12 06:58:08,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:58:08,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996715612] [2024-11-12 06:58:08,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:08,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:58:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:58:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:58:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:58:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:58:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:58:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:58:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:58:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:58:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:58:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:58:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:58:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:58:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:58:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:58:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:58:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:58:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:58:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:58:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 06:58:10,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:58:10,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996715612] [2024-11-12 06:58:10,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996715612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:58:10,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:58:10,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 06:58:10,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831618448] [2024-11-12 06:58:10,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:58:10,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 06:58:10,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:58:10,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 06:58:10,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 06:58:10,509 INFO L87 Difference]: Start difference. First operand 109 states and 161 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:11,255 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2024-11-12 06:58:11,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 06:58:11,256 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-11-12 06:58:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:11,258 INFO L225 Difference]: With dead ends: 139 [2024-11-12 06:58:11,258 INFO L226 Difference]: Without dead ends: 137 [2024-11-12 06:58:11,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-12 06:58:11,260 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 126 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:11,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 385 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 06:58:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-12 06:58:11,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 109. [2024-11-12 06:58:11,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 70 states have internal predecessors, (89), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 06:58:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions. [2024-11-12 06:58:11,290 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 114 [2024-11-12 06:58:11,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:11,290 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 161 transitions. [2024-11-12 06:58:11,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:11,291 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions. [2024-11-12 06:58:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 06:58:11,296 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:11,296 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:58:11,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 06:58:11,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:11,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:11,302 INFO L85 PathProgramCache]: Analyzing trace with hash 886190736, now seen corresponding path program 1 times [2024-11-12 06:58:11,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:58:11,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399262599] [2024-11-12 06:58:11,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:11,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:58:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:13,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:58:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:13,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:58:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:13,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:58:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:13,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:58:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:13,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:58:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:13,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:58:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:13,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:58:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:13,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:58:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:13,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:58:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:13,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:58:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:13,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:58:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:13,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:58:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:13,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:58:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:13,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:58:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:13,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:58:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:13,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:58:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:13,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:58:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:13,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:58:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 06:58:13,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:58:13,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399262599] [2024-11-12 06:58:13,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399262599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:58:13,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:58:13,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 06:58:13,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678708789] [2024-11-12 06:58:13,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:58:13,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 06:58:13,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:58:13,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 06:58:13,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-12 06:58:13,825 INFO L87 Difference]: Start difference. First operand 109 states and 161 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:15,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:15,196 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2024-11-12 06:58:15,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 06:58:15,197 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-12 06:58:15,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:15,199 INFO L225 Difference]: With dead ends: 144 [2024-11-12 06:58:15,199 INFO L226 Difference]: Without dead ends: 142 [2024-11-12 06:58:15,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2024-11-12 06:58:15,200 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 113 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:15,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 392 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 06:58:15,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-12 06:58:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 111. [2024-11-12 06:58:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 06:58:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 165 transitions. [2024-11-12 06:58:15,215 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 165 transitions. Word has length 115 [2024-11-12 06:58:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:15,216 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 165 transitions. [2024-11-12 06:58:15,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 165 transitions. [2024-11-12 06:58:15,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 06:58:15,217 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:15,218 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:58:15,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 06:58:15,218 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:15,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:15,219 INFO L85 PathProgramCache]: Analyzing trace with hash -2084428143, now seen corresponding path program 1 times [2024-11-12 06:58:15,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:58:15,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505811740] [2024-11-12 06:58:15,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:15,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:58:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:16,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:58:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:16,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:58:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:16,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:58:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:16,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:58:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:16,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:58:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:16,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:58:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:16,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:58:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:16,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:58:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:16,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:58:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:16,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:58:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:16,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:58:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:16,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:58:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:16,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:58:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:16,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:58:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:16,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:58:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:16,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:58:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:16,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:58:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:16,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:58:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 06:58:16,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:58:16,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505811740] [2024-11-12 06:58:16,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505811740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:58:16,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:58:16,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 06:58:16,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037043413] [2024-11-12 06:58:16,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:58:16,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 06:58:16,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:58:16,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 06:58:16,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-12 06:58:16,330 INFO L87 Difference]: Start difference. First operand 111 states and 165 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:17,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:17,175 INFO L93 Difference]: Finished difference Result 298 states and 422 transitions. [2024-11-12 06:58:17,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 06:58:17,176 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-12 06:58:17,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:17,179 INFO L225 Difference]: With dead ends: 298 [2024-11-12 06:58:17,181 INFO L226 Difference]: Without dead ends: 190 [2024-11-12 06:58:17,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2024-11-12 06:58:17,183 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 197 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:17,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 511 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 06:58:17,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-12 06:58:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 121. [2024-11-12 06:58:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 06:58:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 180 transitions. [2024-11-12 06:58:17,205 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 180 transitions. Word has length 115 [2024-11-12 06:58:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:17,210 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 180 transitions. [2024-11-12 06:58:17,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 180 transitions. [2024-11-12 06:58:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 06:58:17,211 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:17,211 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:58:17,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 06:58:17,212 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:17,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:17,212 INFO L85 PathProgramCache]: Analyzing trace with hash -309420781, now seen corresponding path program 1 times [2024-11-12 06:58:17,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:58:17,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044187708] [2024-11-12 06:58:17,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:17,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:58:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:58:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:58:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:58:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:58:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:58:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:58:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:58:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:58:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:58:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:58:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:58:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:58:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:58:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:58:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:58:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:58:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:58:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:58:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 06:58:19,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:58:19,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044187708] [2024-11-12 06:58:19,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044187708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:58:19,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:58:19,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 06:58:19,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668222661] [2024-11-12 06:58:19,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:58:19,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 06:58:19,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:58:19,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 06:58:19,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-12 06:58:19,342 INFO L87 Difference]: Start difference. First operand 121 states and 180 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:20,355 INFO L93 Difference]: Finished difference Result 167 states and 227 transitions. [2024-11-12 06:58:20,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 06:58:20,355 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-12 06:58:20,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:20,357 INFO L225 Difference]: With dead ends: 167 [2024-11-12 06:58:20,357 INFO L226 Difference]: Without dead ends: 165 [2024-11-12 06:58:20,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-11-12 06:58:20,358 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 97 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:20,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 375 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 06:58:20,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-12 06:58:20,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 121. [2024-11-12 06:58:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 06:58:20,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 180 transitions. [2024-11-12 06:58:20,370 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 180 transitions. Word has length 115 [2024-11-12 06:58:20,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:20,371 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 180 transitions. [2024-11-12 06:58:20,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:20,371 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 180 transitions. [2024-11-12 06:58:20,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 06:58:20,372 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:20,373 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:58:20,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 06:58:20,373 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:20,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:20,373 INFO L85 PathProgramCache]: Analyzing trace with hash -598251145, now seen corresponding path program 1 times [2024-11-12 06:58:20,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:58:20,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661755096] [2024-11-12 06:58:20,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:20,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:58:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:58:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:58:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:58:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:58:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:58:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:58:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:58:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:58:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:58:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:58:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:58:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:58:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:58:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:58:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:58:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:58:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:58:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:58:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,429 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 06:58:21,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:58:21,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661755096] [2024-11-12 06:58:21,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661755096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:58:21,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:58:21,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 06:58:21,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896963573] [2024-11-12 06:58:21,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:58:21,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 06:58:21,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:58:21,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 06:58:21,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-12 06:58:21,432 INFO L87 Difference]: Start difference. First operand 121 states and 180 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:22,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:22,469 INFO L93 Difference]: Finished difference Result 198 states and 263 transitions. [2024-11-12 06:58:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 06:58:22,470 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-12 06:58:22,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:22,472 INFO L225 Difference]: With dead ends: 198 [2024-11-12 06:58:22,472 INFO L226 Difference]: Without dead ends: 196 [2024-11-12 06:58:22,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-11-12 06:58:22,473 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 179 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:22,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 534 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 06:58:22,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-12 06:58:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 122. [2024-11-12 06:58:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 06:58:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 182 transitions. [2024-11-12 06:58:22,485 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 182 transitions. Word has length 116 [2024-11-12 06:58:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:22,485 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 182 transitions. [2024-11-12 06:58:22,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:22,486 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 182 transitions. [2024-11-12 06:58:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 06:58:22,487 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:22,487 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:58:22,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 06:58:22,487 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:22,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:22,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1407597771, now seen corresponding path program 1 times [2024-11-12 06:58:22,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:58:22,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947761621] [2024-11-12 06:58:22,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:22,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:58:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:58:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:58:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:58:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:58:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:58:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:58:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:58:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:58:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:58:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:58:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:58:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:58:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:58:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:58:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:58:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:58:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:58:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:58:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 06:58:23,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:58:23,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947761621] [2024-11-12 06:58:23,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947761621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:58:23,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:58:23,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 06:58:23,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854298485] [2024-11-12 06:58:23,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:58:23,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 06:58:23,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:58:23,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 06:58:23,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-12 06:58:23,919 INFO L87 Difference]: Start difference. First operand 122 states and 182 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:25,137 INFO L93 Difference]: Finished difference Result 193 states and 258 transitions. [2024-11-12 06:58:25,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-12 06:58:25,137 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-12 06:58:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:25,139 INFO L225 Difference]: With dead ends: 193 [2024-11-12 06:58:25,139 INFO L226 Difference]: Without dead ends: 191 [2024-11-12 06:58:25,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=255, Invalid=801, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 06:58:25,140 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 191 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:25,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 502 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 06:58:25,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-12 06:58:25,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 124. [2024-11-12 06:58:25,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 85 states have internal predecessors, (113), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 06:58:25,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 185 transitions. [2024-11-12 06:58:25,151 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 185 transitions. Word has length 116 [2024-11-12 06:58:25,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:25,153 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 185 transitions. [2024-11-12 06:58:25,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:25,153 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 185 transitions. [2024-11-12 06:58:25,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-12 06:58:25,154 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:25,154 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:58:25,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 06:58:25,154 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:25,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:25,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1602400120, now seen corresponding path program 1 times [2024-11-12 06:58:25,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:58:25,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293287557] [2024-11-12 06:58:25,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:25,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:58:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:58:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:58:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:58:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:58:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:58:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:58:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:58:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:58:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:58:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:58:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:58:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:58:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:58:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:58:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:58:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:58:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:58:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:58:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 06:58:26,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:58:26,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293287557] [2024-11-12 06:58:26,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293287557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:58:26,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:58:26,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 06:58:26,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051024630] [2024-11-12 06:58:26,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:58:26,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 06:58:26,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:58:26,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 06:58:26,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-12 06:58:26,844 INFO L87 Difference]: Start difference. First operand 124 states and 185 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:27,787 INFO L93 Difference]: Finished difference Result 167 states and 230 transitions. [2024-11-12 06:58:27,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 06:58:27,788 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2024-11-12 06:58:27,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:27,789 INFO L225 Difference]: With dead ends: 167 [2024-11-12 06:58:27,790 INFO L226 Difference]: Without dead ends: 165 [2024-11-12 06:58:27,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2024-11-12 06:58:27,791 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 101 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:27,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 415 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 06:58:27,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-12 06:58:27,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 125. [2024-11-12 06:58:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 06:58:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 187 transitions. [2024-11-12 06:58:27,803 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 187 transitions. Word has length 117 [2024-11-12 06:58:27,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:27,804 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 187 transitions. [2024-11-12 06:58:27,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 187 transitions. [2024-11-12 06:58:27,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-12 06:58:27,808 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:27,808 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:58:27,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 06:58:27,808 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:27,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:27,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1723789679, now seen corresponding path program 1 times [2024-11-12 06:58:27,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:58:27,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553719691] [2024-11-12 06:58:27,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:27,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:58:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:58:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:58:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:58:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:58:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:58:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:58:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:58:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:58:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:58:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:58:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:58:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:58:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:58:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:58:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:58:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:58:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:58:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:58:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 06:58:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 06:58:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 06:58:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 06:58:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 06:58:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 06:58:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 06:58:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 06:58:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 06:58:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 06:58:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 06:58:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 06:58:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 06:58:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 06:58:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-12 06:58:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-12 06:58:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-12 06:58:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-12 06:58:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2557 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-12 06:58:27,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:58:27,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553719691] [2024-11-12 06:58:27,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553719691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:58:27,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:58:27,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 06:58:27,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446692930] [2024-11-12 06:58:27,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:58:27,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:58:27,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:58:27,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:58:27,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:58:27,982 INFO L87 Difference]: Start difference. First operand 125 states and 187 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-12 06:58:28,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:28,053 INFO L93 Difference]: Finished difference Result 182 states and 271 transitions. [2024-11-12 06:58:28,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:58:28,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 224 [2024-11-12 06:58:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:28,056 INFO L225 Difference]: With dead ends: 182 [2024-11-12 06:58:28,056 INFO L226 Difference]: Without dead ends: 118 [2024-11-12 06:58:28,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:58:28,057 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:28,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 70 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:58:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-12 06:58:28,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-12 06:58:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 06:58:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2024-11-12 06:58:28,074 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 224 [2024-11-12 06:58:28,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:28,076 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2024-11-12 06:58:28,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-12 06:58:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2024-11-12 06:58:28,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-12 06:58:28,080 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:28,080 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:58:28,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 06:58:28,080 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:28,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:28,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1891119247, now seen corresponding path program 1 times [2024-11-12 06:58:28,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:58:28,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605482515] [2024-11-12 06:58:28,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:28,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:58:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:58:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:58:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:58:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:58:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:58:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:58:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:58:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:58:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:58:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:58:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:58:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:58:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:58:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:58:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:58:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:58:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:58:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:58:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 06:58:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 06:58:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 06:58:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 06:58:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 06:58:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 06:58:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 06:58:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 06:58:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 06:58:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 06:58:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 06:58:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 06:58:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 06:58:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 06:58:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-12 06:58:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-12 06:58:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-12 06:58:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-12 06:58:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2557 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 2540 trivial. 0 not checked. [2024-11-12 06:58:30,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:58:30,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605482515] [2024-11-12 06:58:30,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605482515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 06:58:30,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304784254] [2024-11-12 06:58:30,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:30,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:58:30,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:58:30,475 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 06:58:30,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 06:58:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:30,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 06:58:30,606 INFO L279 TraceCheckSpWp]: Computing forward predicates...