./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.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 e08b130d986262ceb0772f034a60f5b23796cc6f800ada70e6af5834a62fdc07 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:27:21,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:27:21,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:27:21,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:27:21,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:27:21,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:27:21,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:27:21,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:27:21,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:27:21,671 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:27:21,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:27:21,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:27:21,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:27:21,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:27:21,676 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:27:21,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:27:21,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:27:21,677 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:27:21,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:27:21,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:27:21,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:27:21,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:27:21,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:27:21,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:27:21,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:27:21,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:27:21,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:27:21,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:27:21,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:27:21,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:27:21,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:27:21,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:27:21,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:27:21,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:27:21,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:27:21,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:27:21,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:27:21,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:27:21,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:27:21,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:27:21,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:27:21,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:27:21,685 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 -> e08b130d986262ceb0772f034a60f5b23796cc6f800ada70e6af5834a62fdc07 [2024-10-14 11:27:21,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:27:21,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:27:21,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:27:21,939 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:27:21,940 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:27:21,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.i [2024-10-14 11:27:23,434 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:27:23,678 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:27:23,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.i [2024-10-14 11:27:23,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21b06c4dc/46eea81f6c1a4cb9b96428008dd54977/FLAG2ae8e8d2d [2024-10-14 11:27:23,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21b06c4dc/46eea81f6c1a4cb9b96428008dd54977 [2024-10-14 11:27:23,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:27:23,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:27:23,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:27:23,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:27:23,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:27:23,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:27:23" (1/1) ... [2024-10-14 11:27:23,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f6d8390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:23, skipping insertion in model container [2024-10-14 11:27:23,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:27:23" (1/1) ... [2024-10-14 11:27:23,769 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:27:23,939 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.i[916,929] [2024-10-14 11:27:24,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:27:24,114 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:27:24,126 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.i[916,929] [2024-10-14 11:27:24,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:27:24,202 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:27:24,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:24 WrapperNode [2024-10-14 11:27:24,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:27:24,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:27:24,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:27:24,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:27:24,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:24" (1/1) ... [2024-10-14 11:27:24,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:24" (1/1) ... [2024-10-14 11:27:24,275 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2024-10-14 11:27:24,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:27:24,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:27:24,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:27:24,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:27:24,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:24" (1/1) ... [2024-10-14 11:27:24,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:24" (1/1) ... [2024-10-14 11:27:24,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:24" (1/1) ... [2024-10-14 11:27:24,327 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:27:24,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:24" (1/1) ... [2024-10-14 11:27:24,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:24" (1/1) ... [2024-10-14 11:27:24,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:24" (1/1) ... [2024-10-14 11:27:24,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:24" (1/1) ... [2024-10-14 11:27:24,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:24" (1/1) ... [2024-10-14 11:27:24,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:24" (1/1) ... [2024-10-14 11:27:24,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:27:24,389 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:27:24,389 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:27:24,389 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:27:24,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:24" (1/1) ... [2024-10-14 11:27:24,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:27:24,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:27:24,424 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:27:24,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:27:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:27:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:27:24,466 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:27:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:27:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:27:24,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:27:24,545 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:27:24,547 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:27:25,094 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-14 11:27:25,094 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:27:25,144 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:27:25,144 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:27:25,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:27:25 BoogieIcfgContainer [2024-10-14 11:27:25,145 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:27:25,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:27:25,169 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:27:25,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:27:25,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:27:23" (1/3) ... [2024-10-14 11:27:25,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d19d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:27:25, skipping insertion in model container [2024-10-14 11:27:25,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:24" (2/3) ... [2024-10-14 11:27:25,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d19d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:27:25, skipping insertion in model container [2024-10-14 11:27:25,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:27:25" (3/3) ... [2024-10-14 11:27:25,177 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-63.i [2024-10-14 11:27:25,196 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:27:25,196 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:27:25,260 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:27:25,270 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;@261a8f3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:27:25,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:27:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 61 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 11:27:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 11:27:25,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:27:25,293 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:27:25,293 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:27:25,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:27:25,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2124453476, now seen corresponding path program 1 times [2024-10-14 11:27:25,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:27:25,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87139892] [2024-10-14 11:27:25,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:27:25,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:27:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:27:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:27:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:27:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:27:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:27:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:27:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:27:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:27:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:27:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:27:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:27:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:27:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:27:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:27:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:27:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:27:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:27:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:27:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:27:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:27:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:25,963 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 11:27:25,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:27:25,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87139892] [2024-10-14 11:27:25,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87139892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:27:25,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:27:25,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:27:25,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135058599] [2024-10-14 11:27:25,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:27:25,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:27:25,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:27:26,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:27:26,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:27:26,008 INFO L87 Difference]: Start difference. First operand has 83 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 61 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:27:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:27:26,088 INFO L93 Difference]: Finished difference Result 162 states and 282 transitions. [2024-10-14 11:27:26,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:27:26,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-14 11:27:26,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:27:26,103 INFO L225 Difference]: With dead ends: 162 [2024-10-14 11:27:26,105 INFO L226 Difference]: Without dead ends: 80 [2024-10-14 11:27:26,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:27:26,114 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:27:26,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:27:26,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-14 11:27:26,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-14 11:27:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 states have internal predecessors, (82), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 11:27:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2024-10-14 11:27:26,158 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 139 [2024-10-14 11:27:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:27:26,160 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2024-10-14 11:27:26,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:27:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2024-10-14 11:27:26,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 11:27:26,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:27:26,165 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:27:26,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:27:26,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:27:26,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:27:26,166 INFO L85 PathProgramCache]: Analyzing trace with hash -19448004, now seen corresponding path program 1 times [2024-10-14 11:27:26,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:27:26,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827044197] [2024-10-14 11:27:26,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:27:26,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:27:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:27:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:27:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:27:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:27:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:27:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:27:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:27:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:27:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:27:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:27:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:27:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:27:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:27:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:27:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:27:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:27:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:27:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:27:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:27:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:27:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:26,519 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 11:27:26,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:27:26,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827044197] [2024-10-14 11:27:26,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827044197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:27:26,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:27:26,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:27:26,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645634055] [2024-10-14 11:27:26,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:27:26,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:27:26,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:27:26,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:27:26,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:27:26,527 INFO L87 Difference]: Start difference. First operand 80 states and 122 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:27:26,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:27:26,629 INFO L93 Difference]: Finished difference Result 208 states and 315 transitions. [2024-10-14 11:27:26,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:27:26,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-14 11:27:26,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:27:26,634 INFO L225 Difference]: With dead ends: 208 [2024-10-14 11:27:26,635 INFO L226 Difference]: Without dead ends: 129 [2024-10-14 11:27:26,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:27:26,639 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 70 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:27:26,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 222 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:27:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-14 11:27:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2024-10-14 11:27:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 96 states have internal predecessors, (134), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 11:27:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 190 transitions. [2024-10-14 11:27:26,672 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 190 transitions. Word has length 139 [2024-10-14 11:27:26,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:27:26,673 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 190 transitions. [2024-10-14 11:27:26,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:27:26,673 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 190 transitions. [2024-10-14 11:27:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 11:27:26,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:27:26,676 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:27:26,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:27:26,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:27:26,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:27:26,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1242102846, now seen corresponding path program 1 times [2024-10-14 11:27:26,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:27:26,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627992010] [2024-10-14 11:27:26,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:27:26,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:27:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:27:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:27:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:27:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:27:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:27:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:27:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:27:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:27:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:27:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:27:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:27:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:27:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:27:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:27:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:27:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:27:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:27:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:27:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:27:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:27:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 11:27:27,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:27:27,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627992010] [2024-10-14 11:27:27,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627992010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:27:27,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:27:27,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:27:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13095067] [2024-10-14 11:27:27,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:27:27,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:27:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:27:27,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:27:27,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:27:27,281 INFO L87 Difference]: Start difference. First operand 126 states and 190 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:27:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:27:27,474 INFO L93 Difference]: Finished difference Result 366 states and 550 transitions. [2024-10-14 11:27:27,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:27:27,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-14 11:27:27,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:27:27,482 INFO L225 Difference]: With dead ends: 366 [2024-10-14 11:27:27,485 INFO L226 Difference]: Without dead ends: 241 [2024-10-14 11:27:27,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:27:27,488 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 88 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:27:27,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 338 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:27:27,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-14 11:27:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 177. [2024-10-14 11:27:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 125 states have internal predecessors, (169), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 11:27:27,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 265 transitions. [2024-10-14 11:27:27,516 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 265 transitions. Word has length 139 [2024-10-14 11:27:27,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:27:27,517 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 265 transitions. [2024-10-14 11:27:27,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:27:27,517 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 265 transitions. [2024-10-14 11:27:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 11:27:27,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:27:27,519 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:27:27,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:27:27,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:27:27,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:27:27,520 INFO L85 PathProgramCache]: Analyzing trace with hash -563335488, now seen corresponding path program 1 times [2024-10-14 11:27:27,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:27:27,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949206958] [2024-10-14 11:27:27,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:27:27,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:27:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:27:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:27:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:27:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:27:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:27:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:27:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:27:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:27:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:27:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:27:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:27:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:27:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:27:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:27:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:27:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:27:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:27:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:27:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:27:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:27:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 11:27:41,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:27:41,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949206958] [2024-10-14 11:27:41,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949206958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:27:41,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:27:41,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 11:27:41,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290427419] [2024-10-14 11:27:41,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:27:41,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 11:27:41,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:27:41,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 11:27:41,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-10-14 11:27:41,138 INFO L87 Difference]: Start difference. First operand 177 states and 265 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:27:43,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:27:43,848 INFO L93 Difference]: Finished difference Result 565 states and 828 transitions. [2024-10-14 11:27:43,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 11:27:43,849 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-14 11:27:43,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:27:43,852 INFO L225 Difference]: With dead ends: 565 [2024-10-14 11:27:43,852 INFO L226 Difference]: Without dead ends: 440 [2024-10-14 11:27:43,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2024-10-14 11:27:43,855 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 1149 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 11:27:43,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 567 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 11:27:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-14 11:27:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 197. [2024-10-14 11:27:43,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 144 states have (on average 1.3819444444444444) internal successors, (199), 145 states have internal predecessors, (199), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 11:27:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 295 transitions. [2024-10-14 11:27:43,885 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 295 transitions. Word has length 139 [2024-10-14 11:27:43,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:27:43,886 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 295 transitions. [2024-10-14 11:27:43,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:27:43,886 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 295 transitions. [2024-10-14 11:27:43,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 11:27:43,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:27:43,888 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:27:43,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:27:43,889 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:27:43,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:27:43,889 INFO L85 PathProgramCache]: Analyzing trace with hash -135942596, now seen corresponding path program 1 times [2024-10-14 11:27:43,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:27:43,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473008604] [2024-10-14 11:27:43,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:27:43,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:27:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:27:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:27:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:27:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:27:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:27:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:27:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:27:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:27:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:27:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:27:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:27:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:27:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:27:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:27:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:27:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:27:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:27:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:27:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:27:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:27:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 11:27:44,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:27:44,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473008604] [2024-10-14 11:27:44,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473008604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:27:44,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:27:44,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:27:44,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170230158] [2024-10-14 11:27:44,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:27:44,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:27:44,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:27:44,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:27:44,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:27:44,177 INFO L87 Difference]: Start difference. First operand 197 states and 295 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:27:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:27:44,315 INFO L93 Difference]: Finished difference Result 397 states and 592 transitions. [2024-10-14 11:27:44,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:27:44,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-14 11:27:44,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:27:44,318 INFO L225 Difference]: With dead ends: 397 [2024-10-14 11:27:44,318 INFO L226 Difference]: Without dead ends: 252 [2024-10-14 11:27:44,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:27:44,320 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 187 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:27:44,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 258 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:27:44,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-14 11:27:44,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 205. [2024-10-14 11:27:44,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 152 states have (on average 1.388157894736842) internal successors, (211), 153 states have internal predecessors, (211), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 11:27:44,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 307 transitions. [2024-10-14 11:27:44,353 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 307 transitions. Word has length 139 [2024-10-14 11:27:44,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:27:44,354 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 307 transitions. [2024-10-14 11:27:44,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:27:44,354 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 307 transitions. [2024-10-14 11:27:44,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 11:27:44,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:27:44,358 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:27:44,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 11:27:44,358 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:27:44,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:27:44,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1380983938, now seen corresponding path program 1 times [2024-10-14 11:27:44,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:27:44,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274064816] [2024-10-14 11:27:44,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:27:44,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:27:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:27:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:27:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:27:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:27:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:27:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:27:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:27:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:27:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:27:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:27:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:27:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:27:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:27:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:27:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:27:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:27:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:27:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:27:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:27:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:27:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 11:27:44,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:27:44,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274064816] [2024-10-14 11:27:44,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274064816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:27:44,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:27:44,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:27:44,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116331739] [2024-10-14 11:27:44,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:27:44,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:27:44,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:27:44,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:27:44,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:27:44,583 INFO L87 Difference]: Start difference. First operand 205 states and 307 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:27:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:27:44,743 INFO L93 Difference]: Finished difference Result 457 states and 681 transitions. [2024-10-14 11:27:44,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:27:44,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-14 11:27:44,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:27:44,746 INFO L225 Difference]: With dead ends: 457 [2024-10-14 11:27:44,746 INFO L226 Difference]: Without dead ends: 305 [2024-10-14 11:27:44,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:27:44,748 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 148 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:27:44,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 304 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:27:44,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-14 11:27:44,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 205. [2024-10-14 11:27:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 152 states have (on average 1.375) internal successors, (209), 153 states have internal predecessors, (209), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 11:27:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 305 transitions. [2024-10-14 11:27:44,768 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 305 transitions. Word has length 139 [2024-10-14 11:27:44,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:27:44,768 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 305 transitions. [2024-10-14 11:27:44,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:27:44,769 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 305 transitions. [2024-10-14 11:27:44,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 11:27:44,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:27:44,770 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:27:44,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 11:27:44,771 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:27:44,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:27:44,771 INFO L85 PathProgramCache]: Analyzing trace with hash -953591046, now seen corresponding path program 1 times [2024-10-14 11:27:44,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:27:44,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082767101] [2024-10-14 11:27:44,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:27:44,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:27:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:27:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:27:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:27:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:27:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:27:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:27:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:27:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:27:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:27:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:27:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:27:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:27:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:27:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:27:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:27:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:27:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:27:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:27:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:27:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:27:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 11:27:45,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:27:45,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082767101] [2024-10-14 11:27:45,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082767101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:27:45,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:27:45,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 11:27:45,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910080051] [2024-10-14 11:27:45,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:27:45,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 11:27:45,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:27:45,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 11:27:45,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:27:45,052 INFO L87 Difference]: Start difference. First operand 205 states and 305 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:27:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:27:45,296 INFO L93 Difference]: Finished difference Result 435 states and 646 transitions. [2024-10-14 11:27:45,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 11:27:45,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-14 11:27:45,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:27:45,299 INFO L225 Difference]: With dead ends: 435 [2024-10-14 11:27:45,299 INFO L226 Difference]: Without dead ends: 283 [2024-10-14 11:27:45,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 11:27:45,301 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 159 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:27:45,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 526 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:27:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-14 11:27:45,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 268. [2024-10-14 11:27:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 193 states have (on average 1.3575129533678756) internal successors, (262), 195 states have internal predecessors, (262), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-14 11:27:45,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 398 transitions. [2024-10-14 11:27:45,335 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 398 transitions. Word has length 139 [2024-10-14 11:27:45,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:27:45,336 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 398 transitions. [2024-10-14 11:27:45,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:27:45,336 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 398 transitions. [2024-10-14 11:27:45,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 11:27:45,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:27:45,338 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:27:45,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 11:27:45,338 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:27:45,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:27:45,339 INFO L85 PathProgramCache]: Analyzing trace with hash 821416316, now seen corresponding path program 1 times [2024-10-14 11:27:45,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:27:45,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703109185] [2024-10-14 11:27:45,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:27:45,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:27:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:27:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:27:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:27:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:27:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:27:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:27:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:27:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:27:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:27:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:27:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:27:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:27:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:27:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:27:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:27:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:27:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:27:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:27:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:27:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:27:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 11:27:50,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:27:50,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703109185] [2024-10-14 11:27:50,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703109185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:27:50,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:27:50,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 11:27:50,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419125204] [2024-10-14 11:27:50,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:27:50,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 11:27:50,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:27:50,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 11:27:50,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:27:50,901 INFO L87 Difference]: Start difference. First operand 268 states and 398 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:27:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:27:51,583 INFO L93 Difference]: Finished difference Result 571 states and 841 transitions. [2024-10-14 11:27:51,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 11:27:51,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-14 11:27:51,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:27:51,590 INFO L225 Difference]: With dead ends: 571 [2024-10-14 11:27:51,591 INFO L226 Difference]: Without dead ends: 356 [2024-10-14 11:27:51,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:27:51,593 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 219 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 11:27:51,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 362 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 11:27:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-14 11:27:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 295. [2024-10-14 11:27:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 220 states have (on average 1.3590909090909091) internal successors, (299), 222 states have internal predecessors, (299), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-14 11:27:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 435 transitions. [2024-10-14 11:27:51,630 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 435 transitions. Word has length 139 [2024-10-14 11:27:51,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:27:51,631 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 435 transitions. [2024-10-14 11:27:51,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:27:51,632 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 435 transitions. [2024-10-14 11:27:51,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 11:27:51,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:27:51,633 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:27:51,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 11:27:51,633 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:27:51,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:27:51,634 INFO L85 PathProgramCache]: Analyzing trace with hash 980799791, now seen corresponding path program 1 times [2024-10-14 11:27:51,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:27:51,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447827681] [2024-10-14 11:27:51,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:27:51,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:27:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:28:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:28:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:28:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:28:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:28:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:28:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:28:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:28:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:28:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:28:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:28:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:28:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:28:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:28:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:28:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:28:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:28:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:28:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:28:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:28:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 11:28:13,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:28:13,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447827681] [2024-10-14 11:28:13,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447827681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:28:13,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:28:13,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 11:28:13,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212118278] [2024-10-14 11:28:13,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:28:13,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 11:28:13,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:28:13,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 11:28:13,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-14 11:28:13,450 INFO L87 Difference]: Start difference. First operand 295 states and 435 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:28:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:28:14,313 INFO L93 Difference]: Finished difference Result 776 states and 1128 transitions. [2024-10-14 11:28:14,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 11:28:14,314 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-10-14 11:28:14,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:28:14,317 INFO L225 Difference]: With dead ends: 776 [2024-10-14 11:28:14,318 INFO L226 Difference]: Without dead ends: 534 [2024-10-14 11:28:14,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2024-10-14 11:28:14,322 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 252 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 11:28:14,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 584 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 11:28:14,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-10-14 11:28:14,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 321. [2024-10-14 11:28:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 246 states have (on average 1.3699186991869918) internal successors, (337), 248 states have internal predecessors, (337), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-14 11:28:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 473 transitions. [2024-10-14 11:28:14,350 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 473 transitions. Word has length 140 [2024-10-14 11:28:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:28:14,351 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 473 transitions. [2024-10-14 11:28:14,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:28:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 473 transitions. [2024-10-14 11:28:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 11:28:14,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:28:14,353 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:28:14,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 11:28:14,353 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:28:14,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:28:14,354 INFO L85 PathProgramCache]: Analyzing trace with hash 171453165, now seen corresponding path program 1 times [2024-10-14 11:28:14,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:28:14,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548586305] [2024-10-14 11:28:14,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:28:14,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:28:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:28:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:28:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:28:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:28:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:28:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:28:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:28:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:28:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:28:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:28:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:28:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:28:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:28:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:28:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:28:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:28:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:28:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:28:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:28:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:28:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:21,659 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 11:28:21,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:28:21,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548586305] [2024-10-14 11:28:21,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548586305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:28:21,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:28:21,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 11:28:21,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670423387] [2024-10-14 11:28:21,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:28:21,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 11:28:21,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:28:21,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 11:28:21,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-14 11:28:21,661 INFO L87 Difference]: Start difference. First operand 321 states and 473 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:28:23,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:28:23,244 INFO L93 Difference]: Finished difference Result 829 states and 1204 transitions. [2024-10-14 11:28:23,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 11:28:23,245 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-10-14 11:28:23,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:28:23,248 INFO L225 Difference]: With dead ends: 829 [2024-10-14 11:28:23,248 INFO L226 Difference]: Without dead ends: 561 [2024-10-14 11:28:23,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2024-10-14 11:28:23,250 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 495 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:28:23,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 821 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 11:28:23,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-10-14 11:28:23,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 337. [2024-10-14 11:28:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 262 states have (on average 1.3740458015267176) internal successors, (360), 264 states have internal predecessors, (360), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-14 11:28:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 496 transitions. [2024-10-14 11:28:23,285 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 496 transitions. Word has length 140 [2024-10-14 11:28:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:28:23,285 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 496 transitions. [2024-10-14 11:28:23,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:28:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 496 transitions. [2024-10-14 11:28:23,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 11:28:23,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:28:23,287 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:28:23,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 11:28:23,287 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:28:23,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:28:23,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1452757786, now seen corresponding path program 1 times [2024-10-14 11:28:23,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:28:23,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298309163] [2024-10-14 11:28:23,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:28:23,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:28:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:28:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:28:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:28:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:28:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:28:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:28:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:28:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:28:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:28:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:28:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:28:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:28:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:28:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:28:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:28:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:28:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:28:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:28:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:28:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:28:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:23,436 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 11:28:23,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:28:23,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298309163] [2024-10-14 11:28:23,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298309163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:28:23,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:28:23,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:28:23,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828678801] [2024-10-14 11:28:23,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:28:23,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:28:23,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:28:23,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:28:23,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:28:23,438 INFO L87 Difference]: Start difference. First operand 337 states and 496 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:28:23,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:28:23,531 INFO L93 Difference]: Finished difference Result 772 states and 1129 transitions. [2024-10-14 11:28:23,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:28:23,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-10-14 11:28:23,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:28:23,535 INFO L225 Difference]: With dead ends: 772 [2024-10-14 11:28:23,535 INFO L226 Difference]: Without dead ends: 504 [2024-10-14 11:28:23,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:28:23,537 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 106 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:28:23,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 216 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:28:23,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-10-14 11:28:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 499. [2024-10-14 11:28:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 402 states have (on average 1.3681592039800996) internal successors, (550), 407 states have internal predecessors, (550), 86 states have call successors, (86), 10 states have call predecessors, (86), 10 states have return successors, (86), 81 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-14 11:28:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 722 transitions. [2024-10-14 11:28:23,580 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 722 transitions. Word has length 140 [2024-10-14 11:28:23,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:28:23,581 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 722 transitions. [2024-10-14 11:28:23,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:28:23,581 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 722 transitions. [2024-10-14 11:28:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 11:28:23,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:28:23,584 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:28:23,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 11:28:23,584 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:28:23,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:28:23,585 INFO L85 PathProgramCache]: Analyzing trace with hash -846292639, now seen corresponding path program 1 times [2024-10-14 11:28:23,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:28:23,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903922575] [2024-10-14 11:28:23,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:28:23,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:28:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:28:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:28:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:28:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:28:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:28:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:28:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:28:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:28:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:28:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:28:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:28:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:28:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:28:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:28:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:28:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:28:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:28:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:28:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:28:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:28:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 11:28:27,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:28:27,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903922575] [2024-10-14 11:28:27,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903922575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:28:27,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:28:27,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 11:28:27,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659185884] [2024-10-14 11:28:27,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:28:27,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 11:28:27,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:28:27,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 11:28:27,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:28:27,816 INFO L87 Difference]: Start difference. First operand 499 states and 722 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:28:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:28:28,264 INFO L93 Difference]: Finished difference Result 1209 states and 1744 transitions. [2024-10-14 11:28:28,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 11:28:28,265 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-10-14 11:28:28,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:28:28,271 INFO L225 Difference]: With dead ends: 1209 [2024-10-14 11:28:28,271 INFO L226 Difference]: Without dead ends: 797 [2024-10-14 11:28:28,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:28:28,273 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 207 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:28:28,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 398 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 11:28:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-10-14 11:28:28,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 519. [2024-10-14 11:28:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 422 states have (on average 1.372037914691943) internal successors, (579), 427 states have internal predecessors, (579), 86 states have call successors, (86), 10 states have call predecessors, (86), 10 states have return successors, (86), 81 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-14 11:28:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 751 transitions. [2024-10-14 11:28:28,319 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 751 transitions. Word has length 140 [2024-10-14 11:28:28,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:28:28,319 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 751 transitions. [2024-10-14 11:28:28,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:28:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 751 transitions. [2024-10-14 11:28:28,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 11:28:28,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:28:28,322 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:28:28,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 11:28:28,322 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:28:28,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:28:28,323 INFO L85 PathProgramCache]: Analyzing trace with hash 928714723, now seen corresponding path program 1 times [2024-10-14 11:28:28,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:28:28,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13604616] [2024-10-14 11:28:28,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:28:28,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:28:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:28:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:28:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:28:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:28:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:28:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:28:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:28:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:28:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:28:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:28:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:28:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:28:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:28:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:28:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:28:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:28:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:28:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:28:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:28:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:28:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 11:28:29,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:28:29,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13604616] [2024-10-14 11:28:29,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13604616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:28:29,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:28:29,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 11:28:29,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010545037] [2024-10-14 11:28:29,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:28:29,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 11:28:29,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:28:29,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 11:28:29,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 11:28:29,415 INFO L87 Difference]: Start difference. First operand 519 states and 751 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 11:28:30,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:28:30,714 INFO L93 Difference]: Finished difference Result 1657 states and 2356 transitions. [2024-10-14 11:28:30,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 11:28:30,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 140 [2024-10-14 11:28:30,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:28:30,721 INFO L225 Difference]: With dead ends: 1657 [2024-10-14 11:28:30,721 INFO L226 Difference]: Without dead ends: 1201 [2024-10-14 11:28:30,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2024-10-14 11:28:30,724 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 446 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 11:28:30,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 1090 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 11:28:30,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2024-10-14 11:28:30,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 895. [2024-10-14 11:28:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 785 states have (on average 1.4063694267515923) internal successors, (1104), 794 states have internal predecessors, (1104), 94 states have call successors, (94), 15 states have call predecessors, (94), 15 states have return successors, (94), 85 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-14 11:28:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1292 transitions. [2024-10-14 11:28:30,804 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1292 transitions. Word has length 140 [2024-10-14 11:28:30,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:28:30,805 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1292 transitions. [2024-10-14 11:28:30,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 11:28:30,805 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1292 transitions. [2024-10-14 11:28:30,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 11:28:30,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:28:30,808 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:28:30,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 11:28:30,808 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:28:30,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:28:30,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2091333981, now seen corresponding path program 1 times [2024-10-14 11:28:30,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:28:30,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403734256] [2024-10-14 11:28:30,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:28:30,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:28:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:28:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:28:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:28:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:28:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:28:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:28:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:28:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:28:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:28:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:28:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:28:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:28:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:28:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:28:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:28:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:28:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:28:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:28:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:28:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:28:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:28:31,054 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 11:28:31,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:28:31,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403734256] [2024-10-14 11:28:31,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403734256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:28:31,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:28:31,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 11:28:31,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744116732] [2024-10-14 11:28:31,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:28:31,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 11:28:31,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:28:31,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 11:28:31,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:28:31,056 INFO L87 Difference]: Start difference. First operand 895 states and 1292 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:28:31,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:28:31,287 INFO L93 Difference]: Finished difference Result 1593 states and 2307 transitions. [2024-10-14 11:28:31,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 11:28:31,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-10-14 11:28:31,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:28:31,293 INFO L225 Difference]: With dead ends: 1593 [2024-10-14 11:28:31,293 INFO L226 Difference]: Without dead ends: 1103 [2024-10-14 11:28:31,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 11:28:31,295 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 195 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:28:31,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 481 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:28:31,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2024-10-14 11:28:31,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 726. [2024-10-14 11:28:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 666 states have (on average 1.412912912912913) internal successors, (941), 669 states have internal predecessors, (941), 50 states have call successors, (50), 9 states have call predecessors, (50), 9 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-14 11:28:31,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1041 transitions. [2024-10-14 11:28:31,351 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1041 transitions. Word has length 140 [2024-10-14 11:28:31,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:28:31,351 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1041 transitions. [2024-10-14 11:28:31,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 11:28:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1041 transitions. [2024-10-14 11:28:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 11:28:31,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:28:31,353 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:28:31,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 11:28:31,353 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:28:31,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:28:31,354 INFO L85 PathProgramCache]: Analyzing trace with hash -316326619, now seen corresponding path program 1 times [2024-10-14 11:28:31,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:28:31,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108683578] [2024-10-14 11:28:31,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:28:31,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:28:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat